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_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:13:01,910 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:13:01,912 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:13:01,925 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:13:01,925 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:13:01,926 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:13:01,927 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:13:01,929 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:13:01,931 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:13:01,932 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:13:01,932 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:13:01,933 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:13:01,934 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:13:01,935 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:13:01,936 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:13:01,936 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:13:01,937 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:13:01,939 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:13:01,941 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:13:01,942 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:13:01,943 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:13:01,945 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:13:01,947 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:13:01,947 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:13:01,947 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:13:01,948 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:13:01,949 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:13:01,950 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:13:01,951 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:13:01,952 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:13:01,952 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:13:01,952 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:13:01,953 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:13:01,953 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:13:01,954 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:13:01,954 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:13:01,955 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:01,970 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:13:01,970 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:13:01,971 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:13:01,971 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:13:01,972 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:13:01,972 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:13:01,972 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:13:01,973 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:13:01,973 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:13:01,973 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:13:01,973 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:13:01,974 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:13:01,974 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:13:01,974 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:13:01,974 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:13:01,974 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:13:01,975 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:13:01,975 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:13:01,975 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:13:01,975 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:13:01,975 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:13:01,976 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:13:01,976 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:13:01,976 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:13:01,976 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:13:01,976 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:13:01,977 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:13:01,977 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:13:01,977 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:13:01,977 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:13:01,977 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:13:02,033 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:13:02,051 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:13:02,053 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:13:02,055 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:13:02,055 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:13:02,055 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_true-termination.i [2018-11-23 13:13:02,110 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bea5b0fc3/cf17f766364d4cd5bfe1d0f411d25dd8/FLAG9e85e7b7d [2018-11-23 13:13:02,507 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:13:02,507 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum_true-unreach-call_true-termination.i [2018-11-23 13:13:02,512 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bea5b0fc3/cf17f766364d4cd5bfe1d0f411d25dd8/FLAG9e85e7b7d [2018-11-23 13:13:02,876 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bea5b0fc3/cf17f766364d4cd5bfe1d0f411d25dd8 [2018-11-23 13:13:02,886 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:13:02,887 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:13:02,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:13:02,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:13:02,895 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:13:02,896 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:13:02" (1/1) ... [2018-11-23 13:13:02,899 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@130d3896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:02, skipping insertion in model container [2018-11-23 13:13:02,899 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:13:02" (1/1) ... [2018-11-23 13:13:02,910 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:13:02,935 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:13:03,169 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:13:03,175 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:13:03,198 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:13:03,215 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:13:03,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:03 WrapperNode [2018-11-23 13:13:03,216 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:13:03,217 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:13:03,217 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:13:03,218 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:13:03,227 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:03" (1/1) ... [2018-11-23 13:13:03,232 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:03" (1/1) ... [2018-11-23 13:13:03,239 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:13:03,239 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:13:03,239 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:13:03,240 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:13:03,248 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:03" (1/1) ... [2018-11-23 13:13:03,249 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:03" (1/1) ... [2018-11-23 13:13:03,249 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:03" (1/1) ... [2018-11-23 13:13:03,250 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:03" (1/1) ... [2018-11-23 13:13:03,256 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:03" (1/1) ... [2018-11-23 13:13:03,261 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:03" (1/1) ... [2018-11-23 13:13:03,262 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:03" (1/1) ... [2018-11-23 13:13:03,263 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:13:03,263 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:13:03,264 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:13:03,264 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:13:03,265 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:03" (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:03,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:13:03,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:13:03,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:13:03,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:13:03,394 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:13:03,394 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:13:03,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:13:03,394 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:13:03,842 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:13:03,842 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:13:03,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:13:03 BoogieIcfgContainer [2018-11-23 13:13:03,842 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:13:03,843 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:13:03,843 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:13:03,847 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:13:03,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:13:02" (1/3) ... [2018-11-23 13:13:03,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e89dfec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:13:03, skipping insertion in model container [2018-11-23 13:13:03,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:03" (2/3) ... [2018-11-23 13:13:03,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e89dfec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:13:03, skipping insertion in model container [2018-11-23 13:13:03,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:13:03" (3/3) ... [2018-11-23 13:13:03,851 INFO L112 eAbstractionObserver]: Analyzing ICFG gauss_sum_true-unreach-call_true-termination.i [2018-11-23 13:13:03,860 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:13:03,867 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:13:03,883 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:13:03,915 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:13:03,916 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:13:03,916 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:13:03,916 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:13:03,917 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:13:03,917 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:13:03,917 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:13:03,917 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:13:03,917 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:13:03,936 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-23 13:13:03,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:13:03,942 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:03,943 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:03,946 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:03,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:03,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1281911547, now seen corresponding path program 1 times [2018-11-23 13:13:03,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:03,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:04,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:04,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:13:04,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:04,133 INFO L256 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2018-11-23 13:13:04,138 INFO L273 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2018-11-23 13:13:04,138 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #37#return; {23#true} is VALID [2018-11-23 13:13:04,139 INFO L256 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret3 := main(); {23#true} is VALID [2018-11-23 13:13:04,139 INFO L273 TraceCheckUtils]: 4: Hoare triple {23#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {23#true} is VALID [2018-11-23 13:13:04,140 INFO L273 TraceCheckUtils]: 5: Hoare triple {23#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {23#true} is VALID [2018-11-23 13:13:04,156 INFO L273 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2018-11-23 13:13:04,156 INFO L256 TraceCheckUtils]: 7: Hoare triple {24#false} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {24#false} is VALID [2018-11-23 13:13:04,157 INFO L273 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2018-11-23 13:13:04,157 INFO L273 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2018-11-23 13:13:04,158 INFO L273 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2018-11-23 13:13:04,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:04,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:13:04,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:13:04,172 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 13:13:04,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:04,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:13:04,226 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:04,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:13:04,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:13:04,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:13:04,239 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-23 13:13:04,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:04,312 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 13:13:04,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:13:04,313 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 13:13:04,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:04,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:13:04,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2018-11-23 13:13:04,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:13:04,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2018-11-23 13:13:04,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 36 transitions. [2018-11-23 13:13:04,621 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:13:04,631 INFO L225 Difference]: With dead ends: 32 [2018-11-23 13:13:04,631 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 13:13:04,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:13:04,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 13:13:04,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 13:13:04,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:04,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-23 13:13:04,752 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:13:04,752 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:13:04,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:04,756 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 13:13:04,756 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:13:04,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:04,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:04,757 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:13:04,757 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:13:04,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:04,760 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 13:13:04,760 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:13:04,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:04,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:04,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:04,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:04,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:13:04,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-23 13:13:04,765 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-11-23 13:13:04,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:04,765 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-23 13:13:04,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:13:04,766 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:13:04,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:13:04,766 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:04,767 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:04,767 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:04,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:04,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1287452673, now seen corresponding path program 1 times [2018-11-23 13:13:04,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:04,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:04,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:04,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:13:04,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:04,776 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:13:04,776 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:13:04,776 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:04,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:13:04,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:04,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:05,122 INFO L256 TraceCheckUtils]: 0: Hoare triple {114#true} call ULTIMATE.init(); {114#true} is VALID [2018-11-23 13:13:05,123 INFO L273 TraceCheckUtils]: 1: Hoare triple {114#true} assume true; {114#true} is VALID [2018-11-23 13:13:05,123 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {114#true} {114#true} #37#return; {114#true} is VALID [2018-11-23 13:13:05,124 INFO L256 TraceCheckUtils]: 3: Hoare triple {114#true} call #t~ret3 := main(); {114#true} is VALID [2018-11-23 13:13:05,124 INFO L273 TraceCheckUtils]: 4: Hoare triple {114#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {114#true} is VALID [2018-11-23 13:13:05,126 INFO L273 TraceCheckUtils]: 5: Hoare triple {114#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {134#(and (<= main_~i~0 1) (<= 1 main_~n~0))} is VALID [2018-11-23 13:13:05,135 INFO L273 TraceCheckUtils]: 6: Hoare triple {134#(and (<= main_~i~0 1) (<= 1 main_~n~0))} assume !(~i~0 <= ~n~0); {115#false} is VALID [2018-11-23 13:13:05,135 INFO L256 TraceCheckUtils]: 7: Hoare triple {115#false} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {115#false} is VALID [2018-11-23 13:13:05,135 INFO L273 TraceCheckUtils]: 8: Hoare triple {115#false} ~cond := #in~cond; {115#false} is VALID [2018-11-23 13:13:05,136 INFO L273 TraceCheckUtils]: 9: Hoare triple {115#false} assume 0 == ~cond; {115#false} is VALID [2018-11-23 13:13:05,136 INFO L273 TraceCheckUtils]: 10: Hoare triple {115#false} assume !false; {115#false} is VALID [2018-11-23 13:13:05,137 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:05,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:13:05,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:13:05,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-23 13:13:05,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:05,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:13:05,216 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:05,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:13:05,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:13:05,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:13:05,217 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 3 states. [2018-11-23 13:13:05,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:05,354 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 13:13:05,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:13:05,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-23 13:13:05,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:05,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:13:05,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2018-11-23 13:13:05,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:13:05,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2018-11-23 13:13:05,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 20 transitions. [2018-11-23 13:13:05,422 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:05,424 INFO L225 Difference]: With dead ends: 20 [2018-11-23 13:13:05,425 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 13:13:05,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:13:05,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 13:13:05,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-11-23 13:13:05,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:05,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 14 states. [2018-11-23 13:13:05,467 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 14 states. [2018-11-23 13:13:05,467 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 14 states. [2018-11-23 13:13:05,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:05,469 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 13:13:05,469 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 13:13:05,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:05,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:05,469 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 15 states. [2018-11-23 13:13:05,471 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 15 states. [2018-11-23 13:13:05,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:05,474 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 13:13:05,475 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 13:13:05,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:05,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:05,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:05,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:05,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:13:05,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-23 13:13:05,478 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-11-23 13:13:05,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:05,478 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-23 13:13:05,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:13:05,479 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:13:05,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:13:05,479 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:05,479 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:05,480 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:05,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:05,480 INFO L82 PathProgramCache]: Analyzing trace with hash 843923389, now seen corresponding path program 1 times [2018-11-23 13:13:05,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:05,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:05,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:05,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:13:05,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:05,493 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:13:05,493 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:13:05,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 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:05,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:13:05,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:05,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:06,263 INFO L256 TraceCheckUtils]: 0: Hoare triple {231#true} call ULTIMATE.init(); {231#true} is VALID [2018-11-23 13:13:06,263 INFO L273 TraceCheckUtils]: 1: Hoare triple {231#true} assume true; {231#true} is VALID [2018-11-23 13:13:06,264 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {231#true} {231#true} #37#return; {231#true} is VALID [2018-11-23 13:13:06,264 INFO L256 TraceCheckUtils]: 3: Hoare triple {231#true} call #t~ret3 := main(); {231#true} is VALID [2018-11-23 13:13:06,265 INFO L273 TraceCheckUtils]: 4: Hoare triple {231#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {231#true} is VALID [2018-11-23 13:13:06,274 INFO L273 TraceCheckUtils]: 5: Hoare triple {231#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {251#(and (= main_~sum~0 0) (= main_~i~0 1) (<= 1 main_~n~0))} is VALID [2018-11-23 13:13:06,279 INFO L273 TraceCheckUtils]: 6: Hoare triple {251#(and (= main_~sum~0 0) (= main_~i~0 1) (<= 1 main_~n~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {255#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1) (<= 1 main_~n~0))} is VALID [2018-11-23 13:13:06,281 INFO L273 TraceCheckUtils]: 7: Hoare triple {255#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1) (<= 1 main_~n~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {259#(and (<= main_~i~0 2) (= main_~sum~0 1) (<= 1 main_~n~0))} is VALID [2018-11-23 13:13:06,282 INFO L273 TraceCheckUtils]: 8: Hoare triple {259#(and (<= main_~i~0 2) (= main_~sum~0 1) (<= 1 main_~n~0))} assume !(~i~0 <= ~n~0); {263#(and (= main_~sum~0 1) (<= 1 main_~n~0) (<= main_~n~0 1))} is VALID [2018-11-23 13:13:06,287 INFO L256 TraceCheckUtils]: 9: Hoare triple {263#(and (= main_~sum~0 1) (<= 1 main_~n~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {267#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:13:06,290 INFO L273 TraceCheckUtils]: 10: Hoare triple {267#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {271#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:13:06,293 INFO L273 TraceCheckUtils]: 11: Hoare triple {271#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {232#false} is VALID [2018-11-23 13:13:06,293 INFO L273 TraceCheckUtils]: 12: Hoare triple {232#false} assume !false; {232#false} is VALID [2018-11-23 13:13:06,295 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:06,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:13:06,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-23 13:13:06,314 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-11-23 13:13:06,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:06,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:13:06,338 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:06,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:13:06,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:13:06,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:13:06,339 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 8 states. [2018-11-23 13:13:06,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:06,769 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 13:13:06,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:13:06,770 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-11-23 13:13:06,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:06,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:13:06,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2018-11-23 13:13:06,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:13:06,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2018-11-23 13:13:06,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 21 transitions. [2018-11-23 13:13:06,848 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:06,849 INFO L225 Difference]: With dead ends: 21 [2018-11-23 13:13:06,850 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 13:13:06,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:13:06,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 13:13:06,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 13:13:06,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:06,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-23 13:13:06,874 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:13:06,874 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:13:06,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:06,876 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 13:13:06,876 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:13:06,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:06,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:06,877 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:13:06,877 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:13:06,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:06,879 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 13:13:06,879 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:13:06,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:06,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:06,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:06,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:06,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:13:06,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-23 13:13:06,882 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-11-23 13:13:06,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:06,882 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-23 13:13:06,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:13:06,882 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:13:06,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:13:06,883 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:06,883 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:06,883 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:06,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:06,884 INFO L82 PathProgramCache]: Analyzing trace with hash 396918779, now seen corresponding path program 2 times [2018-11-23 13:13:06,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:06,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:06,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:06,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:13:06,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:06,894 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:13:06,895 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:13:06,895 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:06,906 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:13:06,919 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:13:06,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:06,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:07,344 INFO L256 TraceCheckUtils]: 0: Hoare triple {370#true} call ULTIMATE.init(); {370#true} is VALID [2018-11-23 13:13:07,345 INFO L273 TraceCheckUtils]: 1: Hoare triple {370#true} assume true; {370#true} is VALID [2018-11-23 13:13:07,345 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {370#true} {370#true} #37#return; {370#true} is VALID [2018-11-23 13:13:07,345 INFO L256 TraceCheckUtils]: 3: Hoare triple {370#true} call #t~ret3 := main(); {370#true} is VALID [2018-11-23 13:13:07,345 INFO L273 TraceCheckUtils]: 4: Hoare triple {370#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {370#true} is VALID [2018-11-23 13:13:07,347 INFO L273 TraceCheckUtils]: 5: Hoare triple {370#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {390#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-23 13:13:07,348 INFO L273 TraceCheckUtils]: 6: Hoare triple {390#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {394#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-23 13:13:07,349 INFO L273 TraceCheckUtils]: 7: Hoare triple {394#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {398#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} is VALID [2018-11-23 13:13:07,350 INFO L273 TraceCheckUtils]: 8: Hoare triple {398#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {402#(and (= main_~i~0 2) (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-23 13:13:07,351 INFO L273 TraceCheckUtils]: 9: Hoare triple {402#(and (= main_~i~0 2) (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {406#(and (<= main_~i~0 3) (<= 2 main_~n~0) (= main_~sum~0 3))} is VALID [2018-11-23 13:13:07,353 INFO L273 TraceCheckUtils]: 10: Hoare triple {406#(and (<= main_~i~0 3) (<= 2 main_~n~0) (= main_~sum~0 3))} assume !(~i~0 <= ~n~0); {410#(and (<= 2 main_~n~0) (<= main_~n~0 2) (= main_~sum~0 3))} is VALID [2018-11-23 13:13:07,354 INFO L256 TraceCheckUtils]: 11: Hoare triple {410#(and (<= 2 main_~n~0) (<= main_~n~0 2) (= main_~sum~0 3))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {414#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:13:07,355 INFO L273 TraceCheckUtils]: 12: Hoare triple {414#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {418#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:13:07,356 INFO L273 TraceCheckUtils]: 13: Hoare triple {418#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {371#false} is VALID [2018-11-23 13:13:07,356 INFO L273 TraceCheckUtils]: 14: Hoare triple {371#false} assume !false; {371#false} is VALID [2018-11-23 13:13:07,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:07,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:13:07,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-11-23 13:13:07,379 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-11-23 13:13:07,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:07,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 13:13:07,402 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:07,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:13:07,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:13:07,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:13:07,404 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 10 states. [2018-11-23 13:13:07,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:07,781 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-23 13:13:07,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:13:07,782 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-11-23 13:13:07,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:07,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:13:07,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 23 transitions. [2018-11-23 13:13:07,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:13:07,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 23 transitions. [2018-11-23 13:13:07,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 23 transitions. [2018-11-23 13:13:07,831 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:07,832 INFO L225 Difference]: With dead ends: 23 [2018-11-23 13:13:07,832 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 13:13:07,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:13:07,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 13:13:07,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 13:13:07,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:07,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-23 13:13:07,856 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 13:13:07,856 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 13:13:07,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:07,859 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:13:07,859 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:13:07,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:07,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:07,860 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 13:13:07,860 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 13:13:07,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:07,861 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:13:07,862 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:13:07,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:07,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:07,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:07,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:07,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:13:07,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-23 13:13:07,864 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-11-23 13:13:07,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:07,865 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-23 13:13:07,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:13:07,865 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:13:07,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:13:07,866 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:07,866 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:07,866 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:07,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:07,867 INFO L82 PathProgramCache]: Analyzing trace with hash 322218169, now seen corresponding path program 3 times [2018-11-23 13:13:07,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:07,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:07,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:07,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:07,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:07,877 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:13:07,877 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:13:07,878 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:07,889 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:13:07,900 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 13:13:07,900 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:07,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:08,162 INFO L256 TraceCheckUtils]: 0: Hoare triple {527#true} call ULTIMATE.init(); {527#true} is VALID [2018-11-23 13:13:08,163 INFO L273 TraceCheckUtils]: 1: Hoare triple {527#true} assume true; {527#true} is VALID [2018-11-23 13:13:08,163 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {527#true} {527#true} #37#return; {527#true} is VALID [2018-11-23 13:13:08,164 INFO L256 TraceCheckUtils]: 3: Hoare triple {527#true} call #t~ret3 := main(); {527#true} is VALID [2018-11-23 13:13:08,164 INFO L273 TraceCheckUtils]: 4: Hoare triple {527#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {527#true} is VALID [2018-11-23 13:13:08,168 INFO L273 TraceCheckUtils]: 5: Hoare triple {527#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {547#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-23 13:13:08,168 INFO L273 TraceCheckUtils]: 6: Hoare triple {547#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {551#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-23 13:13:08,169 INFO L273 TraceCheckUtils]: 7: Hoare triple {551#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {555#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2018-11-23 13:13:08,170 INFO L273 TraceCheckUtils]: 8: Hoare triple {555#(and (= main_~i~0 2) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {559#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-23 13:13:08,171 INFO L273 TraceCheckUtils]: 9: Hoare triple {559#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {563#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-23 13:13:08,172 INFO L273 TraceCheckUtils]: 10: Hoare triple {563#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {567#(and (= main_~i~0 3) (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-23 13:13:08,173 INFO L273 TraceCheckUtils]: 11: Hoare triple {567#(and (= main_~i~0 3) (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {571#(and (<= 3 main_~n~0) (= main_~sum~0 6) (<= main_~i~0 4))} is VALID [2018-11-23 13:13:08,177 INFO L273 TraceCheckUtils]: 12: Hoare triple {571#(and (<= 3 main_~n~0) (= main_~sum~0 6) (<= main_~i~0 4))} assume !(~i~0 <= ~n~0); {575#(and (<= 3 main_~n~0) (= main_~sum~0 6) (<= main_~n~0 3))} is VALID [2018-11-23 13:13:08,178 INFO L256 TraceCheckUtils]: 13: Hoare triple {575#(and (<= 3 main_~n~0) (= main_~sum~0 6) (<= main_~n~0 3))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {579#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:13:08,178 INFO L273 TraceCheckUtils]: 14: Hoare triple {579#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {583#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:13:08,179 INFO L273 TraceCheckUtils]: 15: Hoare triple {583#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {528#false} is VALID [2018-11-23 13:13:08,180 INFO L273 TraceCheckUtils]: 16: Hoare triple {528#false} assume !false; {528#false} is VALID [2018-11-23 13:13:08,181 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:08,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:13:08,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-11-23 13:13:08,202 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-11-23 13:13:08,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:08,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 13:13:08,274 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:08,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 13:13:08,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:13:08,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:13:08,275 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 12 states. [2018-11-23 13:13:08,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:08,727 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-23 13:13:08,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:13:08,728 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-11-23 13:13:08,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:08,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:13:08,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 25 transitions. [2018-11-23 13:13:08,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:13:08,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 25 transitions. [2018-11-23 13:13:08,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 25 transitions. [2018-11-23 13:13:08,771 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:08,772 INFO L225 Difference]: With dead ends: 25 [2018-11-23 13:13:08,772 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 13:13:08,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:13:08,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 13:13:08,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 13:13:08,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:08,818 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 13:13:08,819 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 13:13:08,819 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 13:13:08,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:08,821 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 13:13:08,821 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 13:13:08,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:08,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:08,822 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 13:13:08,822 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 13:13:08,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:08,824 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 13:13:08,824 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 13:13:08,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:08,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:08,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:08,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:08,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:13:08,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-23 13:13:08,826 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-11-23 13:13:08,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:08,827 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-23 13:13:08,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 13:13:08,827 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 13:13:08,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:13:08,828 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:08,828 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:08,828 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:08,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:08,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1549375991, now seen corresponding path program 4 times [2018-11-23 13:13:08,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:08,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:08,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:08,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:08,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:08,840 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:13:08,840 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:13:08,841 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:08,859 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:13:08,916 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:13:08,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:08,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:09,295 INFO L256 TraceCheckUtils]: 0: Hoare triple {702#true} call ULTIMATE.init(); {702#true} is VALID [2018-11-23 13:13:09,296 INFO L273 TraceCheckUtils]: 1: Hoare triple {702#true} assume true; {702#true} is VALID [2018-11-23 13:13:09,296 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {702#true} {702#true} #37#return; {702#true} is VALID [2018-11-23 13:13:09,297 INFO L256 TraceCheckUtils]: 3: Hoare triple {702#true} call #t~ret3 := main(); {702#true} is VALID [2018-11-23 13:13:09,297 INFO L273 TraceCheckUtils]: 4: Hoare triple {702#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {702#true} is VALID [2018-11-23 13:13:09,298 INFO L273 TraceCheckUtils]: 5: Hoare triple {702#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {722#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-23 13:13:09,299 INFO L273 TraceCheckUtils]: 6: Hoare triple {722#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {726#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-23 13:13:09,299 INFO L273 TraceCheckUtils]: 7: Hoare triple {726#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {730#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} is VALID [2018-11-23 13:13:09,300 INFO L273 TraceCheckUtils]: 8: Hoare triple {730#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {734#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-23 13:13:09,301 INFO L273 TraceCheckUtils]: 9: Hoare triple {734#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {738#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-23 13:13:09,302 INFO L273 TraceCheckUtils]: 10: Hoare triple {738#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {742#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-23 13:13:09,303 INFO L273 TraceCheckUtils]: 11: Hoare triple {742#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {746#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-23 13:13:09,304 INFO L273 TraceCheckUtils]: 12: Hoare triple {746#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {750#(and (= main_~sum~0 (+ main_~i~0 6)) (<= main_~i~0 main_~n~0) (= main_~i~0 4))} is VALID [2018-11-23 13:13:09,305 INFO L273 TraceCheckUtils]: 13: Hoare triple {750#(and (= main_~sum~0 (+ main_~i~0 6)) (<= main_~i~0 main_~n~0) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {754#(and (<= main_~i~0 5) (<= 4 main_~n~0) (= main_~sum~0 10))} is VALID [2018-11-23 13:13:09,306 INFO L273 TraceCheckUtils]: 14: Hoare triple {754#(and (<= main_~i~0 5) (<= 4 main_~n~0) (= main_~sum~0 10))} assume !(~i~0 <= ~n~0); {758#(and (<= main_~n~0 4) (<= 4 main_~n~0) (= main_~sum~0 10))} is VALID [2018-11-23 13:13:09,308 INFO L256 TraceCheckUtils]: 15: Hoare triple {758#(and (<= main_~n~0 4) (<= 4 main_~n~0) (= main_~sum~0 10))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {762#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:13:09,309 INFO L273 TraceCheckUtils]: 16: Hoare triple {762#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {766#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:13:09,310 INFO L273 TraceCheckUtils]: 17: Hoare triple {766#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {703#false} is VALID [2018-11-23 13:13:09,310 INFO L273 TraceCheckUtils]: 18: Hoare triple {703#false} assume !false; {703#false} is VALID [2018-11-23 13:13:09,312 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:09,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:13:09,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-11-23 13:13:09,332 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 19 [2018-11-23 13:13:09,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:09,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 13:13:09,361 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:09,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 13:13:09,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 13:13:09,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:13:09,362 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 14 states. [2018-11-23 13:13:09,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:09,870 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-23 13:13:09,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 13:13:09,870 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 19 [2018-11-23 13:13:09,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:09,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:13:09,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 27 transitions. [2018-11-23 13:13:09,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:13:09,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 27 transitions. [2018-11-23 13:13:09,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 27 transitions. [2018-11-23 13:13:09,923 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:09,925 INFO L225 Difference]: With dead ends: 27 [2018-11-23 13:13:09,925 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 13:13:09,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:13:09,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 13:13:09,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 13:13:09,950 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:09,950 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 13:13:09,950 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 13:13:09,951 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 13:13:09,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:09,953 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-23 13:13:09,953 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-23 13:13:09,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:09,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:09,954 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 13:13:09,954 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 13:13:09,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:09,956 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-23 13:13:09,956 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-23 13:13:09,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:09,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:09,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:09,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:09,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:13:09,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-23 13:13:09,959 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2018-11-23 13:13:09,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:09,959 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-23 13:13:09,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 13:13:09,959 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-23 13:13:09,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 13:13:09,960 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:09,960 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:09,961 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:09,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:09,961 INFO L82 PathProgramCache]: Analyzing trace with hash -267963467, now seen corresponding path program 5 times [2018-11-23 13:13:09,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:09,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:09,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:09,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:09,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:09,973 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:13:09,973 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:13:09,973 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:09,986 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:13:09,998 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 13:13:09,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:10,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:10,481 INFO L256 TraceCheckUtils]: 0: Hoare triple {895#true} call ULTIMATE.init(); {895#true} is VALID [2018-11-23 13:13:10,482 INFO L273 TraceCheckUtils]: 1: Hoare triple {895#true} assume true; {895#true} is VALID [2018-11-23 13:13:10,482 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {895#true} {895#true} #37#return; {895#true} is VALID [2018-11-23 13:13:10,483 INFO L256 TraceCheckUtils]: 3: Hoare triple {895#true} call #t~ret3 := main(); {895#true} is VALID [2018-11-23 13:13:10,483 INFO L273 TraceCheckUtils]: 4: Hoare triple {895#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {895#true} is VALID [2018-11-23 13:13:10,484 INFO L273 TraceCheckUtils]: 5: Hoare triple {895#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {915#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-23 13:13:10,485 INFO L273 TraceCheckUtils]: 6: Hoare triple {915#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {919#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-23 13:13:10,485 INFO L273 TraceCheckUtils]: 7: Hoare triple {919#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {923#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2018-11-23 13:13:10,486 INFO L273 TraceCheckUtils]: 8: Hoare triple {923#(and (= main_~i~0 2) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {927#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-23 13:13:10,487 INFO L273 TraceCheckUtils]: 9: Hoare triple {927#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {931#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-23 13:13:10,488 INFO L273 TraceCheckUtils]: 10: Hoare triple {931#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {935#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-23 13:13:10,489 INFO L273 TraceCheckUtils]: 11: Hoare triple {935#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {939#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-23 13:13:10,490 INFO L273 TraceCheckUtils]: 12: Hoare triple {939#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {943#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-23 13:13:10,491 INFO L273 TraceCheckUtils]: 13: Hoare triple {943#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {947#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-23 13:13:10,492 INFO L273 TraceCheckUtils]: 14: Hoare triple {947#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {951#(and (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-23 13:13:10,493 INFO L273 TraceCheckUtils]: 15: Hoare triple {951#(and (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {955#(and (= main_~sum~0 15) (<= 5 main_~n~0) (<= main_~i~0 6))} is VALID [2018-11-23 13:13:10,494 INFO L273 TraceCheckUtils]: 16: Hoare triple {955#(and (= main_~sum~0 15) (<= 5 main_~n~0) (<= main_~i~0 6))} assume !(~i~0 <= ~n~0); {959#(and (= main_~sum~0 15) (<= main_~n~0 5) (<= 5 main_~n~0))} is VALID [2018-11-23 13:13:10,496 INFO L256 TraceCheckUtils]: 17: Hoare triple {959#(and (= main_~sum~0 15) (<= main_~n~0 5) (<= 5 main_~n~0))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {963#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:13:10,497 INFO L273 TraceCheckUtils]: 18: Hoare triple {963#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {967#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:13:10,501 INFO L273 TraceCheckUtils]: 19: Hoare triple {967#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {896#false} is VALID [2018-11-23 13:13:10,502 INFO L273 TraceCheckUtils]: 20: Hoare triple {896#false} assume !false; {896#false} is VALID [2018-11-23 13:13:10,503 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:10,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:13:10,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-11-23 13:13:10,529 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2018-11-23 13:13:10,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:10,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 13:13:10,555 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:10,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 13:13:10,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 13:13:10,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:13:10,557 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 16 states. [2018-11-23 13:13:11,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:11,329 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-23 13:13:11,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 13:13:11,330 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2018-11-23 13:13:11,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:11,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:13:11,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-11-23 13:13:11,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:13:11,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-11-23 13:13:11,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 29 transitions. [2018-11-23 13:13:11,361 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:11,362 INFO L225 Difference]: With dead ends: 29 [2018-11-23 13:13:11,362 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 13:13:11,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:13:11,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 13:13:11,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 13:13:11,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:11,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-23 13:13:11,538 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 13:13:11,539 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 13:13:11,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:11,540 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-23 13:13:11,540 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-23 13:13:11,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:11,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:11,540 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 13:13:11,541 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 13:13:11,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:11,543 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-23 13:13:11,543 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-23 13:13:11,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:11,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:11,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:11,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:11,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:13:11,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-23 13:13:11,545 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-11-23 13:13:11,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:11,546 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-23 13:13:11,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 13:13:11,546 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-23 13:13:11,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:13:11,547 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:11,547 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:11,547 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:11,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:11,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1320506867, now seen corresponding path program 6 times [2018-11-23 13:13:11,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:11,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:11,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:11,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:11,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:11,561 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:13:11,561 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:13:11,561 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:11,602 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:13:11,618 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 13:13:11,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:11,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:12,122 INFO L256 TraceCheckUtils]: 0: Hoare triple {1106#true} call ULTIMATE.init(); {1106#true} is VALID [2018-11-23 13:13:12,122 INFO L273 TraceCheckUtils]: 1: Hoare triple {1106#true} assume true; {1106#true} is VALID [2018-11-23 13:13:12,123 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1106#true} {1106#true} #37#return; {1106#true} is VALID [2018-11-23 13:13:12,123 INFO L256 TraceCheckUtils]: 3: Hoare triple {1106#true} call #t~ret3 := main(); {1106#true} is VALID [2018-11-23 13:13:12,123 INFO L273 TraceCheckUtils]: 4: Hoare triple {1106#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1106#true} is VALID [2018-11-23 13:13:12,124 INFO L273 TraceCheckUtils]: 5: Hoare triple {1106#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {1126#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-23 13:13:12,124 INFO L273 TraceCheckUtils]: 6: Hoare triple {1126#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1130#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-23 13:13:12,126 INFO L273 TraceCheckUtils]: 7: Hoare triple {1130#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1134#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} is VALID [2018-11-23 13:13:12,126 INFO L273 TraceCheckUtils]: 8: Hoare triple {1134#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1138#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-23 13:13:12,128 INFO L273 TraceCheckUtils]: 9: Hoare triple {1138#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1142#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-23 13:13:12,129 INFO L273 TraceCheckUtils]: 10: Hoare triple {1142#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1146#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-23 13:13:12,130 INFO L273 TraceCheckUtils]: 11: Hoare triple {1146#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1150#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-23 13:13:12,131 INFO L273 TraceCheckUtils]: 12: Hoare triple {1150#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1154#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-23 13:13:12,132 INFO L273 TraceCheckUtils]: 13: Hoare triple {1154#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1158#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-23 13:13:12,146 INFO L273 TraceCheckUtils]: 14: Hoare triple {1158#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1162#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-23 13:13:12,149 INFO L273 TraceCheckUtils]: 15: Hoare triple {1162#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1166#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-23 13:13:12,151 INFO L273 TraceCheckUtils]: 16: Hoare triple {1166#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1170#(and (<= main_~i~0 main_~n~0) (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-23 13:13:12,153 INFO L273 TraceCheckUtils]: 17: Hoare triple {1170#(and (<= main_~i~0 main_~n~0) (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1174#(and (<= 6 main_~n~0) (= main_~sum~0 21) (<= main_~i~0 7))} is VALID [2018-11-23 13:13:12,159 INFO L273 TraceCheckUtils]: 18: Hoare triple {1174#(and (<= 6 main_~n~0) (= main_~sum~0 21) (<= main_~i~0 7))} assume !(~i~0 <= ~n~0); {1178#(and (<= main_~n~0 6) (<= 6 main_~n~0) (= main_~sum~0 21))} is VALID [2018-11-23 13:13:12,161 INFO L256 TraceCheckUtils]: 19: Hoare triple {1178#(and (<= main_~n~0 6) (<= 6 main_~n~0) (= main_~sum~0 21))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {1182#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:13:12,163 INFO L273 TraceCheckUtils]: 20: Hoare triple {1182#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1186#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:13:12,165 INFO L273 TraceCheckUtils]: 21: Hoare triple {1186#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1107#false} is VALID [2018-11-23 13:13:12,166 INFO L273 TraceCheckUtils]: 22: Hoare triple {1107#false} assume !false; {1107#false} is VALID [2018-11-23 13:13:12,167 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:12,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:13:12,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-11-23 13:13:12,187 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2018-11-23 13:13:12,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:12,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 13:13:12,219 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:12,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 13:13:12,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 13:13:12,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:13:12,220 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 18 states. [2018-11-23 13:13:13,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:13,025 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-23 13:13:13,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 13:13:13,026 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2018-11-23 13:13:13,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:13,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:13:13,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 31 transitions. [2018-11-23 13:13:13,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:13:13,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 31 transitions. [2018-11-23 13:13:13,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 31 transitions. [2018-11-23 13:13:13,057 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:13,058 INFO L225 Difference]: With dead ends: 31 [2018-11-23 13:13:13,058 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 13:13:13,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:13:13,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 13:13:13,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 13:13:13,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:13,087 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 13:13:13,088 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 13:13:13,088 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 13:13:13,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:13,090 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 13:13:13,090 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 13:13:13,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:13,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:13,091 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 13:13:13,091 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 13:13:13,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:13,092 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 13:13:13,093 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 13:13:13,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:13,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:13,093 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:13,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:13,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:13:13,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-11-23 13:13:13,095 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2018-11-23 13:13:13,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:13,095 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-11-23 13:13:13,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 13:13:13,095 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 13:13:13,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 13:13:13,096 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:13,096 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:13,096 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:13,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:13,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1167859535, now seen corresponding path program 7 times [2018-11-23 13:13:13,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:13,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:13,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:13,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:13,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:13,112 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:13:13,112 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:13:13,112 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:13,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:13:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:13,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:13,686 INFO L256 TraceCheckUtils]: 0: Hoare triple {1335#true} call ULTIMATE.init(); {1335#true} is VALID [2018-11-23 13:13:13,686 INFO L273 TraceCheckUtils]: 1: Hoare triple {1335#true} assume true; {1335#true} is VALID [2018-11-23 13:13:13,686 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1335#true} {1335#true} #37#return; {1335#true} is VALID [2018-11-23 13:13:13,687 INFO L256 TraceCheckUtils]: 3: Hoare triple {1335#true} call #t~ret3 := main(); {1335#true} is VALID [2018-11-23 13:13:13,687 INFO L273 TraceCheckUtils]: 4: Hoare triple {1335#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1335#true} is VALID [2018-11-23 13:13:13,688 INFO L273 TraceCheckUtils]: 5: Hoare triple {1335#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {1355#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-23 13:13:13,688 INFO L273 TraceCheckUtils]: 6: Hoare triple {1355#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1359#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-23 13:13:13,689 INFO L273 TraceCheckUtils]: 7: Hoare triple {1359#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1363#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2018-11-23 13:13:13,689 INFO L273 TraceCheckUtils]: 8: Hoare triple {1363#(and (= main_~i~0 2) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1367#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-23 13:13:13,690 INFO L273 TraceCheckUtils]: 9: Hoare triple {1367#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1371#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-23 13:13:13,690 INFO L273 TraceCheckUtils]: 10: Hoare triple {1371#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1375#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-23 13:13:13,691 INFO L273 TraceCheckUtils]: 11: Hoare triple {1375#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1379#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-23 13:13:13,692 INFO L273 TraceCheckUtils]: 12: Hoare triple {1379#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1383#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-23 13:13:13,693 INFO L273 TraceCheckUtils]: 13: Hoare triple {1383#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1387#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-23 13:13:13,694 INFO L273 TraceCheckUtils]: 14: Hoare triple {1387#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1391#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-23 13:13:13,695 INFO L273 TraceCheckUtils]: 15: Hoare triple {1391#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1395#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-23 13:13:13,696 INFO L273 TraceCheckUtils]: 16: Hoare triple {1395#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1399#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-23 13:13:13,696 INFO L273 TraceCheckUtils]: 17: Hoare triple {1399#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1403#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-23 13:13:13,697 INFO L273 TraceCheckUtils]: 18: Hoare triple {1403#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1407#(and (= (+ main_~i~0 21) main_~sum~0) (<= main_~i~0 main_~n~0) (= main_~i~0 7))} is VALID [2018-11-23 13:13:13,698 INFO L273 TraceCheckUtils]: 19: Hoare triple {1407#(and (= (+ main_~i~0 21) main_~sum~0) (<= main_~i~0 main_~n~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1411#(and (= main_~sum~0 28) (<= main_~i~0 8) (<= 7 main_~n~0))} is VALID [2018-11-23 13:13:13,699 INFO L273 TraceCheckUtils]: 20: Hoare triple {1411#(and (= main_~sum~0 28) (<= main_~i~0 8) (<= 7 main_~n~0))} assume !(~i~0 <= ~n~0); {1415#(and (= main_~sum~0 28) (<= main_~n~0 7) (<= 7 main_~n~0))} is VALID [2018-11-23 13:13:13,703 INFO L256 TraceCheckUtils]: 21: Hoare triple {1415#(and (= main_~sum~0 28) (<= main_~n~0 7) (<= 7 main_~n~0))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {1419#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:13:13,704 INFO L273 TraceCheckUtils]: 22: Hoare triple {1419#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1423#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:13:13,704 INFO L273 TraceCheckUtils]: 23: Hoare triple {1423#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1336#false} is VALID [2018-11-23 13:13:13,705 INFO L273 TraceCheckUtils]: 24: Hoare triple {1336#false} assume !false; {1336#false} is VALID [2018-11-23 13:13:13,706 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:13,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:13:13,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-11-23 13:13:13,728 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 25 [2018-11-23 13:13:13,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:13,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 13:13:13,751 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:13,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 13:13:13,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 13:13:13,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:13:13,752 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 20 states. [2018-11-23 13:13:14,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:14,821 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-23 13:13:14,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 13:13:14,821 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 25 [2018-11-23 13:13:14,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:14,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:13:14,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 33 transitions. [2018-11-23 13:13:14,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:13:14,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 33 transitions. [2018-11-23 13:13:14,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 33 transitions. [2018-11-23 13:13:14,864 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:13:14,865 INFO L225 Difference]: With dead ends: 33 [2018-11-23 13:13:14,865 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 13:13:14,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:13:14,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 13:13:14,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 13:13:14,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:14,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 13:13:14,888 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 13:13:14,888 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 13:13:14,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:14,890 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-23 13:13:14,891 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-23 13:13:14,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:14,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:14,891 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 13:13:14,891 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 13:13:14,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:14,892 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-23 13:13:14,892 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-23 13:13:14,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:14,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:14,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:14,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:14,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:13:14,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-11-23 13:13:14,894 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2018-11-23 13:13:14,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:14,895 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-11-23 13:13:14,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 13:13:14,895 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-23 13:13:14,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 13:13:14,896 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:14,896 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:14,896 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:14,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:14,896 INFO L82 PathProgramCache]: Analyzing trace with hash -191187985, now seen corresponding path program 8 times [2018-11-23 13:13:14,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:14,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:14,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:14,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:13:14,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:14,908 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:13:14,908 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:13:14,908 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:14,920 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:13:14,934 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:13:14,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:14,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:14,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:15,499 INFO L256 TraceCheckUtils]: 0: Hoare triple {1582#true} call ULTIMATE.init(); {1582#true} is VALID [2018-11-23 13:13:15,499 INFO L273 TraceCheckUtils]: 1: Hoare triple {1582#true} assume true; {1582#true} is VALID [2018-11-23 13:13:15,499 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1582#true} {1582#true} #37#return; {1582#true} is VALID [2018-11-23 13:13:15,500 INFO L256 TraceCheckUtils]: 3: Hoare triple {1582#true} call #t~ret3 := main(); {1582#true} is VALID [2018-11-23 13:13:15,500 INFO L273 TraceCheckUtils]: 4: Hoare triple {1582#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1582#true} is VALID [2018-11-23 13:13:15,520 INFO L273 TraceCheckUtils]: 5: Hoare triple {1582#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {1602#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-23 13:13:15,529 INFO L273 TraceCheckUtils]: 6: Hoare triple {1602#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1606#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-23 13:13:15,544 INFO L273 TraceCheckUtils]: 7: Hoare triple {1606#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1610#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2018-11-23 13:13:15,550 INFO L273 TraceCheckUtils]: 8: Hoare triple {1610#(and (= main_~i~0 2) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1614#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-23 13:13:15,550 INFO L273 TraceCheckUtils]: 9: Hoare triple {1614#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1618#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-23 13:13:15,551 INFO L273 TraceCheckUtils]: 10: Hoare triple {1618#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1622#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-23 13:13:15,552 INFO L273 TraceCheckUtils]: 11: Hoare triple {1622#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1626#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-23 13:13:15,552 INFO L273 TraceCheckUtils]: 12: Hoare triple {1626#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1630#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-23 13:13:15,553 INFO L273 TraceCheckUtils]: 13: Hoare triple {1630#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1634#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-23 13:13:15,553 INFO L273 TraceCheckUtils]: 14: Hoare triple {1634#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1638#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-23 13:13:15,554 INFO L273 TraceCheckUtils]: 15: Hoare triple {1638#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1642#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-23 13:13:15,555 INFO L273 TraceCheckUtils]: 16: Hoare triple {1642#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1646#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-23 13:13:15,555 INFO L273 TraceCheckUtils]: 17: Hoare triple {1646#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1650#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-23 13:13:15,556 INFO L273 TraceCheckUtils]: 18: Hoare triple {1650#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1654#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} is VALID [2018-11-23 13:13:15,557 INFO L273 TraceCheckUtils]: 19: Hoare triple {1654#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1658#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-23 13:13:15,558 INFO L273 TraceCheckUtils]: 20: Hoare triple {1658#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1662#(and (<= main_~i~0 main_~n~0) (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} is VALID [2018-11-23 13:13:15,559 INFO L273 TraceCheckUtils]: 21: Hoare triple {1662#(and (<= main_~i~0 main_~n~0) (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1666#(and (<= 8 main_~n~0) (<= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-23 13:13:15,560 INFO L273 TraceCheckUtils]: 22: Hoare triple {1666#(and (<= 8 main_~n~0) (<= main_~i~0 9) (= main_~sum~0 36))} assume !(~i~0 <= ~n~0); {1670#(and (<= 8 main_~n~0) (= main_~sum~0 36) (<= main_~n~0 8))} is VALID [2018-11-23 13:13:15,561 INFO L256 TraceCheckUtils]: 23: Hoare triple {1670#(and (<= 8 main_~n~0) (= main_~sum~0 36) (<= main_~n~0 8))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {1674#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:13:15,562 INFO L273 TraceCheckUtils]: 24: Hoare triple {1674#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1678#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:13:15,562 INFO L273 TraceCheckUtils]: 25: Hoare triple {1678#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1583#false} is VALID [2018-11-23 13:13:15,563 INFO L273 TraceCheckUtils]: 26: Hoare triple {1583#false} assume !false; {1583#false} is VALID [2018-11-23 13:13:15,565 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:15,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:13:15,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-11-23 13:13:15,585 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 27 [2018-11-23 13:13:15,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:15,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 13:13:15,612 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:15,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 13:13:15,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 13:13:15,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:13:15,614 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 22 states. [2018-11-23 13:13:16,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:16,672 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-23 13:13:16,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 13:13:16,672 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 27 [2018-11-23 13:13:16,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:16,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:13:16,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 35 transitions. [2018-11-23 13:13:16,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:13:16,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 35 transitions. [2018-11-23 13:13:16,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 35 transitions. [2018-11-23 13:13:16,796 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:13:16,797 INFO L225 Difference]: With dead ends: 35 [2018-11-23 13:13:16,797 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 13:13:16,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=502, Unknown=0, NotChecked=0, Total=552 [2018-11-23 13:13:16,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 13:13:16,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-23 13:13:16,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:16,829 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2018-11-23 13:13:16,829 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 13:13:16,830 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 13:13:16,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:16,831 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-23 13:13:16,831 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-23 13:13:16,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:16,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:16,833 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 13:13:16,833 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 13:13:16,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:16,834 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-23 13:13:16,834 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-23 13:13:16,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:16,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:16,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:16,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:16,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:13:16,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-23 13:13:16,836 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2018-11-23 13:13:16,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:16,837 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-23 13:13:16,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 13:13:16,837 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-23 13:13:16,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 13:13:16,838 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:16,838 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:16,838 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:16,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:16,839 INFO L82 PathProgramCache]: Analyzing trace with hash 2087301037, now seen corresponding path program 9 times [2018-11-23 13:13:16,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:16,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:16,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:16,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:16,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:16,851 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:13:16,851 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:13:16,851 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:16,876 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:13:16,905 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 13:13:16,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:16,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:17,840 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-23 13:13:18,252 INFO L256 TraceCheckUtils]: 0: Hoare triple {1847#true} call ULTIMATE.init(); {1847#true} is VALID [2018-11-23 13:13:18,253 INFO L273 TraceCheckUtils]: 1: Hoare triple {1847#true} assume true; {1847#true} is VALID [2018-11-23 13:13:18,253 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1847#true} {1847#true} #37#return; {1847#true} is VALID [2018-11-23 13:13:18,254 INFO L256 TraceCheckUtils]: 3: Hoare triple {1847#true} call #t~ret3 := main(); {1847#true} is VALID [2018-11-23 13:13:18,254 INFO L273 TraceCheckUtils]: 4: Hoare triple {1847#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1847#true} is VALID [2018-11-23 13:13:18,255 INFO L273 TraceCheckUtils]: 5: Hoare triple {1847#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {1867#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-23 13:13:18,256 INFO L273 TraceCheckUtils]: 6: Hoare triple {1867#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1871#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-23 13:13:18,257 INFO L273 TraceCheckUtils]: 7: Hoare triple {1871#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1875#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} is VALID [2018-11-23 13:13:18,257 INFO L273 TraceCheckUtils]: 8: Hoare triple {1875#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1879#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-23 13:13:18,258 INFO L273 TraceCheckUtils]: 9: Hoare triple {1879#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1883#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-23 13:13:18,267 INFO L273 TraceCheckUtils]: 10: Hoare triple {1883#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1887#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-23 13:13:18,268 INFO L273 TraceCheckUtils]: 11: Hoare triple {1887#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1891#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-23 13:13:18,269 INFO L273 TraceCheckUtils]: 12: Hoare triple {1891#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1895#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-23 13:13:18,269 INFO L273 TraceCheckUtils]: 13: Hoare triple {1895#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1899#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-23 13:13:18,270 INFO L273 TraceCheckUtils]: 14: Hoare triple {1899#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1903#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-23 13:13:18,270 INFO L273 TraceCheckUtils]: 15: Hoare triple {1903#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1907#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-23 13:13:18,271 INFO L273 TraceCheckUtils]: 16: Hoare triple {1907#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1911#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-23 13:13:18,272 INFO L273 TraceCheckUtils]: 17: Hoare triple {1911#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1915#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-23 13:13:18,273 INFO L273 TraceCheckUtils]: 18: Hoare triple {1915#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1919#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} is VALID [2018-11-23 13:13:18,273 INFO L273 TraceCheckUtils]: 19: Hoare triple {1919#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1923#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-23 13:13:18,274 INFO L273 TraceCheckUtils]: 20: Hoare triple {1923#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1927#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} is VALID [2018-11-23 13:13:18,282 INFO L273 TraceCheckUtils]: 21: Hoare triple {1927#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1931#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-23 13:13:18,283 INFO L273 TraceCheckUtils]: 22: Hoare triple {1931#(and (= main_~i~0 9) (= main_~sum~0 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1935#(and (= main_~i~0 9) (<= main_~i~0 main_~n~0) (= (+ main_~i~0 36) main_~sum~0))} is VALID [2018-11-23 13:13:18,285 INFO L273 TraceCheckUtils]: 23: Hoare triple {1935#(and (= main_~i~0 9) (<= main_~i~0 main_~n~0) (= (+ main_~i~0 36) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1939#(and (<= main_~i~0 10) (= main_~sum~0 45) (<= 9 main_~n~0))} is VALID [2018-11-23 13:13:18,285 INFO L273 TraceCheckUtils]: 24: Hoare triple {1939#(and (<= main_~i~0 10) (= main_~sum~0 45) (<= 9 main_~n~0))} assume !(~i~0 <= ~n~0); {1943#(and (= main_~sum~0 45) (<= main_~n~0 9) (<= 9 main_~n~0))} is VALID [2018-11-23 13:13:18,286 INFO L256 TraceCheckUtils]: 25: Hoare triple {1943#(and (= main_~sum~0 45) (<= main_~n~0 9) (<= 9 main_~n~0))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {1947#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:13:18,286 INFO L273 TraceCheckUtils]: 26: Hoare triple {1947#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1951#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:13:18,287 INFO L273 TraceCheckUtils]: 27: Hoare triple {1951#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1848#false} is VALID [2018-11-23 13:13:18,287 INFO L273 TraceCheckUtils]: 28: Hoare triple {1848#false} assume !false; {1848#false} is VALID [2018-11-23 13:13:18,289 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:18,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:13:18,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-11-23 13:13:18,311 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 29 [2018-11-23 13:13:18,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:18,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 13:13:18,337 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:18,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 13:13:18,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 13:13:18,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-11-23 13:13:18,338 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 24 states. [2018-11-23 13:13:19,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:19,539 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-11-23 13:13:19,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 13:13:19,540 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 29 [2018-11-23 13:13:19,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:19,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:13:19,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2018-11-23 13:13:19,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:13:19,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2018-11-23 13:13:19,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 37 transitions. [2018-11-23 13:13:19,638 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:13:19,639 INFO L225 Difference]: With dead ends: 37 [2018-11-23 13:13:19,639 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 13:13:19,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=54, Invalid=596, Unknown=0, NotChecked=0, Total=650 [2018-11-23 13:13:19,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 13:13:19,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-23 13:13:19,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:19,679 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2018-11-23 13:13:19,679 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 13:13:19,679 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 13:13:19,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:19,680 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-23 13:13:19,680 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-23 13:13:19,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:19,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:19,681 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 13:13:19,681 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 13:13:19,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:19,682 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-23 13:13:19,682 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-23 13:13:19,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:19,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:19,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:19,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:19,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:13:19,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-11-23 13:13:19,684 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2018-11-23 13:13:19,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:19,684 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-11-23 13:13:19,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 13:13:19,684 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-23 13:13:19,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 13:13:19,685 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:19,685 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:19,685 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:19,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:19,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1281930219, now seen corresponding path program 10 times [2018-11-23 13:13:19,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:19,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:19,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:19,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:19,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:19,697 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:13:19,697 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:13:19,697 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:19,713 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:13:19,726 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:13:19,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:19,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:20,364 INFO L256 TraceCheckUtils]: 0: Hoare triple {2130#true} call ULTIMATE.init(); {2130#true} is VALID [2018-11-23 13:13:20,364 INFO L273 TraceCheckUtils]: 1: Hoare triple {2130#true} assume true; {2130#true} is VALID [2018-11-23 13:13:20,364 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2130#true} {2130#true} #37#return; {2130#true} is VALID [2018-11-23 13:13:20,365 INFO L256 TraceCheckUtils]: 3: Hoare triple {2130#true} call #t~ret3 := main(); {2130#true} is VALID [2018-11-23 13:13:20,365 INFO L273 TraceCheckUtils]: 4: Hoare triple {2130#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2130#true} is VALID [2018-11-23 13:13:20,366 INFO L273 TraceCheckUtils]: 5: Hoare triple {2130#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {2150#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-23 13:13:20,367 INFO L273 TraceCheckUtils]: 6: Hoare triple {2150#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2154#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-23 13:13:20,367 INFO L273 TraceCheckUtils]: 7: Hoare triple {2154#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2158#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2018-11-23 13:13:20,368 INFO L273 TraceCheckUtils]: 8: Hoare triple {2158#(and (= main_~i~0 2) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2162#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-23 13:13:20,368 INFO L273 TraceCheckUtils]: 9: Hoare triple {2162#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2166#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-23 13:13:20,369 INFO L273 TraceCheckUtils]: 10: Hoare triple {2166#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2170#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-23 13:13:20,369 INFO L273 TraceCheckUtils]: 11: Hoare triple {2170#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2174#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-23 13:13:20,370 INFO L273 TraceCheckUtils]: 12: Hoare triple {2174#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2178#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-23 13:13:20,371 INFO L273 TraceCheckUtils]: 13: Hoare triple {2178#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2182#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-23 13:13:20,372 INFO L273 TraceCheckUtils]: 14: Hoare triple {2182#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2186#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-23 13:13:20,373 INFO L273 TraceCheckUtils]: 15: Hoare triple {2186#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2190#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-23 13:13:20,374 INFO L273 TraceCheckUtils]: 16: Hoare triple {2190#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2194#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-23 13:13:20,374 INFO L273 TraceCheckUtils]: 17: Hoare triple {2194#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2198#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-23 13:13:20,375 INFO L273 TraceCheckUtils]: 18: Hoare triple {2198#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2202#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} is VALID [2018-11-23 13:13:20,376 INFO L273 TraceCheckUtils]: 19: Hoare triple {2202#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2206#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-23 13:13:20,377 INFO L273 TraceCheckUtils]: 20: Hoare triple {2206#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2210#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} is VALID [2018-11-23 13:13:20,378 INFO L273 TraceCheckUtils]: 21: Hoare triple {2210#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2214#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-23 13:13:20,379 INFO L273 TraceCheckUtils]: 22: Hoare triple {2214#(and (= main_~i~0 9) (= main_~sum~0 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2218#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} is VALID [2018-11-23 13:13:20,380 INFO L273 TraceCheckUtils]: 23: Hoare triple {2218#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2222#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-23 13:13:20,381 INFO L273 TraceCheckUtils]: 24: Hoare triple {2222#(and (= main_~sum~0 45) (= main_~i~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2226#(and (= main_~sum~0 (+ main_~i~0 45)) (<= main_~i~0 main_~n~0) (= main_~i~0 10))} is VALID [2018-11-23 13:13:20,382 INFO L273 TraceCheckUtils]: 25: Hoare triple {2226#(and (= main_~sum~0 (+ main_~i~0 45)) (<= main_~i~0 main_~n~0) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2230#(and (<= main_~i~0 11) (= main_~sum~0 55) (<= 10 main_~n~0))} is VALID [2018-11-23 13:13:20,382 INFO L273 TraceCheckUtils]: 26: Hoare triple {2230#(and (<= main_~i~0 11) (= main_~sum~0 55) (<= 10 main_~n~0))} assume !(~i~0 <= ~n~0); {2234#(and (= main_~sum~0 55) (<= main_~n~0 10) (<= 10 main_~n~0))} is VALID [2018-11-23 13:13:20,384 INFO L256 TraceCheckUtils]: 27: Hoare triple {2234#(and (= main_~sum~0 55) (<= main_~n~0 10) (<= 10 main_~n~0))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {2238#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:13:20,384 INFO L273 TraceCheckUtils]: 28: Hoare triple {2238#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2242#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:13:20,385 INFO L273 TraceCheckUtils]: 29: Hoare triple {2242#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2131#false} is VALID [2018-11-23 13:13:20,385 INFO L273 TraceCheckUtils]: 30: Hoare triple {2131#false} assume !false; {2131#false} is VALID [2018-11-23 13:13:20,389 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:20,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:13:20,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-11-23 13:13:20,414 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 31 [2018-11-23 13:13:20,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:20,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 13:13:20,446 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:20,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 13:13:20,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 13:13:20,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2018-11-23 13:13:20,448 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 26 states. [2018-11-23 13:13:21,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:21,822 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-23 13:13:21,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 13:13:21,822 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 31 [2018-11-23 13:13:21,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:21,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:13:21,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 39 transitions. [2018-11-23 13:13:21,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:13:21,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 39 transitions. [2018-11-23 13:13:21,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 39 transitions. [2018-11-23 13:13:21,865 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:13:21,867 INFO L225 Difference]: With dead ends: 39 [2018-11-23 13:13:21,867 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 13:13:21,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=698, Unknown=0, NotChecked=0, Total=756 [2018-11-23 13:13:21,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 13:13:21,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-23 13:13:21,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:21,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2018-11-23 13:13:21,904 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 13:13:21,904 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 13:13:21,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:21,906 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-23 13:13:21,906 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-23 13:13:21,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:21,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:21,906 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 13:13:21,906 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 13:13:21,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:21,907 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-23 13:13:21,907 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-23 13:13:21,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:21,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:21,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:21,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:21,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 13:13:21,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-11-23 13:13:21,908 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2018-11-23 13:13:21,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:21,909 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-11-23 13:13:21,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 13:13:21,909 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-23 13:13:21,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 13:13:21,909 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:21,910 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:21,910 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:21,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:21,910 INFO L82 PathProgramCache]: Analyzing trace with hash 414687401, now seen corresponding path program 11 times [2018-11-23 13:13:21,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:21,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:21,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:21,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:21,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:21,922 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:13:21,922 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:13:21,922 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:21,936 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:13:21,955 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 13:13:21,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:21,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:23,042 INFO L256 TraceCheckUtils]: 0: Hoare triple {2431#true} call ULTIMATE.init(); {2431#true} is VALID [2018-11-23 13:13:23,042 INFO L273 TraceCheckUtils]: 1: Hoare triple {2431#true} assume true; {2431#true} is VALID [2018-11-23 13:13:23,042 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2431#true} {2431#true} #37#return; {2431#true} is VALID [2018-11-23 13:13:23,043 INFO L256 TraceCheckUtils]: 3: Hoare triple {2431#true} call #t~ret3 := main(); {2431#true} is VALID [2018-11-23 13:13:23,043 INFO L273 TraceCheckUtils]: 4: Hoare triple {2431#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2431#true} is VALID [2018-11-23 13:13:23,045 INFO L273 TraceCheckUtils]: 5: Hoare triple {2431#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {2451#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-23 13:13:23,045 INFO L273 TraceCheckUtils]: 6: Hoare triple {2451#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2455#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-23 13:13:23,048 INFO L273 TraceCheckUtils]: 7: Hoare triple {2455#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2459#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} is VALID [2018-11-23 13:13:23,048 INFO L273 TraceCheckUtils]: 8: Hoare triple {2459#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2463#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-23 13:13:23,051 INFO L273 TraceCheckUtils]: 9: Hoare triple {2463#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2467#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-23 13:13:23,051 INFO L273 TraceCheckUtils]: 10: Hoare triple {2467#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2471#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-23 13:13:23,052 INFO L273 TraceCheckUtils]: 11: Hoare triple {2471#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2475#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-23 13:13:23,055 INFO L273 TraceCheckUtils]: 12: Hoare triple {2475#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2479#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-23 13:13:23,058 INFO L273 TraceCheckUtils]: 13: Hoare triple {2479#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2483#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-23 13:13:23,063 INFO L273 TraceCheckUtils]: 14: Hoare triple {2483#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2487#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-23 13:13:23,066 INFO L273 TraceCheckUtils]: 15: Hoare triple {2487#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2491#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-23 13:13:23,066 INFO L273 TraceCheckUtils]: 16: Hoare triple {2491#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2495#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-23 13:13:23,067 INFO L273 TraceCheckUtils]: 17: Hoare triple {2495#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2499#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-23 13:13:23,067 INFO L273 TraceCheckUtils]: 18: Hoare triple {2499#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2503#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} is VALID [2018-11-23 13:13:23,068 INFO L273 TraceCheckUtils]: 19: Hoare triple {2503#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2507#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-23 13:13:23,068 INFO L273 TraceCheckUtils]: 20: Hoare triple {2507#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2511#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} is VALID [2018-11-23 13:13:23,069 INFO L273 TraceCheckUtils]: 21: Hoare triple {2511#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2515#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-23 13:13:23,069 INFO L273 TraceCheckUtils]: 22: Hoare triple {2515#(and (= main_~i~0 9) (= main_~sum~0 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2519#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} is VALID [2018-11-23 13:13:23,070 INFO L273 TraceCheckUtils]: 23: Hoare triple {2519#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2523#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-23 13:13:23,071 INFO L273 TraceCheckUtils]: 24: Hoare triple {2523#(and (= main_~sum~0 45) (= main_~i~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2527#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} is VALID [2018-11-23 13:13:23,072 INFO L273 TraceCheckUtils]: 25: Hoare triple {2527#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2531#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-23 13:13:23,073 INFO L273 TraceCheckUtils]: 26: Hoare triple {2531#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2535#(and (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} is VALID [2018-11-23 13:13:23,074 INFO L273 TraceCheckUtils]: 27: Hoare triple {2535#(and (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2539#(and (<= 11 main_~n~0) (<= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-23 13:13:23,074 INFO L273 TraceCheckUtils]: 28: Hoare triple {2539#(and (<= 11 main_~n~0) (<= main_~i~0 12) (= main_~sum~0 66))} assume !(~i~0 <= ~n~0); {2543#(and (<= 11 main_~n~0) (<= main_~n~0 11) (= main_~sum~0 66))} is VALID [2018-11-23 13:13:23,076 INFO L256 TraceCheckUtils]: 29: Hoare triple {2543#(and (<= 11 main_~n~0) (<= main_~n~0 11) (= main_~sum~0 66))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {2547#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:13:23,077 INFO L273 TraceCheckUtils]: 30: Hoare triple {2547#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2551#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:13:23,077 INFO L273 TraceCheckUtils]: 31: Hoare triple {2551#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2432#false} is VALID [2018-11-23 13:13:23,077 INFO L273 TraceCheckUtils]: 32: Hoare triple {2432#false} assume !false; {2432#false} is VALID [2018-11-23 13:13:23,081 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:23,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:13:23,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-11-23 13:13:23,108 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 33 [2018-11-23 13:13:23,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:23,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 13:13:23,147 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:13:23,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 13:13:23,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 13:13:23,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-11-23 13:13:23,149 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 28 states. [2018-11-23 13:13:24,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:24,907 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-11-23 13:13:24,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 13:13:24,908 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 33 [2018-11-23 13:13:24,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:24,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:13:24,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 41 transitions. [2018-11-23 13:13:24,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:13:24,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 41 transitions. [2018-11-23 13:13:24,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 41 transitions. [2018-11-23 13:13:24,962 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:13:24,964 INFO L225 Difference]: With dead ends: 41 [2018-11-23 13:13:24,964 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 13:13:24,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=62, Invalid=808, Unknown=0, NotChecked=0, Total=870 [2018-11-23 13:13:24,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 13:13:25,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 13:13:25,037 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:25,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2018-11-23 13:13:25,037 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-23 13:13:25,037 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-23 13:13:25,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:25,038 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-23 13:13:25,038 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-23 13:13:25,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:25,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:25,039 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-23 13:13:25,039 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-23 13:13:25,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:25,040 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-23 13:13:25,040 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-23 13:13:25,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:25,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:25,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:25,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:25,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 13:13:25,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-11-23 13:13:25,041 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2018-11-23 13:13:25,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:25,042 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-11-23 13:13:25,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 13:13:25,042 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-23 13:13:25,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 13:13:25,042 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:25,042 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:25,042 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:25,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:25,043 INFO L82 PathProgramCache]: Analyzing trace with hash 217994727, now seen corresponding path program 12 times [2018-11-23 13:13:25,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:25,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:25,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:25,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:25,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:25,054 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:13:25,054 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:13:25,054 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:25,065 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:13:25,098 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 13:13:25,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:25,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:27,820 INFO L256 TraceCheckUtils]: 0: Hoare triple {2750#true} call ULTIMATE.init(); {2750#true} is VALID [2018-11-23 13:13:27,820 INFO L273 TraceCheckUtils]: 1: Hoare triple {2750#true} assume true; {2750#true} is VALID [2018-11-23 13:13:27,820 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2750#true} {2750#true} #37#return; {2750#true} is VALID [2018-11-23 13:13:27,821 INFO L256 TraceCheckUtils]: 3: Hoare triple {2750#true} call #t~ret3 := main(); {2750#true} is VALID [2018-11-23 13:13:27,821 INFO L273 TraceCheckUtils]: 4: Hoare triple {2750#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2750#true} is VALID [2018-11-23 13:13:27,821 INFO L273 TraceCheckUtils]: 5: Hoare triple {2750#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {2770#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-23 13:13:27,822 INFO L273 TraceCheckUtils]: 6: Hoare triple {2770#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2774#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-23 13:13:27,822 INFO L273 TraceCheckUtils]: 7: Hoare triple {2774#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2778#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} is VALID [2018-11-23 13:13:27,823 INFO L273 TraceCheckUtils]: 8: Hoare triple {2778#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2782#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-23 13:13:27,823 INFO L273 TraceCheckUtils]: 9: Hoare triple {2782#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2786#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-23 13:13:27,824 INFO L273 TraceCheckUtils]: 10: Hoare triple {2786#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2790#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-23 13:13:27,825 INFO L273 TraceCheckUtils]: 11: Hoare triple {2790#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2794#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-23 13:13:27,825 INFO L273 TraceCheckUtils]: 12: Hoare triple {2794#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2798#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-23 13:13:27,826 INFO L273 TraceCheckUtils]: 13: Hoare triple {2798#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2802#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-23 13:13:27,827 INFO L273 TraceCheckUtils]: 14: Hoare triple {2802#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2806#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-23 13:13:27,828 INFO L273 TraceCheckUtils]: 15: Hoare triple {2806#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2810#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-23 13:13:27,829 INFO L273 TraceCheckUtils]: 16: Hoare triple {2810#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2814#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-23 13:13:27,830 INFO L273 TraceCheckUtils]: 17: Hoare triple {2814#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2818#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-23 13:13:27,830 INFO L273 TraceCheckUtils]: 18: Hoare triple {2818#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2822#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} is VALID [2018-11-23 13:13:27,831 INFO L273 TraceCheckUtils]: 19: Hoare triple {2822#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2826#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-23 13:13:27,832 INFO L273 TraceCheckUtils]: 20: Hoare triple {2826#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2830#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} is VALID [2018-11-23 13:13:27,833 INFO L273 TraceCheckUtils]: 21: Hoare triple {2830#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2834#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-23 13:13:27,834 INFO L273 TraceCheckUtils]: 22: Hoare triple {2834#(and (= main_~i~0 9) (= main_~sum~0 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2838#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} is VALID [2018-11-23 13:13:27,834 INFO L273 TraceCheckUtils]: 23: Hoare triple {2838#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2842#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-23 13:13:27,835 INFO L273 TraceCheckUtils]: 24: Hoare triple {2842#(and (= main_~sum~0 45) (= main_~i~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2846#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} is VALID [2018-11-23 13:13:27,836 INFO L273 TraceCheckUtils]: 25: Hoare triple {2846#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2850#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-23 13:13:27,837 INFO L273 TraceCheckUtils]: 26: Hoare triple {2850#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2854#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} is VALID [2018-11-23 13:13:27,838 INFO L273 TraceCheckUtils]: 27: Hoare triple {2854#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2858#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-23 13:13:27,839 INFO L273 TraceCheckUtils]: 28: Hoare triple {2858#(and (= main_~i~0 12) (= main_~sum~0 66))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2862#(and (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} is VALID [2018-11-23 13:13:27,840 INFO L273 TraceCheckUtils]: 29: Hoare triple {2862#(and (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2866#(and (<= main_~i~0 13) (<= 12 main_~n~0) (= main_~sum~0 78))} is VALID [2018-11-23 13:13:27,841 INFO L273 TraceCheckUtils]: 30: Hoare triple {2866#(and (<= main_~i~0 13) (<= 12 main_~n~0) (= main_~sum~0 78))} assume !(~i~0 <= ~n~0); {2870#(and (<= 12 main_~n~0) (<= main_~n~0 12) (= main_~sum~0 78))} is VALID [2018-11-23 13:13:27,842 INFO L256 TraceCheckUtils]: 31: Hoare triple {2870#(and (<= 12 main_~n~0) (<= main_~n~0 12) (= main_~sum~0 78))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {2874#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:13:27,843 INFO L273 TraceCheckUtils]: 32: Hoare triple {2874#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2878#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:13:27,843 INFO L273 TraceCheckUtils]: 33: Hoare triple {2878#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2751#false} is VALID [2018-11-23 13:13:27,844 INFO L273 TraceCheckUtils]: 34: Hoare triple {2751#false} assume !false; {2751#false} is VALID [2018-11-23 13:13:27,847 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:27,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:13:27,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-11-23 13:13:27,866 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 35 [2018-11-23 13:13:27,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:27,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 13:13:27,900 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:13:27,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 13:13:27,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 13:13:27,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2018-11-23 13:13:27,902 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 30 states. [2018-11-23 13:13:30,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:30,597 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-11-23 13:13:30,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 13:13:30,598 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 35 [2018-11-23 13:13:30,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:30,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:13:30,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-11-23 13:13:30,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:13:30,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-11-23 13:13:30,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 43 transitions. [2018-11-23 13:13:30,652 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:13:30,653 INFO L225 Difference]: With dead ends: 43 [2018-11-23 13:13:30,653 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 13:13:30,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=66, Invalid=926, Unknown=0, NotChecked=0, Total=992 [2018-11-23 13:13:30,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 13:13:30,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-23 13:13:30,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:30,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2018-11-23 13:13:30,687 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-23 13:13:30,687 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-23 13:13:30,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:30,689 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-23 13:13:30,689 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-23 13:13:30,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:30,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:30,689 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-23 13:13:30,689 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-23 13:13:30,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:30,690 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-23 13:13:30,690 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-23 13:13:30,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:30,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:30,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:30,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:30,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 13:13:30,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-11-23 13:13:30,691 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2018-11-23 13:13:30,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:30,692 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-11-23 13:13:30,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 13:13:30,692 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-23 13:13:30,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 13:13:30,692 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:30,692 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:30,692 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:30,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:30,693 INFO L82 PathProgramCache]: Analyzing trace with hash 174896037, now seen corresponding path program 13 times [2018-11-23 13:13:30,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:30,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:30,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:30,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:30,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:30,704 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:13:30,704 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:13:30,704 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:30,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:13:30,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:30,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:31,604 INFO L256 TraceCheckUtils]: 0: Hoare triple {3087#true} call ULTIMATE.init(); {3087#true} is VALID [2018-11-23 13:13:31,605 INFO L273 TraceCheckUtils]: 1: Hoare triple {3087#true} assume true; {3087#true} is VALID [2018-11-23 13:13:31,605 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3087#true} {3087#true} #37#return; {3087#true} is VALID [2018-11-23 13:13:31,605 INFO L256 TraceCheckUtils]: 3: Hoare triple {3087#true} call #t~ret3 := main(); {3087#true} is VALID [2018-11-23 13:13:31,605 INFO L273 TraceCheckUtils]: 4: Hoare triple {3087#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3087#true} is VALID [2018-11-23 13:13:31,607 INFO L273 TraceCheckUtils]: 5: Hoare triple {3087#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {3107#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-23 13:13:31,608 INFO L273 TraceCheckUtils]: 6: Hoare triple {3107#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3111#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-23 13:13:31,614 INFO L273 TraceCheckUtils]: 7: Hoare triple {3111#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3115#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} is VALID [2018-11-23 13:13:31,615 INFO L273 TraceCheckUtils]: 8: Hoare triple {3115#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3119#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-23 13:13:31,615 INFO L273 TraceCheckUtils]: 9: Hoare triple {3119#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3123#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-23 13:13:31,616 INFO L273 TraceCheckUtils]: 10: Hoare triple {3123#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3127#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-23 13:13:31,616 INFO L273 TraceCheckUtils]: 11: Hoare triple {3127#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3131#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-23 13:13:31,617 INFO L273 TraceCheckUtils]: 12: Hoare triple {3131#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3135#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-23 13:13:31,618 INFO L273 TraceCheckUtils]: 13: Hoare triple {3135#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3139#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-23 13:13:31,619 INFO L273 TraceCheckUtils]: 14: Hoare triple {3139#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3143#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-23 13:13:31,620 INFO L273 TraceCheckUtils]: 15: Hoare triple {3143#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3147#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-23 13:13:31,620 INFO L273 TraceCheckUtils]: 16: Hoare triple {3147#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3151#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-23 13:13:31,621 INFO L273 TraceCheckUtils]: 17: Hoare triple {3151#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3155#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-23 13:13:31,622 INFO L273 TraceCheckUtils]: 18: Hoare triple {3155#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3159#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} is VALID [2018-11-23 13:13:31,623 INFO L273 TraceCheckUtils]: 19: Hoare triple {3159#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3163#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-23 13:13:31,623 INFO L273 TraceCheckUtils]: 20: Hoare triple {3163#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3167#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} is VALID [2018-11-23 13:13:31,624 INFO L273 TraceCheckUtils]: 21: Hoare triple {3167#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3171#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-23 13:13:31,625 INFO L273 TraceCheckUtils]: 22: Hoare triple {3171#(and (= main_~i~0 9) (= main_~sum~0 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3175#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} is VALID [2018-11-23 13:13:31,626 INFO L273 TraceCheckUtils]: 23: Hoare triple {3175#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3179#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-23 13:13:31,627 INFO L273 TraceCheckUtils]: 24: Hoare triple {3179#(and (= main_~sum~0 45) (= main_~i~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3183#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} is VALID [2018-11-23 13:13:31,627 INFO L273 TraceCheckUtils]: 25: Hoare triple {3183#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3187#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-23 13:13:31,628 INFO L273 TraceCheckUtils]: 26: Hoare triple {3187#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3191#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} is VALID [2018-11-23 13:13:31,629 INFO L273 TraceCheckUtils]: 27: Hoare triple {3191#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3195#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-23 13:13:31,630 INFO L273 TraceCheckUtils]: 28: Hoare triple {3195#(and (= main_~i~0 12) (= main_~sum~0 66))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3199#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} is VALID [2018-11-23 13:13:31,631 INFO L273 TraceCheckUtils]: 29: Hoare triple {3199#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3203#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-23 13:13:31,631 INFO L273 TraceCheckUtils]: 30: Hoare triple {3203#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3207#(and (<= main_~i~0 main_~n~0) (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2018-11-23 13:13:31,632 INFO L273 TraceCheckUtils]: 31: Hoare triple {3207#(and (<= main_~i~0 main_~n~0) (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3211#(and (<= main_~i~0 14) (= main_~sum~0 91) (<= 13 main_~n~0))} is VALID [2018-11-23 13:13:31,633 INFO L273 TraceCheckUtils]: 32: Hoare triple {3211#(and (<= main_~i~0 14) (= main_~sum~0 91) (<= 13 main_~n~0))} assume !(~i~0 <= ~n~0); {3215#(and (<= main_~n~0 13) (= main_~sum~0 91) (<= 13 main_~n~0))} is VALID [2018-11-23 13:13:31,634 INFO L256 TraceCheckUtils]: 33: Hoare triple {3215#(and (<= main_~n~0 13) (= main_~sum~0 91) (<= 13 main_~n~0))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {3219#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:13:31,635 INFO L273 TraceCheckUtils]: 34: Hoare triple {3219#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {3223#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:13:31,635 INFO L273 TraceCheckUtils]: 35: Hoare triple {3223#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3088#false} is VALID [2018-11-23 13:13:31,636 INFO L273 TraceCheckUtils]: 36: Hoare triple {3088#false} assume !false; {3088#false} is VALID [2018-11-23 13:13:31,639 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:31,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:13:31,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-11-23 13:13:31,658 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 37 [2018-11-23 13:13:31,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:31,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 13:13:31,694 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:13:31,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 13:13:31,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 13:13:31,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-11-23 13:13:31,696 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 32 states. [2018-11-23 13:13:34,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:34,206 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-23 13:13:34,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 13:13:34,206 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 37 [2018-11-23 13:13:34,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:34,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:13:34,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 45 transitions. [2018-11-23 13:13:34,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:13:34,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 45 transitions. [2018-11-23 13:13:34,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 45 transitions. [2018-11-23 13:13:34,254 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:13:34,255 INFO L225 Difference]: With dead ends: 45 [2018-11-23 13:13:34,255 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 13:13:34,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=1052, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 13:13:34,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 13:13:34,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 13:13:34,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:34,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-23 13:13:34,293 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 13:13:34,293 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 13:13:34,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:34,295 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-11-23 13:13:34,295 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-11-23 13:13:34,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:34,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:34,295 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 13:13:34,295 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 13:13:34,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:34,296 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-11-23 13:13:34,297 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-11-23 13:13:34,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:34,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:34,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:34,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:34,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 13:13:34,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-11-23 13:13:34,298 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2018-11-23 13:13:34,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:34,299 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-11-23 13:13:34,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 13:13:34,299 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-11-23 13:13:34,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 13:13:34,299 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:34,300 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:34,300 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:34,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:34,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1706727907, now seen corresponding path program 14 times [2018-11-23 13:13:34,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:34,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:34,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:34,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:13:34,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:34,311 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:13:34,311 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:13:34,312 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:34,332 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:13:34,355 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:13:34,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:34,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:34,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:35,522 INFO L256 TraceCheckUtils]: 0: Hoare triple {3442#true} call ULTIMATE.init(); {3442#true} is VALID [2018-11-23 13:13:35,522 INFO L273 TraceCheckUtils]: 1: Hoare triple {3442#true} assume true; {3442#true} is VALID [2018-11-23 13:13:35,523 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3442#true} {3442#true} #37#return; {3442#true} is VALID [2018-11-23 13:13:35,523 INFO L256 TraceCheckUtils]: 3: Hoare triple {3442#true} call #t~ret3 := main(); {3442#true} is VALID [2018-11-23 13:13:35,523 INFO L273 TraceCheckUtils]: 4: Hoare triple {3442#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3442#true} is VALID [2018-11-23 13:13:35,524 INFO L273 TraceCheckUtils]: 5: Hoare triple {3442#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {3462#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-23 13:13:35,524 INFO L273 TraceCheckUtils]: 6: Hoare triple {3462#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3466#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-23 13:13:35,525 INFO L273 TraceCheckUtils]: 7: Hoare triple {3466#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3470#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} is VALID [2018-11-23 13:13:35,525 INFO L273 TraceCheckUtils]: 8: Hoare triple {3470#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3474#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-23 13:13:35,526 INFO L273 TraceCheckUtils]: 9: Hoare triple {3474#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3478#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-23 13:13:35,526 INFO L273 TraceCheckUtils]: 10: Hoare triple {3478#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3482#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-23 13:13:35,527 INFO L273 TraceCheckUtils]: 11: Hoare triple {3482#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3486#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-23 13:13:35,527 INFO L273 TraceCheckUtils]: 12: Hoare triple {3486#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3490#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-23 13:13:35,528 INFO L273 TraceCheckUtils]: 13: Hoare triple {3490#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3494#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-23 13:13:35,529 INFO L273 TraceCheckUtils]: 14: Hoare triple {3494#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3498#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-23 13:13:35,530 INFO L273 TraceCheckUtils]: 15: Hoare triple {3498#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3502#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-23 13:13:35,531 INFO L273 TraceCheckUtils]: 16: Hoare triple {3502#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3506#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-23 13:13:35,531 INFO L273 TraceCheckUtils]: 17: Hoare triple {3506#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3510#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-23 13:13:35,532 INFO L273 TraceCheckUtils]: 18: Hoare triple {3510#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3514#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} is VALID [2018-11-23 13:13:35,533 INFO L273 TraceCheckUtils]: 19: Hoare triple {3514#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3518#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-23 13:13:35,534 INFO L273 TraceCheckUtils]: 20: Hoare triple {3518#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3522#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} is VALID [2018-11-23 13:13:35,534 INFO L273 TraceCheckUtils]: 21: Hoare triple {3522#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3526#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-23 13:13:35,535 INFO L273 TraceCheckUtils]: 22: Hoare triple {3526#(and (= main_~i~0 9) (= main_~sum~0 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3530#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} is VALID [2018-11-23 13:13:35,536 INFO L273 TraceCheckUtils]: 23: Hoare triple {3530#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3534#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-23 13:13:35,537 INFO L273 TraceCheckUtils]: 24: Hoare triple {3534#(and (= main_~sum~0 45) (= main_~i~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3538#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} is VALID [2018-11-23 13:13:35,538 INFO L273 TraceCheckUtils]: 25: Hoare triple {3538#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3542#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-23 13:13:35,538 INFO L273 TraceCheckUtils]: 26: Hoare triple {3542#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3546#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} is VALID [2018-11-23 13:13:35,539 INFO L273 TraceCheckUtils]: 27: Hoare triple {3546#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3550#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-23 13:13:35,540 INFO L273 TraceCheckUtils]: 28: Hoare triple {3550#(and (= main_~i~0 12) (= main_~sum~0 66))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3554#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} is VALID [2018-11-23 13:13:35,541 INFO L273 TraceCheckUtils]: 29: Hoare triple {3554#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3558#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-23 13:13:35,543 INFO L273 TraceCheckUtils]: 30: Hoare triple {3558#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3562#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2018-11-23 13:13:35,544 INFO L273 TraceCheckUtils]: 31: Hoare triple {3562#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3566#(and (= main_~i~0 14) (= main_~sum~0 91))} is VALID [2018-11-23 13:13:35,544 INFO L273 TraceCheckUtils]: 32: Hoare triple {3566#(and (= main_~i~0 14) (= main_~sum~0 91))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3570#(and (= main_~i~0 14) (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 91)))} is VALID [2018-11-23 13:13:35,545 INFO L273 TraceCheckUtils]: 33: Hoare triple {3570#(and (= main_~i~0 14) (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 91)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3574#(and (= main_~sum~0 105) (<= main_~i~0 15) (<= 14 main_~n~0))} is VALID [2018-11-23 13:13:35,545 INFO L273 TraceCheckUtils]: 34: Hoare triple {3574#(and (= main_~sum~0 105) (<= main_~i~0 15) (<= 14 main_~n~0))} assume !(~i~0 <= ~n~0); {3578#(and (= main_~sum~0 105) (<= 14 main_~n~0) (<= main_~n~0 14))} is VALID [2018-11-23 13:13:35,547 INFO L256 TraceCheckUtils]: 35: Hoare triple {3578#(and (= main_~sum~0 105) (<= 14 main_~n~0) (<= main_~n~0 14))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {3582#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:13:35,547 INFO L273 TraceCheckUtils]: 36: Hoare triple {3582#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {3586#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:13:35,551 INFO L273 TraceCheckUtils]: 37: Hoare triple {3586#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3443#false} is VALID [2018-11-23 13:13:35,551 INFO L273 TraceCheckUtils]: 38: Hoare triple {3443#false} assume !false; {3443#false} is VALID [2018-11-23 13:13:35,554 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:35,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:13:35,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-11-23 13:13:35,573 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 39 [2018-11-23 13:13:35,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:35,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 13:13:35,609 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:13:35,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 13:13:35,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 13:13:35,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 13:13:35,611 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 34 states. [2018-11-23 13:13:38,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:38,005 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-11-23 13:13:38,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 13:13:38,005 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 39 [2018-11-23 13:13:38,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:38,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 13:13:38,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2018-11-23 13:13:38,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 13:13:38,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2018-11-23 13:13:38,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 47 transitions. [2018-11-23 13:13:38,053 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:13:38,054 INFO L225 Difference]: With dead ends: 47 [2018-11-23 13:13:38,054 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 13:13:38,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=74, Invalid=1186, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 13:13:38,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 13:13:38,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-23 13:13:38,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:38,093 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-23 13:13:38,093 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 13:13:38,093 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 13:13:38,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:38,095 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-23 13:13:38,095 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-23 13:13:38,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:38,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:38,096 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 13:13:38,096 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 13:13:38,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:38,098 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-23 13:13:38,098 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-23 13:13:38,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:38,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:38,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:38,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:38,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 13:13:38,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-11-23 13:13:38,100 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2018-11-23 13:13:38,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:38,100 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-11-23 13:13:38,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 13:13:38,100 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-23 13:13:38,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 13:13:38,101 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:38,101 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:38,101 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:38,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:38,101 INFO L82 PathProgramCache]: Analyzing trace with hash 623372449, now seen corresponding path program 15 times [2018-11-23 13:13:38,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:38,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:38,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:38,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:38,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:38,113 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:13:38,113 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:13:38,113 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:38,135 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:13:38,197 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-23 13:13:38,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:38,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:39,399 INFO L256 TraceCheckUtils]: 0: Hoare triple {3815#true} call ULTIMATE.init(); {3815#true} is VALID [2018-11-23 13:13:39,399 INFO L273 TraceCheckUtils]: 1: Hoare triple {3815#true} assume true; {3815#true} is VALID [2018-11-23 13:13:39,399 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3815#true} {3815#true} #37#return; {3815#true} is VALID [2018-11-23 13:13:39,400 INFO L256 TraceCheckUtils]: 3: Hoare triple {3815#true} call #t~ret3 := main(); {3815#true} is VALID [2018-11-23 13:13:39,400 INFO L273 TraceCheckUtils]: 4: Hoare triple {3815#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3815#true} is VALID [2018-11-23 13:13:39,401 INFO L273 TraceCheckUtils]: 5: Hoare triple {3815#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {3835#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-23 13:13:39,401 INFO L273 TraceCheckUtils]: 6: Hoare triple {3835#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3839#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-23 13:13:39,402 INFO L273 TraceCheckUtils]: 7: Hoare triple {3839#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3843#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2018-11-23 13:13:39,403 INFO L273 TraceCheckUtils]: 8: Hoare triple {3843#(and (= main_~i~0 2) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3847#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-23 13:13:39,404 INFO L273 TraceCheckUtils]: 9: Hoare triple {3847#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3851#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-23 13:13:39,405 INFO L273 TraceCheckUtils]: 10: Hoare triple {3851#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3855#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-23 13:13:39,406 INFO L273 TraceCheckUtils]: 11: Hoare triple {3855#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3859#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-23 13:13:39,407 INFO L273 TraceCheckUtils]: 12: Hoare triple {3859#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3863#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-23 13:13:39,408 INFO L273 TraceCheckUtils]: 13: Hoare triple {3863#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3867#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-23 13:13:39,409 INFO L273 TraceCheckUtils]: 14: Hoare triple {3867#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3871#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-23 13:13:39,410 INFO L273 TraceCheckUtils]: 15: Hoare triple {3871#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3875#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-23 13:13:39,410 INFO L273 TraceCheckUtils]: 16: Hoare triple {3875#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3879#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-23 13:13:39,411 INFO L273 TraceCheckUtils]: 17: Hoare triple {3879#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3883#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-23 13:13:39,412 INFO L273 TraceCheckUtils]: 18: Hoare triple {3883#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3887#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} is VALID [2018-11-23 13:13:39,413 INFO L273 TraceCheckUtils]: 19: Hoare triple {3887#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3891#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-23 13:13:39,414 INFO L273 TraceCheckUtils]: 20: Hoare triple {3891#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3895#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} is VALID [2018-11-23 13:13:39,415 INFO L273 TraceCheckUtils]: 21: Hoare triple {3895#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3899#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-23 13:13:39,416 INFO L273 TraceCheckUtils]: 22: Hoare triple {3899#(and (= main_~i~0 9) (= main_~sum~0 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3903#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} is VALID [2018-11-23 13:13:39,417 INFO L273 TraceCheckUtils]: 23: Hoare triple {3903#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3907#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-23 13:13:39,418 INFO L273 TraceCheckUtils]: 24: Hoare triple {3907#(and (= main_~sum~0 45) (= main_~i~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3911#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} is VALID [2018-11-23 13:13:39,418 INFO L273 TraceCheckUtils]: 25: Hoare triple {3911#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3915#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-23 13:13:39,419 INFO L273 TraceCheckUtils]: 26: Hoare triple {3915#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3919#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} is VALID [2018-11-23 13:13:39,420 INFO L273 TraceCheckUtils]: 27: Hoare triple {3919#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3923#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-23 13:13:39,421 INFO L273 TraceCheckUtils]: 28: Hoare triple {3923#(and (= main_~i~0 12) (= main_~sum~0 66))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3927#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} is VALID [2018-11-23 13:13:39,422 INFO L273 TraceCheckUtils]: 29: Hoare triple {3927#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3931#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-23 13:13:39,423 INFO L273 TraceCheckUtils]: 30: Hoare triple {3931#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3935#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2018-11-23 13:13:39,424 INFO L273 TraceCheckUtils]: 31: Hoare triple {3935#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3939#(and (= main_~i~0 14) (= main_~sum~0 91))} is VALID [2018-11-23 13:13:39,424 INFO L273 TraceCheckUtils]: 32: Hoare triple {3939#(and (= main_~i~0 14) (= main_~sum~0 91))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3943#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} is VALID [2018-11-23 13:13:39,425 INFO L273 TraceCheckUtils]: 33: Hoare triple {3943#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3947#(and (= main_~sum~0 105) (= main_~i~0 15))} is VALID [2018-11-23 13:13:39,426 INFO L273 TraceCheckUtils]: 34: Hoare triple {3947#(and (= main_~sum~0 105) (= main_~i~0 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3951#(and (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} is VALID [2018-11-23 13:13:39,427 INFO L273 TraceCheckUtils]: 35: Hoare triple {3951#(and (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3955#(and (<= 15 main_~n~0) (= main_~sum~0 120) (<= main_~i~0 16))} is VALID [2018-11-23 13:13:39,428 INFO L273 TraceCheckUtils]: 36: Hoare triple {3955#(and (<= 15 main_~n~0) (= main_~sum~0 120) (<= main_~i~0 16))} assume !(~i~0 <= ~n~0); {3959#(and (<= 15 main_~n~0) (= main_~sum~0 120) (<= main_~n~0 15))} is VALID [2018-11-23 13:13:39,430 INFO L256 TraceCheckUtils]: 37: Hoare triple {3959#(and (<= 15 main_~n~0) (= main_~sum~0 120) (<= main_~n~0 15))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {3963#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:13:39,430 INFO L273 TraceCheckUtils]: 38: Hoare triple {3963#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {3967#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:13:39,431 INFO L273 TraceCheckUtils]: 39: Hoare triple {3967#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3816#false} is VALID [2018-11-23 13:13:39,431 INFO L273 TraceCheckUtils]: 40: Hoare triple {3816#false} assume !false; {3816#false} is VALID [2018-11-23 13:13:39,437 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:39,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:13:39,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-11-23 13:13:39,458 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 41 [2018-11-23 13:13:39,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:39,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 13:13:39,503 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:13:39,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 13:13:39,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 13:13:39,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 13:13:39,505 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 36 states. [2018-11-23 13:13:42,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:42,179 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-11-23 13:13:42,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 13:13:42,179 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 41 [2018-11-23 13:13:42,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:42,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 13:13:42,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2018-11-23 13:13:42,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 13:13:42,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2018-11-23 13:13:42,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 49 transitions. [2018-11-23 13:13:42,600 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:13:42,601 INFO L225 Difference]: With dead ends: 49 [2018-11-23 13:13:42,601 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 13:13:42,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=78, Invalid=1328, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 13:13:42,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 13:13:42,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-23 13:13:42,639 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:42,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2018-11-23 13:13:42,639 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-23 13:13:42,640 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-23 13:13:42,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:42,642 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-11-23 13:13:42,642 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-23 13:13:42,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:42,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:42,642 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-23 13:13:42,643 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-23 13:13:42,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:42,644 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-11-23 13:13:42,644 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-23 13:13:42,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:42,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:42,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:42,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:42,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 13:13:42,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-11-23 13:13:42,646 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2018-11-23 13:13:42,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:42,647 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-11-23 13:13:42,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 13:13:42,647 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-23 13:13:42,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 13:13:42,647 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:42,647 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:42,648 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:42,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:42,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1099137057, now seen corresponding path program 16 times [2018-11-23 13:13:42,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:42,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:42,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:42,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:42,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:42,670 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:13:42,670 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:13:42,671 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:42,688 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:13:42,714 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:13:42,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:42,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:42,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:44,031 INFO L256 TraceCheckUtils]: 0: Hoare triple {4206#true} call ULTIMATE.init(); {4206#true} is VALID [2018-11-23 13:13:44,031 INFO L273 TraceCheckUtils]: 1: Hoare triple {4206#true} assume true; {4206#true} is VALID [2018-11-23 13:13:44,032 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4206#true} {4206#true} #37#return; {4206#true} is VALID [2018-11-23 13:13:44,032 INFO L256 TraceCheckUtils]: 3: Hoare triple {4206#true} call #t~ret3 := main(); {4206#true} is VALID [2018-11-23 13:13:44,032 INFO L273 TraceCheckUtils]: 4: Hoare triple {4206#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {4206#true} is VALID [2018-11-23 13:13:44,033 INFO L273 TraceCheckUtils]: 5: Hoare triple {4206#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {4226#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-23 13:13:44,033 INFO L273 TraceCheckUtils]: 6: Hoare triple {4226#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4230#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-23 13:13:44,034 INFO L273 TraceCheckUtils]: 7: Hoare triple {4230#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4234#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2018-11-23 13:13:44,034 INFO L273 TraceCheckUtils]: 8: Hoare triple {4234#(and (= main_~i~0 2) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4238#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-23 13:13:44,035 INFO L273 TraceCheckUtils]: 9: Hoare triple {4238#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4242#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-23 13:13:44,035 INFO L273 TraceCheckUtils]: 10: Hoare triple {4242#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4246#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-23 13:13:44,036 INFO L273 TraceCheckUtils]: 11: Hoare triple {4246#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4250#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-23 13:13:44,037 INFO L273 TraceCheckUtils]: 12: Hoare triple {4250#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4254#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-23 13:13:44,037 INFO L273 TraceCheckUtils]: 13: Hoare triple {4254#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4258#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-23 13:13:44,038 INFO L273 TraceCheckUtils]: 14: Hoare triple {4258#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4262#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-23 13:13:44,039 INFO L273 TraceCheckUtils]: 15: Hoare triple {4262#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4266#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-23 13:13:44,040 INFO L273 TraceCheckUtils]: 16: Hoare triple {4266#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4270#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-23 13:13:44,041 INFO L273 TraceCheckUtils]: 17: Hoare triple {4270#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4274#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-23 13:13:44,041 INFO L273 TraceCheckUtils]: 18: Hoare triple {4274#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4278#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} is VALID [2018-11-23 13:13:44,042 INFO L273 TraceCheckUtils]: 19: Hoare triple {4278#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4282#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-23 13:13:44,043 INFO L273 TraceCheckUtils]: 20: Hoare triple {4282#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4286#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} is VALID [2018-11-23 13:13:44,044 INFO L273 TraceCheckUtils]: 21: Hoare triple {4286#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4290#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-23 13:13:44,044 INFO L273 TraceCheckUtils]: 22: Hoare triple {4290#(and (= main_~i~0 9) (= main_~sum~0 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4294#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} is VALID [2018-11-23 13:13:44,045 INFO L273 TraceCheckUtils]: 23: Hoare triple {4294#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4298#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-23 13:13:44,046 INFO L273 TraceCheckUtils]: 24: Hoare triple {4298#(and (= main_~sum~0 45) (= main_~i~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4302#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} is VALID [2018-11-23 13:13:44,047 INFO L273 TraceCheckUtils]: 25: Hoare triple {4302#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4306#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-23 13:13:44,048 INFO L273 TraceCheckUtils]: 26: Hoare triple {4306#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4310#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} is VALID [2018-11-23 13:13:44,048 INFO L273 TraceCheckUtils]: 27: Hoare triple {4310#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4314#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-23 13:13:44,049 INFO L273 TraceCheckUtils]: 28: Hoare triple {4314#(and (= main_~i~0 12) (= main_~sum~0 66))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4318#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} is VALID [2018-11-23 13:13:44,050 INFO L273 TraceCheckUtils]: 29: Hoare triple {4318#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4322#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-23 13:13:44,051 INFO L273 TraceCheckUtils]: 30: Hoare triple {4322#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4326#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2018-11-23 13:13:44,051 INFO L273 TraceCheckUtils]: 31: Hoare triple {4326#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4330#(and (= main_~i~0 14) (= main_~sum~0 91))} is VALID [2018-11-23 13:13:44,052 INFO L273 TraceCheckUtils]: 32: Hoare triple {4330#(and (= main_~i~0 14) (= main_~sum~0 91))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4334#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} is VALID [2018-11-23 13:13:44,053 INFO L273 TraceCheckUtils]: 33: Hoare triple {4334#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4338#(and (= main_~sum~0 105) (= main_~i~0 15))} is VALID [2018-11-23 13:13:44,054 INFO L273 TraceCheckUtils]: 34: Hoare triple {4338#(and (= main_~sum~0 105) (= main_~i~0 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4342#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} is VALID [2018-11-23 13:13:44,054 INFO L273 TraceCheckUtils]: 35: Hoare triple {4342#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4346#(and (= main_~sum~0 120) (= main_~i~0 16))} is VALID [2018-11-23 13:13:44,055 INFO L273 TraceCheckUtils]: 36: Hoare triple {4346#(and (= main_~sum~0 120) (= main_~i~0 16))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4350#(and (<= main_~i~0 main_~n~0) (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} is VALID [2018-11-23 13:13:44,056 INFO L273 TraceCheckUtils]: 37: Hoare triple {4350#(and (<= main_~i~0 main_~n~0) (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4354#(and (<= main_~i~0 17) (= main_~sum~0 136) (<= 16 main_~n~0))} is VALID [2018-11-23 13:13:44,057 INFO L273 TraceCheckUtils]: 38: Hoare triple {4354#(and (<= main_~i~0 17) (= main_~sum~0 136) (<= 16 main_~n~0))} assume !(~i~0 <= ~n~0); {4358#(and (<= main_~n~0 16) (= main_~sum~0 136) (<= 16 main_~n~0))} is VALID [2018-11-23 13:13:44,058 INFO L256 TraceCheckUtils]: 39: Hoare triple {4358#(and (<= main_~n~0 16) (= main_~sum~0 136) (<= 16 main_~n~0))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {4362#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:13:44,059 INFO L273 TraceCheckUtils]: 40: Hoare triple {4362#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {4366#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:13:44,059 INFO L273 TraceCheckUtils]: 41: Hoare triple {4366#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4207#false} is VALID [2018-11-23 13:13:44,059 INFO L273 TraceCheckUtils]: 42: Hoare triple {4207#false} assume !false; {4207#false} is VALID [2018-11-23 13:13:44,064 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:44,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:13:44,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-11-23 13:13:44,087 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 43 [2018-11-23 13:13:44,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:44,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-23 13:13:44,126 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:13:44,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 13:13:44,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 13:13:44,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 13:13:44,128 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 38 states. [2018-11-23 13:13:46,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:46,841 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-11-23 13:13:46,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 13:13:46,842 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 43 [2018-11-23 13:13:46,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:46,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 13:13:46,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2018-11-23 13:13:46,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 13:13:46,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2018-11-23 13:13:46,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 51 transitions. [2018-11-23 13:13:47,293 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:13:47,294 INFO L225 Difference]: With dead ends: 51 [2018-11-23 13:13:47,295 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 13:13:47,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=82, Invalid=1478, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 13:13:47,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 13:13:47,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-23 13:13:47,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:47,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2018-11-23 13:13:47,356 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 13:13:47,356 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 13:13:47,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:47,358 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-23 13:13:47,358 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-23 13:13:47,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:47,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:47,358 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 13:13:47,359 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 13:13:47,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:47,360 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-23 13:13:47,360 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-23 13:13:47,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:47,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:47,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:47,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:47,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 13:13:47,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-11-23 13:13:47,363 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2018-11-23 13:13:47,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:47,363 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-11-23 13:13:47,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 13:13:47,363 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-23 13:13:47,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 13:13:47,364 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:47,364 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:47,364 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:47,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:47,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1426603933, now seen corresponding path program 17 times [2018-11-23 13:13:47,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:47,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:47,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:47,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:47,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:47,375 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:13:47,375 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:13:47,376 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:13:47,395 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:13:47,429 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-23 13:13:47,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:47,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:47,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:49,393 INFO L256 TraceCheckUtils]: 0: Hoare triple {4615#true} call ULTIMATE.init(); {4615#true} is VALID [2018-11-23 13:13:49,394 INFO L273 TraceCheckUtils]: 1: Hoare triple {4615#true} assume true; {4615#true} is VALID [2018-11-23 13:13:49,394 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4615#true} {4615#true} #37#return; {4615#true} is VALID [2018-11-23 13:13:49,394 INFO L256 TraceCheckUtils]: 3: Hoare triple {4615#true} call #t~ret3 := main(); {4615#true} is VALID [2018-11-23 13:13:49,395 INFO L273 TraceCheckUtils]: 4: Hoare triple {4615#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {4615#true} is VALID [2018-11-23 13:13:49,401 INFO L273 TraceCheckUtils]: 5: Hoare triple {4615#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {4635#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-23 13:13:49,402 INFO L273 TraceCheckUtils]: 6: Hoare triple {4635#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4639#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-23 13:13:49,402 INFO L273 TraceCheckUtils]: 7: Hoare triple {4639#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4643#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} is VALID [2018-11-23 13:13:49,403 INFO L273 TraceCheckUtils]: 8: Hoare triple {4643#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4647#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-23 13:13:49,403 INFO L273 TraceCheckUtils]: 9: Hoare triple {4647#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4651#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-23 13:13:49,404 INFO L273 TraceCheckUtils]: 10: Hoare triple {4651#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4655#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-23 13:13:49,404 INFO L273 TraceCheckUtils]: 11: Hoare triple {4655#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4659#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-23 13:13:49,405 INFO L273 TraceCheckUtils]: 12: Hoare triple {4659#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4663#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-23 13:13:49,406 INFO L273 TraceCheckUtils]: 13: Hoare triple {4663#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4667#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-23 13:13:49,407 INFO L273 TraceCheckUtils]: 14: Hoare triple {4667#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4671#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-23 13:13:49,408 INFO L273 TraceCheckUtils]: 15: Hoare triple {4671#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4675#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-23 13:13:49,408 INFO L273 TraceCheckUtils]: 16: Hoare triple {4675#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4679#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-23 13:13:49,409 INFO L273 TraceCheckUtils]: 17: Hoare triple {4679#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4683#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-23 13:13:49,410 INFO L273 TraceCheckUtils]: 18: Hoare triple {4683#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4687#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} is VALID [2018-11-23 13:13:49,411 INFO L273 TraceCheckUtils]: 19: Hoare triple {4687#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4691#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-23 13:13:49,411 INFO L273 TraceCheckUtils]: 20: Hoare triple {4691#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4695#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} is VALID [2018-11-23 13:13:49,412 INFO L273 TraceCheckUtils]: 21: Hoare triple {4695#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4699#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-23 13:13:49,413 INFO L273 TraceCheckUtils]: 22: Hoare triple {4699#(and (= main_~i~0 9) (= main_~sum~0 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4703#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} is VALID [2018-11-23 13:13:49,414 INFO L273 TraceCheckUtils]: 23: Hoare triple {4703#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4707#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-23 13:13:49,415 INFO L273 TraceCheckUtils]: 24: Hoare triple {4707#(and (= main_~sum~0 45) (= main_~i~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4711#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} is VALID [2018-11-23 13:13:49,415 INFO L273 TraceCheckUtils]: 25: Hoare triple {4711#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4715#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-23 13:13:49,416 INFO L273 TraceCheckUtils]: 26: Hoare triple {4715#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4719#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} is VALID [2018-11-23 13:13:49,417 INFO L273 TraceCheckUtils]: 27: Hoare triple {4719#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4723#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-23 13:13:49,418 INFO L273 TraceCheckUtils]: 28: Hoare triple {4723#(and (= main_~i~0 12) (= main_~sum~0 66))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4727#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} is VALID [2018-11-23 13:13:49,418 INFO L273 TraceCheckUtils]: 29: Hoare triple {4727#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4731#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-23 13:13:49,419 INFO L273 TraceCheckUtils]: 30: Hoare triple {4731#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4735#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2018-11-23 13:13:49,420 INFO L273 TraceCheckUtils]: 31: Hoare triple {4735#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4739#(and (= main_~i~0 14) (= main_~sum~0 91))} is VALID [2018-11-23 13:13:49,421 INFO L273 TraceCheckUtils]: 32: Hoare triple {4739#(and (= main_~i~0 14) (= main_~sum~0 91))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4743#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} is VALID [2018-11-23 13:13:49,421 INFO L273 TraceCheckUtils]: 33: Hoare triple {4743#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4747#(and (= main_~sum~0 105) (= main_~i~0 15))} is VALID [2018-11-23 13:13:49,422 INFO L273 TraceCheckUtils]: 34: Hoare triple {4747#(and (= main_~sum~0 105) (= main_~i~0 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4751#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} is VALID [2018-11-23 13:13:49,423 INFO L273 TraceCheckUtils]: 35: Hoare triple {4751#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4755#(and (= main_~sum~0 120) (= main_~i~0 16))} is VALID [2018-11-23 13:13:49,424 INFO L273 TraceCheckUtils]: 36: Hoare triple {4755#(and (= main_~sum~0 120) (= main_~i~0 16))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4759#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} is VALID [2018-11-23 13:13:49,425 INFO L273 TraceCheckUtils]: 37: Hoare triple {4759#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4763#(and (= main_~i~0 17) (= main_~sum~0 136))} is VALID [2018-11-23 13:13:49,425 INFO L273 TraceCheckUtils]: 38: Hoare triple {4763#(and (= main_~i~0 17) (= main_~sum~0 136))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4767#(and (= main_~i~0 17) (<= main_~i~0 main_~n~0) (= (+ main_~i~0 136) main_~sum~0))} is VALID [2018-11-23 13:13:49,426 INFO L273 TraceCheckUtils]: 39: Hoare triple {4767#(and (= main_~i~0 17) (<= main_~i~0 main_~n~0) (= (+ main_~i~0 136) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4771#(and (<= main_~i~0 18) (= main_~sum~0 153) (<= 17 main_~n~0))} is VALID [2018-11-23 13:13:49,427 INFO L273 TraceCheckUtils]: 40: Hoare triple {4771#(and (<= main_~i~0 18) (= main_~sum~0 153) (<= 17 main_~n~0))} assume !(~i~0 <= ~n~0); {4775#(and (= main_~sum~0 153) (<= 17 main_~n~0) (<= main_~n~0 17))} is VALID [2018-11-23 13:13:49,428 INFO L256 TraceCheckUtils]: 41: Hoare triple {4775#(and (= main_~sum~0 153) (<= 17 main_~n~0) (<= main_~n~0 17))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {4779#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:13:49,446 INFO L273 TraceCheckUtils]: 42: Hoare triple {4779#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {4783#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:13:49,447 INFO L273 TraceCheckUtils]: 43: Hoare triple {4783#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4616#false} is VALID [2018-11-23 13:13:49,447 INFO L273 TraceCheckUtils]: 44: Hoare triple {4616#false} assume !false; {4616#false} is VALID [2018-11-23 13:13:49,451 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:49,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:13:49,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-11-23 13:13:49,470 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 45 [2018-11-23 13:13:49,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:49,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-23 13:13:49,520 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:13:49,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-23 13:13:49,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 13:13:49,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 13:13:49,521 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 40 states. [2018-11-23 13:13:52,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:52,668 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-11-23 13:13:52,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 13:13:52,668 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 45 [2018-11-23 13:13:52,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:52,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 13:13:52,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2018-11-23 13:13:52,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 13:13:52,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2018-11-23 13:13:52,671 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 53 transitions. [2018-11-23 13:13:52,721 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:13:52,722 INFO L225 Difference]: With dead ends: 53 [2018-11-23 13:13:52,722 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 13:13:52,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=86, Invalid=1636, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 13:13:52,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 13:13:52,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-23 13:13:52,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:52,769 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2018-11-23 13:13:52,769 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-23 13:13:52,770 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-23 13:13:52,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:52,771 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-11-23 13:13:52,771 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-11-23 13:13:52,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:52,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:52,772 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-23 13:13:52,772 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-23 13:13:52,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:52,773 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-11-23 13:13:52,773 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-11-23 13:13:52,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:52,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:52,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:52,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:52,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 13:13:52,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-11-23 13:13:52,775 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2018-11-23 13:13:52,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:52,775 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-11-23 13:13:52,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-23 13:13:52,775 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-11-23 13:13:52,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 13:13:52,776 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:52,776 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:52,776 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:52,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:52,777 INFO L82 PathProgramCache]: Analyzing trace with hash 2007173083, now seen corresponding path program 18 times [2018-11-23 13:13:52,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:52,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:52,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:52,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:52,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:52,786 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:13:52,786 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:13:52,786 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:13:52,804 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:13:52,885 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 13:13:52,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:52,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:54,354 INFO L256 TraceCheckUtils]: 0: Hoare triple {5042#true} call ULTIMATE.init(); {5042#true} is VALID [2018-11-23 13:13:54,354 INFO L273 TraceCheckUtils]: 1: Hoare triple {5042#true} assume true; {5042#true} is VALID [2018-11-23 13:13:54,354 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5042#true} {5042#true} #37#return; {5042#true} is VALID [2018-11-23 13:13:54,355 INFO L256 TraceCheckUtils]: 3: Hoare triple {5042#true} call #t~ret3 := main(); {5042#true} is VALID [2018-11-23 13:13:54,355 INFO L273 TraceCheckUtils]: 4: Hoare triple {5042#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {5042#true} is VALID [2018-11-23 13:13:54,356 INFO L273 TraceCheckUtils]: 5: Hoare triple {5042#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {5062#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-23 13:13:54,357 INFO L273 TraceCheckUtils]: 6: Hoare triple {5062#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5066#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-23 13:13:54,357 INFO L273 TraceCheckUtils]: 7: Hoare triple {5066#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5070#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2018-11-23 13:13:54,358 INFO L273 TraceCheckUtils]: 8: Hoare triple {5070#(and (= main_~i~0 2) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5074#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-23 13:13:54,359 INFO L273 TraceCheckUtils]: 9: Hoare triple {5074#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5078#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-23 13:13:54,359 INFO L273 TraceCheckUtils]: 10: Hoare triple {5078#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5082#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-23 13:13:54,360 INFO L273 TraceCheckUtils]: 11: Hoare triple {5082#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5086#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-23 13:13:54,360 INFO L273 TraceCheckUtils]: 12: Hoare triple {5086#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5090#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-23 13:13:54,361 INFO L273 TraceCheckUtils]: 13: Hoare triple {5090#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5094#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-23 13:13:54,362 INFO L273 TraceCheckUtils]: 14: Hoare triple {5094#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5098#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-23 13:13:54,363 INFO L273 TraceCheckUtils]: 15: Hoare triple {5098#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5102#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-23 13:13:54,364 INFO L273 TraceCheckUtils]: 16: Hoare triple {5102#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5106#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-23 13:13:54,365 INFO L273 TraceCheckUtils]: 17: Hoare triple {5106#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5110#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-23 13:13:54,366 INFO L273 TraceCheckUtils]: 18: Hoare triple {5110#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5114#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} is VALID [2018-11-23 13:13:54,367 INFO L273 TraceCheckUtils]: 19: Hoare triple {5114#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5118#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-23 13:13:54,367 INFO L273 TraceCheckUtils]: 20: Hoare triple {5118#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5122#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} is VALID [2018-11-23 13:13:54,368 INFO L273 TraceCheckUtils]: 21: Hoare triple {5122#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5126#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-23 13:13:54,369 INFO L273 TraceCheckUtils]: 22: Hoare triple {5126#(and (= main_~i~0 9) (= main_~sum~0 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5130#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} is VALID [2018-11-23 13:13:54,370 INFO L273 TraceCheckUtils]: 23: Hoare triple {5130#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5134#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-23 13:13:54,371 INFO L273 TraceCheckUtils]: 24: Hoare triple {5134#(and (= main_~sum~0 45) (= main_~i~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5138#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} is VALID [2018-11-23 13:13:54,372 INFO L273 TraceCheckUtils]: 25: Hoare triple {5138#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5142#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-23 13:13:54,373 INFO L273 TraceCheckUtils]: 26: Hoare triple {5142#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5146#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} is VALID [2018-11-23 13:13:54,374 INFO L273 TraceCheckUtils]: 27: Hoare triple {5146#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5150#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-23 13:13:54,375 INFO L273 TraceCheckUtils]: 28: Hoare triple {5150#(and (= main_~i~0 12) (= main_~sum~0 66))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5154#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} is VALID [2018-11-23 13:13:54,375 INFO L273 TraceCheckUtils]: 29: Hoare triple {5154#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5158#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-23 13:13:54,376 INFO L273 TraceCheckUtils]: 30: Hoare triple {5158#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5162#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2018-11-23 13:13:54,377 INFO L273 TraceCheckUtils]: 31: Hoare triple {5162#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5166#(and (= main_~i~0 14) (= main_~sum~0 91))} is VALID [2018-11-23 13:13:54,378 INFO L273 TraceCheckUtils]: 32: Hoare triple {5166#(and (= main_~i~0 14) (= main_~sum~0 91))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5170#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} is VALID [2018-11-23 13:13:54,379 INFO L273 TraceCheckUtils]: 33: Hoare triple {5170#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5174#(and (= main_~sum~0 105) (= main_~i~0 15))} is VALID [2018-11-23 13:13:54,384 INFO L273 TraceCheckUtils]: 34: Hoare triple {5174#(and (= main_~sum~0 105) (= main_~i~0 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5178#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} is VALID [2018-11-23 13:13:54,384 INFO L273 TraceCheckUtils]: 35: Hoare triple {5178#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5182#(and (= main_~sum~0 120) (= main_~i~0 16))} is VALID [2018-11-23 13:13:54,385 INFO L273 TraceCheckUtils]: 36: Hoare triple {5182#(and (= main_~sum~0 120) (= main_~i~0 16))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5186#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} is VALID [2018-11-23 13:13:54,386 INFO L273 TraceCheckUtils]: 37: Hoare triple {5186#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5190#(and (= main_~i~0 17) (= main_~sum~0 136))} is VALID [2018-11-23 13:13:54,386 INFO L273 TraceCheckUtils]: 38: Hoare triple {5190#(and (= main_~i~0 17) (= main_~sum~0 136))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5194#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} is VALID [2018-11-23 13:13:54,387 INFO L273 TraceCheckUtils]: 39: Hoare triple {5194#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5198#(and (= main_~i~0 18) (= main_~sum~0 153))} is VALID [2018-11-23 13:13:54,387 INFO L273 TraceCheckUtils]: 40: Hoare triple {5198#(and (= main_~i~0 18) (= main_~sum~0 153))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5202#(and (= main_~i~0 18) (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 153)))} is VALID [2018-11-23 13:13:54,388 INFO L273 TraceCheckUtils]: 41: Hoare triple {5202#(and (= main_~i~0 18) (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 153)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5206#(and (<= main_~i~0 19) (<= 18 main_~n~0) (= main_~sum~0 171))} is VALID [2018-11-23 13:13:54,389 INFO L273 TraceCheckUtils]: 42: Hoare triple {5206#(and (<= main_~i~0 19) (<= 18 main_~n~0) (= main_~sum~0 171))} assume !(~i~0 <= ~n~0); {5210#(and (<= 18 main_~n~0) (= main_~sum~0 171) (<= main_~n~0 18))} is VALID [2018-11-23 13:13:54,390 INFO L256 TraceCheckUtils]: 43: Hoare triple {5210#(and (<= 18 main_~n~0) (= main_~sum~0 171) (<= main_~n~0 18))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {5214#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:13:54,391 INFO L273 TraceCheckUtils]: 44: Hoare triple {5214#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {5218#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:13:54,392 INFO L273 TraceCheckUtils]: 45: Hoare triple {5218#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5043#false} is VALID [2018-11-23 13:13:54,392 INFO L273 TraceCheckUtils]: 46: Hoare triple {5043#false} assume !false; {5043#false} is VALID [2018-11-23 13:13:54,398 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:54,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:13:54,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-11-23 13:13:54,418 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 47 [2018-11-23 13:13:54,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:54,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 13:13:54,467 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:13:54,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 13:13:54,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 13:13:54,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1640, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 13:13:54,469 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 42 states. [2018-11-23 13:13:57,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:57,906 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-11-23 13:13:57,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 13:13:57,907 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 47 [2018-11-23 13:13:57,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:57,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 13:13:57,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2018-11-23 13:13:57,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 13:13:57,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2018-11-23 13:13:57,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 55 transitions. [2018-11-23 13:13:57,960 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:13:57,961 INFO L225 Difference]: With dead ends: 55 [2018-11-23 13:13:57,961 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 13:13:57,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=90, Invalid=1802, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 13:13:57,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 13:13:58,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-23 13:13:58,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:58,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 50 states. [2018-11-23 13:13:58,003 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-23 13:13:58,003 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-23 13:13:58,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:58,005 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-11-23 13:13:58,005 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-11-23 13:13:58,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:58,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:58,006 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-23 13:13:58,006 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-23 13:13:58,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:58,006 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-11-23 13:13:58,007 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-11-23 13:13:58,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:58,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:58,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:58,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:58,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 13:13:58,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-11-23 13:13:58,008 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2018-11-23 13:13:58,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:58,009 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-11-23 13:13:58,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 13:13:58,009 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-11-23 13:13:58,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 13:13:58,009 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:58,009 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:58,009 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:58,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:58,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1588377753, now seen corresponding path program 19 times [2018-11-23 13:13:58,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:58,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:58,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:58,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:58,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:58,019 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:13:58,019 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:13:58,019 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:13:58,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:13:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:58,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:59,830 INFO L256 TraceCheckUtils]: 0: Hoare triple {5487#true} call ULTIMATE.init(); {5487#true} is VALID [2018-11-23 13:13:59,830 INFO L273 TraceCheckUtils]: 1: Hoare triple {5487#true} assume true; {5487#true} is VALID [2018-11-23 13:13:59,830 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5487#true} {5487#true} #37#return; {5487#true} is VALID [2018-11-23 13:13:59,831 INFO L256 TraceCheckUtils]: 3: Hoare triple {5487#true} call #t~ret3 := main(); {5487#true} is VALID [2018-11-23 13:13:59,831 INFO L273 TraceCheckUtils]: 4: Hoare triple {5487#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {5487#true} is VALID [2018-11-23 13:13:59,831 INFO L273 TraceCheckUtils]: 5: Hoare triple {5487#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {5507#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-23 13:13:59,832 INFO L273 TraceCheckUtils]: 6: Hoare triple {5507#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5511#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-23 13:13:59,832 INFO L273 TraceCheckUtils]: 7: Hoare triple {5511#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5515#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2018-11-23 13:13:59,833 INFO L273 TraceCheckUtils]: 8: Hoare triple {5515#(and (= main_~i~0 2) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5519#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-23 13:13:59,833 INFO L273 TraceCheckUtils]: 9: Hoare triple {5519#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5523#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-23 13:13:59,834 INFO L273 TraceCheckUtils]: 10: Hoare triple {5523#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5527#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-23 13:13:59,834 INFO L273 TraceCheckUtils]: 11: Hoare triple {5527#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5531#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-23 13:13:59,835 INFO L273 TraceCheckUtils]: 12: Hoare triple {5531#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5535#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-23 13:13:59,836 INFO L273 TraceCheckUtils]: 13: Hoare triple {5535#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5539#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-23 13:13:59,837 INFO L273 TraceCheckUtils]: 14: Hoare triple {5539#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5543#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-23 13:13:59,838 INFO L273 TraceCheckUtils]: 15: Hoare triple {5543#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5547#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-23 13:13:59,838 INFO L273 TraceCheckUtils]: 16: Hoare triple {5547#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5551#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-23 13:13:59,839 INFO L273 TraceCheckUtils]: 17: Hoare triple {5551#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5555#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-23 13:13:59,840 INFO L273 TraceCheckUtils]: 18: Hoare triple {5555#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5559#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} is VALID [2018-11-23 13:13:59,841 INFO L273 TraceCheckUtils]: 19: Hoare triple {5559#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5563#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-23 13:13:59,841 INFO L273 TraceCheckUtils]: 20: Hoare triple {5563#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5567#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} is VALID [2018-11-23 13:13:59,842 INFO L273 TraceCheckUtils]: 21: Hoare triple {5567#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5571#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-23 13:13:59,843 INFO L273 TraceCheckUtils]: 22: Hoare triple {5571#(and (= main_~i~0 9) (= main_~sum~0 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5575#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} is VALID [2018-11-23 13:13:59,844 INFO L273 TraceCheckUtils]: 23: Hoare triple {5575#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5579#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-23 13:13:59,844 INFO L273 TraceCheckUtils]: 24: Hoare triple {5579#(and (= main_~sum~0 45) (= main_~i~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5583#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} is VALID [2018-11-23 13:13:59,845 INFO L273 TraceCheckUtils]: 25: Hoare triple {5583#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5587#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-23 13:13:59,846 INFO L273 TraceCheckUtils]: 26: Hoare triple {5587#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5591#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} is VALID [2018-11-23 13:13:59,847 INFO L273 TraceCheckUtils]: 27: Hoare triple {5591#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5595#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-23 13:13:59,848 INFO L273 TraceCheckUtils]: 28: Hoare triple {5595#(and (= main_~i~0 12) (= main_~sum~0 66))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5599#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} is VALID [2018-11-23 13:13:59,848 INFO L273 TraceCheckUtils]: 29: Hoare triple {5599#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5603#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-23 13:13:59,849 INFO L273 TraceCheckUtils]: 30: Hoare triple {5603#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5607#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2018-11-23 13:13:59,850 INFO L273 TraceCheckUtils]: 31: Hoare triple {5607#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5611#(and (= main_~i~0 14) (= main_~sum~0 91))} is VALID [2018-11-23 13:13:59,850 INFO L273 TraceCheckUtils]: 32: Hoare triple {5611#(and (= main_~i~0 14) (= main_~sum~0 91))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5615#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} is VALID [2018-11-23 13:13:59,851 INFO L273 TraceCheckUtils]: 33: Hoare triple {5615#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5619#(and (= main_~sum~0 105) (= main_~i~0 15))} is VALID [2018-11-23 13:13:59,852 INFO L273 TraceCheckUtils]: 34: Hoare triple {5619#(and (= main_~sum~0 105) (= main_~i~0 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5623#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} is VALID [2018-11-23 13:13:59,853 INFO L273 TraceCheckUtils]: 35: Hoare triple {5623#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5627#(and (= main_~sum~0 120) (= main_~i~0 16))} is VALID [2018-11-23 13:13:59,853 INFO L273 TraceCheckUtils]: 36: Hoare triple {5627#(and (= main_~sum~0 120) (= main_~i~0 16))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5631#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} is VALID [2018-11-23 13:13:59,854 INFO L273 TraceCheckUtils]: 37: Hoare triple {5631#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5635#(and (= main_~i~0 17) (= main_~sum~0 136))} is VALID [2018-11-23 13:13:59,865 INFO L273 TraceCheckUtils]: 38: Hoare triple {5635#(and (= main_~i~0 17) (= main_~sum~0 136))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5639#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} is VALID [2018-11-23 13:13:59,865 INFO L273 TraceCheckUtils]: 39: Hoare triple {5639#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5643#(and (= main_~i~0 18) (= main_~sum~0 153))} is VALID [2018-11-23 13:13:59,866 INFO L273 TraceCheckUtils]: 40: Hoare triple {5643#(and (= main_~i~0 18) (= main_~sum~0 153))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5647#(and (= main_~i~0 18) (= main_~sum~0 (+ main_~i~0 153)))} is VALID [2018-11-23 13:13:59,866 INFO L273 TraceCheckUtils]: 41: Hoare triple {5647#(and (= main_~i~0 18) (= main_~sum~0 (+ main_~i~0 153)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5651#(and (= main_~i~0 19) (= main_~sum~0 171))} is VALID [2018-11-23 13:13:59,867 INFO L273 TraceCheckUtils]: 42: Hoare triple {5651#(and (= main_~i~0 19) (= main_~sum~0 171))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5655#(and (= (+ main_~i~0 171) main_~sum~0) (<= main_~i~0 main_~n~0) (= main_~i~0 19))} is VALID [2018-11-23 13:13:59,868 INFO L273 TraceCheckUtils]: 43: Hoare triple {5655#(and (= (+ main_~i~0 171) main_~sum~0) (<= main_~i~0 main_~n~0) (= main_~i~0 19))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5659#(and (<= 19 main_~n~0) (<= main_~i~0 20) (= main_~sum~0 190))} is VALID [2018-11-23 13:13:59,868 INFO L273 TraceCheckUtils]: 44: Hoare triple {5659#(and (<= 19 main_~n~0) (<= main_~i~0 20) (= main_~sum~0 190))} assume !(~i~0 <= ~n~0); {5663#(and (<= main_~n~0 19) (<= 19 main_~n~0) (= main_~sum~0 190))} is VALID [2018-11-23 13:13:59,869 INFO L256 TraceCheckUtils]: 45: Hoare triple {5663#(and (<= main_~n~0 19) (<= 19 main_~n~0) (= main_~sum~0 190))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {5667#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:13:59,869 INFO L273 TraceCheckUtils]: 46: Hoare triple {5667#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {5671#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:13:59,870 INFO L273 TraceCheckUtils]: 47: Hoare triple {5671#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5488#false} is VALID [2018-11-23 13:13:59,870 INFO L273 TraceCheckUtils]: 48: Hoare triple {5488#false} assume !false; {5488#false} is VALID [2018-11-23 13:13:59,875 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:59,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:13:59,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-11-23 13:13:59,894 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 49 [2018-11-23 13:13:59,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:59,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states. [2018-11-23 13:13:59,939 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:13:59,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-23 13:13:59,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-23 13:13:59,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 13:13:59,941 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 44 states. [2018-11-23 13:14:03,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:03,825 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-23 13:14:03,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-23 13:14:03,825 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 49 [2018-11-23 13:14:03,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:14:03,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 13:14:03,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 57 transitions. [2018-11-23 13:14:03,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 13:14:03,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 57 transitions. [2018-11-23 13:14:03,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 57 transitions. [2018-11-23 13:14:03,879 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:14:03,880 INFO L225 Difference]: With dead ends: 57 [2018-11-23 13:14:03,880 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 13:14:03,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=94, Invalid=1976, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 13:14:03,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 13:14:03,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-23 13:14:03,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:14:03,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2018-11-23 13:14:03,931 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-23 13:14:03,931 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-23 13:14:03,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:03,933 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-11-23 13:14:03,933 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-11-23 13:14:03,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:03,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:03,934 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-23 13:14:03,934 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-23 13:14:03,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:03,935 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-11-23 13:14:03,935 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-11-23 13:14:03,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:03,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:03,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:14:03,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:14:03,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 13:14:03,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-11-23 13:14:03,937 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2018-11-23 13:14:03,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:14:03,937 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-11-23 13:14:03,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-23 13:14:03,938 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-11-23 13:14:03,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 13:14:03,938 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:14:03,938 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:14:03,938 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:14:03,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:14:03,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1441975849, now seen corresponding path program 20 times [2018-11-23 13:14:03,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:14:03,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:14:03,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:03,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:14:03,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:03,948 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:14:03,948 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:14:03,948 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:03,966 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:14:04,000 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:14:04,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:14:04,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:04,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:05,918 INFO L256 TraceCheckUtils]: 0: Hoare triple {5950#true} call ULTIMATE.init(); {5950#true} is VALID [2018-11-23 13:14:05,918 INFO L273 TraceCheckUtils]: 1: Hoare triple {5950#true} assume true; {5950#true} is VALID [2018-11-23 13:14:05,919 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5950#true} {5950#true} #37#return; {5950#true} is VALID [2018-11-23 13:14:05,919 INFO L256 TraceCheckUtils]: 3: Hoare triple {5950#true} call #t~ret3 := main(); {5950#true} is VALID [2018-11-23 13:14:05,919 INFO L273 TraceCheckUtils]: 4: Hoare triple {5950#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {5950#true} is VALID [2018-11-23 13:14:05,920 INFO L273 TraceCheckUtils]: 5: Hoare triple {5950#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {5970#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-23 13:14:05,921 INFO L273 TraceCheckUtils]: 6: Hoare triple {5970#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5974#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-23 13:14:05,921 INFO L273 TraceCheckUtils]: 7: Hoare triple {5974#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5978#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2018-11-23 13:14:05,922 INFO L273 TraceCheckUtils]: 8: Hoare triple {5978#(and (= main_~i~0 2) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5982#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-23 13:14:05,923 INFO L273 TraceCheckUtils]: 9: Hoare triple {5982#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5986#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-23 13:14:05,923 INFO L273 TraceCheckUtils]: 10: Hoare triple {5986#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5990#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-23 13:14:05,924 INFO L273 TraceCheckUtils]: 11: Hoare triple {5990#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5994#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-23 13:14:05,924 INFO L273 TraceCheckUtils]: 12: Hoare triple {5994#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5998#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-23 13:14:05,925 INFO L273 TraceCheckUtils]: 13: Hoare triple {5998#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6002#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-23 13:14:05,926 INFO L273 TraceCheckUtils]: 14: Hoare triple {6002#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6006#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-23 13:14:05,927 INFO L273 TraceCheckUtils]: 15: Hoare triple {6006#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6010#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-23 13:14:05,927 INFO L273 TraceCheckUtils]: 16: Hoare triple {6010#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6014#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-23 13:14:05,928 INFO L273 TraceCheckUtils]: 17: Hoare triple {6014#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6018#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-23 13:14:05,929 INFO L273 TraceCheckUtils]: 18: Hoare triple {6018#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6022#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} is VALID [2018-11-23 13:14:05,930 INFO L273 TraceCheckUtils]: 19: Hoare triple {6022#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6026#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-23 13:14:05,930 INFO L273 TraceCheckUtils]: 20: Hoare triple {6026#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6030#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} is VALID [2018-11-23 13:14:05,931 INFO L273 TraceCheckUtils]: 21: Hoare triple {6030#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6034#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-23 13:14:05,932 INFO L273 TraceCheckUtils]: 22: Hoare triple {6034#(and (= main_~i~0 9) (= main_~sum~0 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6038#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} is VALID [2018-11-23 13:14:05,933 INFO L273 TraceCheckUtils]: 23: Hoare triple {6038#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6042#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-23 13:14:05,933 INFO L273 TraceCheckUtils]: 24: Hoare triple {6042#(and (= main_~sum~0 45) (= main_~i~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6046#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} is VALID [2018-11-23 13:14:05,934 INFO L273 TraceCheckUtils]: 25: Hoare triple {6046#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6050#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-23 13:14:05,935 INFO L273 TraceCheckUtils]: 26: Hoare triple {6050#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6054#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} is VALID [2018-11-23 13:14:05,936 INFO L273 TraceCheckUtils]: 27: Hoare triple {6054#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6058#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-23 13:14:05,936 INFO L273 TraceCheckUtils]: 28: Hoare triple {6058#(and (= main_~i~0 12) (= main_~sum~0 66))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6062#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} is VALID [2018-11-23 13:14:05,937 INFO L273 TraceCheckUtils]: 29: Hoare triple {6062#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6066#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-23 13:14:05,938 INFO L273 TraceCheckUtils]: 30: Hoare triple {6066#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6070#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2018-11-23 13:14:05,939 INFO L273 TraceCheckUtils]: 31: Hoare triple {6070#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6074#(and (= main_~i~0 14) (= main_~sum~0 91))} is VALID [2018-11-23 13:14:05,939 INFO L273 TraceCheckUtils]: 32: Hoare triple {6074#(and (= main_~i~0 14) (= main_~sum~0 91))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6078#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} is VALID [2018-11-23 13:14:05,940 INFO L273 TraceCheckUtils]: 33: Hoare triple {6078#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6082#(and (= main_~sum~0 105) (= main_~i~0 15))} is VALID [2018-11-23 13:14:05,941 INFO L273 TraceCheckUtils]: 34: Hoare triple {6082#(and (= main_~sum~0 105) (= main_~i~0 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6086#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} is VALID [2018-11-23 13:14:05,942 INFO L273 TraceCheckUtils]: 35: Hoare triple {6086#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6090#(and (= main_~sum~0 120) (= main_~i~0 16))} is VALID [2018-11-23 13:14:05,942 INFO L273 TraceCheckUtils]: 36: Hoare triple {6090#(and (= main_~sum~0 120) (= main_~i~0 16))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6094#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} is VALID [2018-11-23 13:14:05,943 INFO L273 TraceCheckUtils]: 37: Hoare triple {6094#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6098#(and (= main_~i~0 17) (= main_~sum~0 136))} is VALID [2018-11-23 13:14:05,944 INFO L273 TraceCheckUtils]: 38: Hoare triple {6098#(and (= main_~i~0 17) (= main_~sum~0 136))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6102#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} is VALID [2018-11-23 13:14:05,945 INFO L273 TraceCheckUtils]: 39: Hoare triple {6102#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6106#(and (= main_~i~0 18) (= main_~sum~0 153))} is VALID [2018-11-23 13:14:05,946 INFO L273 TraceCheckUtils]: 40: Hoare triple {6106#(and (= main_~i~0 18) (= main_~sum~0 153))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6110#(and (= main_~i~0 18) (= main_~sum~0 (+ main_~i~0 153)))} is VALID [2018-11-23 13:14:05,946 INFO L273 TraceCheckUtils]: 41: Hoare triple {6110#(and (= main_~i~0 18) (= main_~sum~0 (+ main_~i~0 153)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6114#(and (= main_~i~0 19) (= main_~sum~0 171))} is VALID [2018-11-23 13:14:05,947 INFO L273 TraceCheckUtils]: 42: Hoare triple {6114#(and (= main_~i~0 19) (= main_~sum~0 171))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6118#(and (= (+ main_~i~0 171) main_~sum~0) (= main_~i~0 19))} is VALID [2018-11-23 13:14:05,948 INFO L273 TraceCheckUtils]: 43: Hoare triple {6118#(and (= (+ main_~i~0 171) main_~sum~0) (= main_~i~0 19))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6122#(and (= main_~i~0 20) (= main_~sum~0 190))} is VALID [2018-11-23 13:14:05,949 INFO L273 TraceCheckUtils]: 44: Hoare triple {6122#(and (= main_~i~0 20) (= main_~sum~0 190))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6126#(and (= main_~i~0 20) (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 190)))} is VALID [2018-11-23 13:14:05,949 INFO L273 TraceCheckUtils]: 45: Hoare triple {6126#(and (= main_~i~0 20) (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 190)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6130#(and (<= 20 main_~n~0) (<= main_~i~0 21) (= main_~sum~0 210))} is VALID [2018-11-23 13:14:05,950 INFO L273 TraceCheckUtils]: 46: Hoare triple {6130#(and (<= 20 main_~n~0) (<= main_~i~0 21) (= main_~sum~0 210))} assume !(~i~0 <= ~n~0); {6134#(and (<= main_~n~0 20) (<= 20 main_~n~0) (= main_~sum~0 210))} is VALID [2018-11-23 13:14:05,951 INFO L256 TraceCheckUtils]: 47: Hoare triple {6134#(and (<= main_~n~0 20) (<= 20 main_~n~0) (= main_~sum~0 210))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {6138#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:14:05,952 INFO L273 TraceCheckUtils]: 48: Hoare triple {6138#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {6142#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:14:05,953 INFO L273 TraceCheckUtils]: 49: Hoare triple {6142#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5951#false} is VALID [2018-11-23 13:14:05,953 INFO L273 TraceCheckUtils]: 50: Hoare triple {5951#false} assume !false; {5951#false} is VALID [2018-11-23 13:14:05,960 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:14:05,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:14:05,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-11-23 13:14:05,986 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 51 [2018-11-23 13:14:05,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:14:05,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states. [2018-11-23 13:14:06,070 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:14:06,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-23 13:14:06,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-23 13:14:06,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1980, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 13:14:06,072 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 46 states. [2018-11-23 13:14:10,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:10,237 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-11-23 13:14:10,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-23 13:14:10,237 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 51 [2018-11-23 13:14:10,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:14:10,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 13:14:10,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2018-11-23 13:14:10,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 13:14:10,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2018-11-23 13:14:10,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 59 transitions. [2018-11-23 13:14:10,304 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:14:10,306 INFO L225 Difference]: With dead ends: 59 [2018-11-23 13:14:10,306 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 13:14:10,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=98, Invalid=2158, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 13:14:10,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 13:14:10,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-23 13:14:10,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:14:10,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 54 states. [2018-11-23 13:14:10,355 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-23 13:14:10,355 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-23 13:14:10,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:10,356 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-23 13:14:10,356 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-23 13:14:10,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:10,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:10,356 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-23 13:14:10,357 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-23 13:14:10,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:10,358 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-23 13:14:10,358 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-23 13:14:10,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:10,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:10,359 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:14:10,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:14:10,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 13:14:10,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-11-23 13:14:10,360 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2018-11-23 13:14:10,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:14:10,360 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-11-23 13:14:10,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-23 13:14:10,360 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-23 13:14:10,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 13:14:10,361 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:14:10,361 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:14:10,361 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:14:10,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:14:10,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1623960683, now seen corresponding path program 21 times [2018-11-23 13:14:10,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:14:10,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:14:10,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:10,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:14:10,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:10,371 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:14:10,371 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:14:10,371 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:10,392 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:14:10,510 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-23 13:14:10,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:14:10,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:10,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:12,080 INFO L256 TraceCheckUtils]: 0: Hoare triple {6431#true} call ULTIMATE.init(); {6431#true} is VALID [2018-11-23 13:14:12,081 INFO L273 TraceCheckUtils]: 1: Hoare triple {6431#true} assume true; {6431#true} is VALID [2018-11-23 13:14:12,081 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6431#true} {6431#true} #37#return; {6431#true} is VALID [2018-11-23 13:14:12,081 INFO L256 TraceCheckUtils]: 3: Hoare triple {6431#true} call #t~ret3 := main(); {6431#true} is VALID [2018-11-23 13:14:12,081 INFO L273 TraceCheckUtils]: 4: Hoare triple {6431#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {6431#true} is VALID [2018-11-23 13:14:12,082 INFO L273 TraceCheckUtils]: 5: Hoare triple {6431#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {6451#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-23 13:14:12,083 INFO L273 TraceCheckUtils]: 6: Hoare triple {6451#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6455#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-23 13:14:12,083 INFO L273 TraceCheckUtils]: 7: Hoare triple {6455#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6459#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} is VALID [2018-11-23 13:14:12,084 INFO L273 TraceCheckUtils]: 8: Hoare triple {6459#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6463#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-23 13:14:12,084 INFO L273 TraceCheckUtils]: 9: Hoare triple {6463#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6467#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-23 13:14:12,085 INFO L273 TraceCheckUtils]: 10: Hoare triple {6467#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6471#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-23 13:14:12,085 INFO L273 TraceCheckUtils]: 11: Hoare triple {6471#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6475#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-23 13:14:12,086 INFO L273 TraceCheckUtils]: 12: Hoare triple {6475#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6479#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-23 13:14:12,086 INFO L273 TraceCheckUtils]: 13: Hoare triple {6479#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6483#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-23 13:14:12,087 INFO L273 TraceCheckUtils]: 14: Hoare triple {6483#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6487#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-23 13:14:12,088 INFO L273 TraceCheckUtils]: 15: Hoare triple {6487#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6491#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-23 13:14:12,089 INFO L273 TraceCheckUtils]: 16: Hoare triple {6491#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6495#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-23 13:14:12,089 INFO L273 TraceCheckUtils]: 17: Hoare triple {6495#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6499#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-23 13:14:12,090 INFO L273 TraceCheckUtils]: 18: Hoare triple {6499#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6503#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} is VALID [2018-11-23 13:14:12,091 INFO L273 TraceCheckUtils]: 19: Hoare triple {6503#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6507#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-23 13:14:12,092 INFO L273 TraceCheckUtils]: 20: Hoare triple {6507#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6511#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} is VALID [2018-11-23 13:14:12,092 INFO L273 TraceCheckUtils]: 21: Hoare triple {6511#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6515#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-23 13:14:12,093 INFO L273 TraceCheckUtils]: 22: Hoare triple {6515#(and (= main_~i~0 9) (= main_~sum~0 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6519#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} is VALID [2018-11-23 13:14:12,094 INFO L273 TraceCheckUtils]: 23: Hoare triple {6519#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6523#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-23 13:14:12,095 INFO L273 TraceCheckUtils]: 24: Hoare triple {6523#(and (= main_~sum~0 45) (= main_~i~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6527#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} is VALID [2018-11-23 13:14:12,096 INFO L273 TraceCheckUtils]: 25: Hoare triple {6527#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6531#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-23 13:14:12,096 INFO L273 TraceCheckUtils]: 26: Hoare triple {6531#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6535#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} is VALID [2018-11-23 13:14:12,097 INFO L273 TraceCheckUtils]: 27: Hoare triple {6535#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6539#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-23 13:14:12,098 INFO L273 TraceCheckUtils]: 28: Hoare triple {6539#(and (= main_~i~0 12) (= main_~sum~0 66))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6543#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} is VALID [2018-11-23 13:14:12,099 INFO L273 TraceCheckUtils]: 29: Hoare triple {6543#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6547#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-23 13:14:12,099 INFO L273 TraceCheckUtils]: 30: Hoare triple {6547#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6551#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2018-11-23 13:14:12,100 INFO L273 TraceCheckUtils]: 31: Hoare triple {6551#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6555#(and (= main_~i~0 14) (= main_~sum~0 91))} is VALID [2018-11-23 13:14:12,101 INFO L273 TraceCheckUtils]: 32: Hoare triple {6555#(and (= main_~i~0 14) (= main_~sum~0 91))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6559#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} is VALID [2018-11-23 13:14:12,102 INFO L273 TraceCheckUtils]: 33: Hoare triple {6559#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6563#(and (= main_~sum~0 105) (= main_~i~0 15))} is VALID [2018-11-23 13:14:12,102 INFO L273 TraceCheckUtils]: 34: Hoare triple {6563#(and (= main_~sum~0 105) (= main_~i~0 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6567#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} is VALID [2018-11-23 13:14:12,103 INFO L273 TraceCheckUtils]: 35: Hoare triple {6567#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6571#(and (= main_~sum~0 120) (= main_~i~0 16))} is VALID [2018-11-23 13:14:12,104 INFO L273 TraceCheckUtils]: 36: Hoare triple {6571#(and (= main_~sum~0 120) (= main_~i~0 16))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6575#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} is VALID [2018-11-23 13:14:12,105 INFO L273 TraceCheckUtils]: 37: Hoare triple {6575#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6579#(and (= main_~i~0 17) (= main_~sum~0 136))} is VALID [2018-11-23 13:14:12,105 INFO L273 TraceCheckUtils]: 38: Hoare triple {6579#(and (= main_~i~0 17) (= main_~sum~0 136))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6583#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} is VALID [2018-11-23 13:14:12,106 INFO L273 TraceCheckUtils]: 39: Hoare triple {6583#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6587#(and (= main_~i~0 18) (= main_~sum~0 153))} is VALID [2018-11-23 13:14:12,107 INFO L273 TraceCheckUtils]: 40: Hoare triple {6587#(and (= main_~i~0 18) (= main_~sum~0 153))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6591#(and (= main_~i~0 18) (= main_~sum~0 (+ main_~i~0 153)))} is VALID [2018-11-23 13:14:12,108 INFO L273 TraceCheckUtils]: 41: Hoare triple {6591#(and (= main_~i~0 18) (= main_~sum~0 (+ main_~i~0 153)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6595#(and (= main_~i~0 19) (= main_~sum~0 171))} is VALID [2018-11-23 13:14:12,108 INFO L273 TraceCheckUtils]: 42: Hoare triple {6595#(and (= main_~i~0 19) (= main_~sum~0 171))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6599#(and (= (+ main_~i~0 171) main_~sum~0) (= main_~i~0 19))} is VALID [2018-11-23 13:14:12,109 INFO L273 TraceCheckUtils]: 43: Hoare triple {6599#(and (= (+ main_~i~0 171) main_~sum~0) (= main_~i~0 19))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6603#(and (= main_~i~0 20) (= main_~sum~0 190))} is VALID [2018-11-23 13:14:12,110 INFO L273 TraceCheckUtils]: 44: Hoare triple {6603#(and (= main_~i~0 20) (= main_~sum~0 190))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6607#(and (= main_~i~0 20) (= main_~sum~0 (+ main_~i~0 190)))} is VALID [2018-11-23 13:14:12,111 INFO L273 TraceCheckUtils]: 45: Hoare triple {6607#(and (= main_~i~0 20) (= main_~sum~0 (+ main_~i~0 190)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6611#(and (= main_~i~0 21) (= main_~sum~0 210))} is VALID [2018-11-23 13:14:12,111 INFO L273 TraceCheckUtils]: 46: Hoare triple {6611#(and (= main_~i~0 21) (= main_~sum~0 210))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6615#(and (= main_~sum~0 (+ main_~i~0 210)) (<= main_~i~0 main_~n~0) (= main_~i~0 21))} is VALID [2018-11-23 13:14:12,112 INFO L273 TraceCheckUtils]: 47: Hoare triple {6615#(and (= main_~sum~0 (+ main_~i~0 210)) (<= main_~i~0 main_~n~0) (= main_~i~0 21))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6619#(and (<= 21 main_~n~0) (= main_~sum~0 231) (<= main_~i~0 22))} is VALID [2018-11-23 13:14:12,113 INFO L273 TraceCheckUtils]: 48: Hoare triple {6619#(and (<= 21 main_~n~0) (= main_~sum~0 231) (<= main_~i~0 22))} assume !(~i~0 <= ~n~0); {6623#(and (<= 21 main_~n~0) (= main_~sum~0 231) (<= main_~n~0 21))} is VALID [2018-11-23 13:14:12,114 INFO L256 TraceCheckUtils]: 49: Hoare triple {6623#(and (<= 21 main_~n~0) (= main_~sum~0 231) (<= main_~n~0 21))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {6627#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:14:12,115 INFO L273 TraceCheckUtils]: 50: Hoare triple {6627#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {6631#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:14:12,116 INFO L273 TraceCheckUtils]: 51: Hoare triple {6631#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6432#false} is VALID [2018-11-23 13:14:12,116 INFO L273 TraceCheckUtils]: 52: Hoare triple {6432#false} assume !false; {6432#false} is VALID [2018-11-23 13:14:12,122 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:14:12,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:14:12,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-11-23 13:14:12,141 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 53 [2018-11-23 13:14:12,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:14:12,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 13:14:12,189 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:14:12,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 13:14:12,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 13:14:12,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=2162, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 13:14:12,191 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 48 states. [2018-11-23 13:14:16,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:16,719 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-11-23 13:14:16,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 13:14:16,719 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 53 [2018-11-23 13:14:16,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:14:16,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 13:14:16,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2018-11-23 13:14:16,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 13:14:16,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2018-11-23 13:14:16,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 61 transitions. [2018-11-23 13:14:17,023 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:14:17,024 INFO L225 Difference]: With dead ends: 61 [2018-11-23 13:14:17,024 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 13:14:17,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=102, Invalid=2348, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 13:14:17,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 13:14:17,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-23 13:14:17,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:14:17,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 56 states. [2018-11-23 13:14:17,244 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-23 13:14:17,244 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-23 13:14:17,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:17,245 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-11-23 13:14:17,245 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-11-23 13:14:17,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:17,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:17,246 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-23 13:14:17,246 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-23 13:14:17,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:17,247 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-11-23 13:14:17,247 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-11-23 13:14:17,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:17,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:17,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:14:17,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:14:17,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 13:14:17,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-11-23 13:14:17,248 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2018-11-23 13:14:17,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:14:17,248 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-11-23 13:14:17,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 13:14:17,248 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-11-23 13:14:17,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 13:14:17,249 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:14:17,249 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:14:17,249 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:14:17,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:14:17,250 INFO L82 PathProgramCache]: Analyzing trace with hash -417727021, now seen corresponding path program 22 times [2018-11-23 13:14:17,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:14:17,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:14:17,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:17,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:14:17,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:17,259 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:14:17,259 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:14:17,259 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:17,293 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:14:17,323 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:14:17,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:14:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:17,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:19,054 INFO L256 TraceCheckUtils]: 0: Hoare triple {6930#true} call ULTIMATE.init(); {6930#true} is VALID [2018-11-23 13:14:19,055 INFO L273 TraceCheckUtils]: 1: Hoare triple {6930#true} assume true; {6930#true} is VALID [2018-11-23 13:14:19,055 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6930#true} {6930#true} #37#return; {6930#true} is VALID [2018-11-23 13:14:19,055 INFO L256 TraceCheckUtils]: 3: Hoare triple {6930#true} call #t~ret3 := main(); {6930#true} is VALID [2018-11-23 13:14:19,055 INFO L273 TraceCheckUtils]: 4: Hoare triple {6930#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {6930#true} is VALID [2018-11-23 13:14:19,056 INFO L273 TraceCheckUtils]: 5: Hoare triple {6930#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {6950#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-23 13:14:19,056 INFO L273 TraceCheckUtils]: 6: Hoare triple {6950#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6954#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-23 13:14:19,057 INFO L273 TraceCheckUtils]: 7: Hoare triple {6954#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6958#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2018-11-23 13:14:19,057 INFO L273 TraceCheckUtils]: 8: Hoare triple {6958#(and (= main_~i~0 2) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6962#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-23 13:14:19,058 INFO L273 TraceCheckUtils]: 9: Hoare triple {6962#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6966#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-23 13:14:19,058 INFO L273 TraceCheckUtils]: 10: Hoare triple {6966#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6970#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-23 13:14:19,059 INFO L273 TraceCheckUtils]: 11: Hoare triple {6970#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6974#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-23 13:14:19,059 INFO L273 TraceCheckUtils]: 12: Hoare triple {6974#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6978#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-23 13:14:19,060 INFO L273 TraceCheckUtils]: 13: Hoare triple {6978#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6982#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-23 13:14:19,060 INFO L273 TraceCheckUtils]: 14: Hoare triple {6982#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6986#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-23 13:14:19,061 INFO L273 TraceCheckUtils]: 15: Hoare triple {6986#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6990#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-23 13:14:19,062 INFO L273 TraceCheckUtils]: 16: Hoare triple {6990#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6994#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-23 13:14:19,062 INFO L273 TraceCheckUtils]: 17: Hoare triple {6994#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6998#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-23 13:14:19,063 INFO L273 TraceCheckUtils]: 18: Hoare triple {6998#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7002#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} is VALID [2018-11-23 13:14:19,064 INFO L273 TraceCheckUtils]: 19: Hoare triple {7002#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7006#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-23 13:14:19,065 INFO L273 TraceCheckUtils]: 20: Hoare triple {7006#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7010#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} is VALID [2018-11-23 13:14:19,065 INFO L273 TraceCheckUtils]: 21: Hoare triple {7010#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7014#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-23 13:14:19,066 INFO L273 TraceCheckUtils]: 22: Hoare triple {7014#(and (= main_~i~0 9) (= main_~sum~0 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7018#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} is VALID [2018-11-23 13:14:19,067 INFO L273 TraceCheckUtils]: 23: Hoare triple {7018#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7022#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-23 13:14:19,068 INFO L273 TraceCheckUtils]: 24: Hoare triple {7022#(and (= main_~sum~0 45) (= main_~i~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7026#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} is VALID [2018-11-23 13:14:19,068 INFO L273 TraceCheckUtils]: 25: Hoare triple {7026#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7030#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-23 13:14:19,069 INFO L273 TraceCheckUtils]: 26: Hoare triple {7030#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7034#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} is VALID [2018-11-23 13:14:19,070 INFO L273 TraceCheckUtils]: 27: Hoare triple {7034#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7038#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-23 13:14:19,071 INFO L273 TraceCheckUtils]: 28: Hoare triple {7038#(and (= main_~i~0 12) (= main_~sum~0 66))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7042#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} is VALID [2018-11-23 13:14:19,072 INFO L273 TraceCheckUtils]: 29: Hoare triple {7042#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7046#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-23 13:14:19,072 INFO L273 TraceCheckUtils]: 30: Hoare triple {7046#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7050#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2018-11-23 13:14:19,073 INFO L273 TraceCheckUtils]: 31: Hoare triple {7050#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7054#(and (= main_~i~0 14) (= main_~sum~0 91))} is VALID [2018-11-23 13:14:19,074 INFO L273 TraceCheckUtils]: 32: Hoare triple {7054#(and (= main_~i~0 14) (= main_~sum~0 91))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7058#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} is VALID [2018-11-23 13:14:19,075 INFO L273 TraceCheckUtils]: 33: Hoare triple {7058#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7062#(and (= main_~sum~0 105) (= main_~i~0 15))} is VALID [2018-11-23 13:14:19,075 INFO L273 TraceCheckUtils]: 34: Hoare triple {7062#(and (= main_~sum~0 105) (= main_~i~0 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7066#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} is VALID [2018-11-23 13:14:19,076 INFO L273 TraceCheckUtils]: 35: Hoare triple {7066#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7070#(and (= main_~sum~0 120) (= main_~i~0 16))} is VALID [2018-11-23 13:14:19,077 INFO L273 TraceCheckUtils]: 36: Hoare triple {7070#(and (= main_~sum~0 120) (= main_~i~0 16))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7074#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} is VALID [2018-11-23 13:14:19,077 INFO L273 TraceCheckUtils]: 37: Hoare triple {7074#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7078#(and (= main_~i~0 17) (= main_~sum~0 136))} is VALID [2018-11-23 13:14:19,078 INFO L273 TraceCheckUtils]: 38: Hoare triple {7078#(and (= main_~i~0 17) (= main_~sum~0 136))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7082#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} is VALID [2018-11-23 13:14:19,079 INFO L273 TraceCheckUtils]: 39: Hoare triple {7082#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7086#(and (= main_~i~0 18) (= main_~sum~0 153))} is VALID [2018-11-23 13:14:19,080 INFO L273 TraceCheckUtils]: 40: Hoare triple {7086#(and (= main_~i~0 18) (= main_~sum~0 153))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7090#(and (= main_~i~0 18) (= main_~sum~0 (+ main_~i~0 153)))} is VALID [2018-11-23 13:14:19,081 INFO L273 TraceCheckUtils]: 41: Hoare triple {7090#(and (= main_~i~0 18) (= main_~sum~0 (+ main_~i~0 153)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7094#(and (= main_~i~0 19) (= main_~sum~0 171))} is VALID [2018-11-23 13:14:19,081 INFO L273 TraceCheckUtils]: 42: Hoare triple {7094#(and (= main_~i~0 19) (= main_~sum~0 171))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7098#(and (= (+ main_~i~0 171) main_~sum~0) (= main_~i~0 19))} is VALID [2018-11-23 13:14:19,082 INFO L273 TraceCheckUtils]: 43: Hoare triple {7098#(and (= (+ main_~i~0 171) main_~sum~0) (= main_~i~0 19))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7102#(and (= main_~i~0 20) (= main_~sum~0 190))} is VALID [2018-11-23 13:14:19,083 INFO L273 TraceCheckUtils]: 44: Hoare triple {7102#(and (= main_~i~0 20) (= main_~sum~0 190))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7106#(and (= main_~i~0 20) (= main_~sum~0 (+ main_~i~0 190)))} is VALID [2018-11-23 13:14:19,084 INFO L273 TraceCheckUtils]: 45: Hoare triple {7106#(and (= main_~i~0 20) (= main_~sum~0 (+ main_~i~0 190)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7110#(and (= main_~i~0 21) (= main_~sum~0 210))} is VALID [2018-11-23 13:14:19,084 INFO L273 TraceCheckUtils]: 46: Hoare triple {7110#(and (= main_~i~0 21) (= main_~sum~0 210))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7114#(and (= main_~sum~0 (+ main_~i~0 210)) (= main_~i~0 21))} is VALID [2018-11-23 13:14:19,085 INFO L273 TraceCheckUtils]: 47: Hoare triple {7114#(and (= main_~sum~0 (+ main_~i~0 210)) (= main_~i~0 21))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7118#(and (= main_~sum~0 231) (= main_~i~0 22))} is VALID [2018-11-23 13:14:19,086 INFO L273 TraceCheckUtils]: 48: Hoare triple {7118#(and (= main_~sum~0 231) (= main_~i~0 22))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7122#(and (= (+ main_~i~0 231) main_~sum~0) (<= main_~i~0 main_~n~0) (= main_~i~0 22))} is VALID [2018-11-23 13:14:19,087 INFO L273 TraceCheckUtils]: 49: Hoare triple {7122#(and (= (+ main_~i~0 231) main_~sum~0) (<= main_~i~0 main_~n~0) (= main_~i~0 22))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7126#(and (<= main_~i~0 23) (<= 22 main_~n~0) (= main_~sum~0 253))} is VALID [2018-11-23 13:14:19,088 INFO L273 TraceCheckUtils]: 50: Hoare triple {7126#(and (<= main_~i~0 23) (<= 22 main_~n~0) (= main_~sum~0 253))} assume !(~i~0 <= ~n~0); {7130#(and (<= main_~n~0 22) (<= 22 main_~n~0) (= main_~sum~0 253))} is VALID [2018-11-23 13:14:19,089 INFO L256 TraceCheckUtils]: 51: Hoare triple {7130#(and (<= main_~n~0 22) (<= 22 main_~n~0) (= main_~sum~0 253))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {7134#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:14:19,089 INFO L273 TraceCheckUtils]: 52: Hoare triple {7134#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {7138#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:14:19,090 INFO L273 TraceCheckUtils]: 53: Hoare triple {7138#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6931#false} is VALID [2018-11-23 13:14:19,090 INFO L273 TraceCheckUtils]: 54: Hoare triple {6931#false} assume !false; {6931#false} is VALID [2018-11-23 13:14:19,097 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:14:19,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:14:19,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-11-23 13:14:19,118 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 55 [2018-11-23 13:14:19,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:14:19,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states. [2018-11-23 13:14:19,190 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:14:19,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-23 13:14:19,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-23 13:14:19,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=2352, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 13:14:19,192 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 50 states. [2018-11-23 13:14:24,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:24,128 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-11-23 13:14:24,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-23 13:14:24,128 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 55 [2018-11-23 13:14:24,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:14:24,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 13:14:24,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2018-11-23 13:14:24,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 13:14:24,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2018-11-23 13:14:24,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states and 63 transitions. [2018-11-23 13:14:24,195 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:14:24,197 INFO L225 Difference]: With dead ends: 63 [2018-11-23 13:14:24,197 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 13:14:24,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=106, Invalid=2546, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 13:14:24,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 13:14:24,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-23 13:14:24,278 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:14:24,278 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2018-11-23 13:14:24,278 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 13:14:24,279 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 13:14:24,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:24,280 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-11-23 13:14:24,280 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-11-23 13:14:24,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:24,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:24,281 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 13:14:24,281 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 13:14:24,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:24,282 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-11-23 13:14:24,283 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-11-23 13:14:24,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:24,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:24,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:14:24,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:14:24,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 13:14:24,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-11-23 13:14:24,284 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2018-11-23 13:14:24,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:14:24,285 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-11-23 13:14:24,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-23 13:14:24,285 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-11-23 13:14:24,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 13:14:24,286 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:14:24,286 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:14:24,286 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:14:24,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:14:24,286 INFO L82 PathProgramCache]: Analyzing trace with hash -868347759, now seen corresponding path program 23 times [2018-11-23 13:14:24,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:14:24,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:14:24,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:24,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:14:24,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:24,296 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:14:24,296 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:14:24,296 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:24,315 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:14:24,365 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-23 13:14:24,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:14:24,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:24,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:26,106 INFO L256 TraceCheckUtils]: 0: Hoare triple {7447#true} call ULTIMATE.init(); {7447#true} is VALID [2018-11-23 13:14:26,106 INFO L273 TraceCheckUtils]: 1: Hoare triple {7447#true} assume true; {7447#true} is VALID [2018-11-23 13:14:26,106 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7447#true} {7447#true} #37#return; {7447#true} is VALID [2018-11-23 13:14:26,106 INFO L256 TraceCheckUtils]: 3: Hoare triple {7447#true} call #t~ret3 := main(); {7447#true} is VALID [2018-11-23 13:14:26,107 INFO L273 TraceCheckUtils]: 4: Hoare triple {7447#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {7447#true} is VALID [2018-11-23 13:14:26,107 INFO L273 TraceCheckUtils]: 5: Hoare triple {7447#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {7467#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-23 13:14:26,108 INFO L273 TraceCheckUtils]: 6: Hoare triple {7467#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7471#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-23 13:14:26,128 INFO L273 TraceCheckUtils]: 7: Hoare triple {7471#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7475#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} is VALID [2018-11-23 13:14:26,141 INFO L273 TraceCheckUtils]: 8: Hoare triple {7475#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7479#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-23 13:14:26,156 INFO L273 TraceCheckUtils]: 9: Hoare triple {7479#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7483#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-23 13:14:26,164 INFO L273 TraceCheckUtils]: 10: Hoare triple {7483#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7487#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-23 13:14:26,178 INFO L273 TraceCheckUtils]: 11: Hoare triple {7487#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7491#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-23 13:14:26,178 INFO L273 TraceCheckUtils]: 12: Hoare triple {7491#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7495#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-23 13:14:26,194 INFO L273 TraceCheckUtils]: 13: Hoare triple {7495#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7499#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-23 13:14:26,203 INFO L273 TraceCheckUtils]: 14: Hoare triple {7499#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7503#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-23 13:14:26,215 INFO L273 TraceCheckUtils]: 15: Hoare triple {7503#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7507#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-23 13:14:26,216 INFO L273 TraceCheckUtils]: 16: Hoare triple {7507#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7511#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-23 13:14:26,217 INFO L273 TraceCheckUtils]: 17: Hoare triple {7511#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7515#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-23 13:14:26,217 INFO L273 TraceCheckUtils]: 18: Hoare triple {7515#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7519#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} is VALID [2018-11-23 13:14:26,218 INFO L273 TraceCheckUtils]: 19: Hoare triple {7519#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7523#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-23 13:14:26,218 INFO L273 TraceCheckUtils]: 20: Hoare triple {7523#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7527#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} is VALID [2018-11-23 13:14:26,219 INFO L273 TraceCheckUtils]: 21: Hoare triple {7527#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7531#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-23 13:14:26,220 INFO L273 TraceCheckUtils]: 22: Hoare triple {7531#(and (= main_~i~0 9) (= main_~sum~0 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7535#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} is VALID [2018-11-23 13:14:26,220 INFO L273 TraceCheckUtils]: 23: Hoare triple {7535#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7539#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-23 13:14:26,221 INFO L273 TraceCheckUtils]: 24: Hoare triple {7539#(and (= main_~sum~0 45) (= main_~i~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7543#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} is VALID [2018-11-23 13:14:26,222 INFO L273 TraceCheckUtils]: 25: Hoare triple {7543#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7547#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-23 13:14:26,223 INFO L273 TraceCheckUtils]: 26: Hoare triple {7547#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7551#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} is VALID [2018-11-23 13:14:26,223 INFO L273 TraceCheckUtils]: 27: Hoare triple {7551#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7555#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-23 13:14:26,224 INFO L273 TraceCheckUtils]: 28: Hoare triple {7555#(and (= main_~i~0 12) (= main_~sum~0 66))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7559#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} is VALID [2018-11-23 13:14:26,225 INFO L273 TraceCheckUtils]: 29: Hoare triple {7559#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7563#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-23 13:14:26,226 INFO L273 TraceCheckUtils]: 30: Hoare triple {7563#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7567#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2018-11-23 13:14:26,226 INFO L273 TraceCheckUtils]: 31: Hoare triple {7567#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7571#(and (= main_~i~0 14) (= main_~sum~0 91))} is VALID [2018-11-23 13:14:26,227 INFO L273 TraceCheckUtils]: 32: Hoare triple {7571#(and (= main_~i~0 14) (= main_~sum~0 91))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7575#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} is VALID [2018-11-23 13:14:26,228 INFO L273 TraceCheckUtils]: 33: Hoare triple {7575#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7579#(and (= main_~sum~0 105) (= main_~i~0 15))} is VALID [2018-11-23 13:14:26,229 INFO L273 TraceCheckUtils]: 34: Hoare triple {7579#(and (= main_~sum~0 105) (= main_~i~0 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7583#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} is VALID [2018-11-23 13:14:26,229 INFO L273 TraceCheckUtils]: 35: Hoare triple {7583#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7587#(and (= main_~sum~0 120) (= main_~i~0 16))} is VALID [2018-11-23 13:14:26,230 INFO L273 TraceCheckUtils]: 36: Hoare triple {7587#(and (= main_~sum~0 120) (= main_~i~0 16))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7591#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} is VALID [2018-11-23 13:14:26,231 INFO L273 TraceCheckUtils]: 37: Hoare triple {7591#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7595#(and (= main_~i~0 17) (= main_~sum~0 136))} is VALID [2018-11-23 13:14:26,232 INFO L273 TraceCheckUtils]: 38: Hoare triple {7595#(and (= main_~i~0 17) (= main_~sum~0 136))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7599#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} is VALID [2018-11-23 13:14:26,232 INFO L273 TraceCheckUtils]: 39: Hoare triple {7599#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7603#(and (= main_~i~0 18) (= main_~sum~0 153))} is VALID [2018-11-23 13:14:26,233 INFO L273 TraceCheckUtils]: 40: Hoare triple {7603#(and (= main_~i~0 18) (= main_~sum~0 153))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7607#(and (= main_~i~0 18) (= main_~sum~0 (+ main_~i~0 153)))} is VALID [2018-11-23 13:14:26,234 INFO L273 TraceCheckUtils]: 41: Hoare triple {7607#(and (= main_~i~0 18) (= main_~sum~0 (+ main_~i~0 153)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7611#(and (= main_~i~0 19) (= main_~sum~0 171))} is VALID [2018-11-23 13:14:26,235 INFO L273 TraceCheckUtils]: 42: Hoare triple {7611#(and (= main_~i~0 19) (= main_~sum~0 171))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7615#(and (= (+ main_~i~0 171) main_~sum~0) (= main_~i~0 19))} is VALID [2018-11-23 13:14:26,235 INFO L273 TraceCheckUtils]: 43: Hoare triple {7615#(and (= (+ main_~i~0 171) main_~sum~0) (= main_~i~0 19))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7619#(and (= main_~i~0 20) (= main_~sum~0 190))} is VALID [2018-11-23 13:14:26,236 INFO L273 TraceCheckUtils]: 44: Hoare triple {7619#(and (= main_~i~0 20) (= main_~sum~0 190))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7623#(and (= main_~i~0 20) (= main_~sum~0 (+ main_~i~0 190)))} is VALID [2018-11-23 13:14:26,237 INFO L273 TraceCheckUtils]: 45: Hoare triple {7623#(and (= main_~i~0 20) (= main_~sum~0 (+ main_~i~0 190)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7627#(and (= main_~i~0 21) (= main_~sum~0 210))} is VALID [2018-11-23 13:14:26,238 INFO L273 TraceCheckUtils]: 46: Hoare triple {7627#(and (= main_~i~0 21) (= main_~sum~0 210))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7631#(and (= main_~sum~0 (+ main_~i~0 210)) (= main_~i~0 21))} is VALID [2018-11-23 13:14:26,238 INFO L273 TraceCheckUtils]: 47: Hoare triple {7631#(and (= main_~sum~0 (+ main_~i~0 210)) (= main_~i~0 21))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7635#(and (= main_~sum~0 231) (= main_~i~0 22))} is VALID [2018-11-23 13:14:26,239 INFO L273 TraceCheckUtils]: 48: Hoare triple {7635#(and (= main_~sum~0 231) (= main_~i~0 22))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7639#(and (= (+ main_~i~0 231) main_~sum~0) (= main_~i~0 22))} is VALID [2018-11-23 13:14:26,240 INFO L273 TraceCheckUtils]: 49: Hoare triple {7639#(and (= (+ main_~i~0 231) main_~sum~0) (= main_~i~0 22))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7643#(and (= main_~i~0 23) (= main_~sum~0 253))} is VALID [2018-11-23 13:14:26,241 INFO L273 TraceCheckUtils]: 50: Hoare triple {7643#(and (= main_~i~0 23) (= main_~sum~0 253))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7647#(and (= main_~i~0 23) (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 253)))} is VALID [2018-11-23 13:14:26,242 INFO L273 TraceCheckUtils]: 51: Hoare triple {7647#(and (= main_~i~0 23) (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 253)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7651#(and (= main_~sum~0 276) (<= 23 main_~n~0) (<= main_~i~0 24))} is VALID [2018-11-23 13:14:26,242 INFO L273 TraceCheckUtils]: 52: Hoare triple {7651#(and (= main_~sum~0 276) (<= 23 main_~n~0) (<= main_~i~0 24))} assume !(~i~0 <= ~n~0); {7655#(and (= main_~sum~0 276) (<= 23 main_~n~0) (<= main_~n~0 23))} is VALID [2018-11-23 13:14:26,244 INFO L256 TraceCheckUtils]: 53: Hoare triple {7655#(and (= main_~sum~0 276) (<= 23 main_~n~0) (<= main_~n~0 23))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {7659#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:14:26,244 INFO L273 TraceCheckUtils]: 54: Hoare triple {7659#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {7663#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:14:26,245 INFO L273 TraceCheckUtils]: 55: Hoare triple {7663#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7448#false} is VALID [2018-11-23 13:14:26,245 INFO L273 TraceCheckUtils]: 56: Hoare triple {7448#false} assume !false; {7448#false} is VALID [2018-11-23 13:14:26,252 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:14:26,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:14:26,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-11-23 13:14:26,271 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 57 [2018-11-23 13:14:26,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:14:26,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states. [2018-11-23 13:14:26,327 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:14:26,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-23 13:14:26,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-23 13:14:26,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=2550, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 13:14:26,329 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 52 states. [2018-11-23 13:14:31,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:31,588 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-11-23 13:14:31,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-23 13:14:31,588 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 57 [2018-11-23 13:14:31,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:14:31,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 13:14:31,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2018-11-23 13:14:31,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 13:14:31,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2018-11-23 13:14:31,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 65 transitions. [2018-11-23 13:14:31,653 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:31,654 INFO L225 Difference]: With dead ends: 65 [2018-11-23 13:14:31,654 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 13:14:31,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=110, Invalid=2752, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 13:14:31,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 13:14:31,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-23 13:14:31,706 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:14:31,706 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 60 states. [2018-11-23 13:14:31,706 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-23 13:14:31,707 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-23 13:14:31,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:31,708 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-11-23 13:14:31,708 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-11-23 13:14:31,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:31,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:31,709 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-23 13:14:31,709 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-23 13:14:31,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:31,710 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-11-23 13:14:31,710 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-11-23 13:14:31,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:31,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:31,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:14:31,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:14:31,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 13:14:31,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-11-23 13:14:31,712 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2018-11-23 13:14:31,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:14:31,712 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-11-23 13:14:31,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-23 13:14:31,712 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-11-23 13:14:31,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 13:14:31,713 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:14:31,713 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:14:31,713 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:14:31,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:14:31,714 INFO L82 PathProgramCache]: Analyzing trace with hash -123180081, now seen corresponding path program 24 times [2018-11-23 13:14:31,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:14:31,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:14:31,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:31,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:14:31,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:31,723 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:14:31,723 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:14:31,723 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:31,741 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:14:31,818 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-11-23 13:14:31,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:14:31,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:31,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:33,647 INFO L256 TraceCheckUtils]: 0: Hoare triple {7982#true} call ULTIMATE.init(); {7982#true} is VALID [2018-11-23 13:14:33,647 INFO L273 TraceCheckUtils]: 1: Hoare triple {7982#true} assume true; {7982#true} is VALID [2018-11-23 13:14:33,647 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7982#true} {7982#true} #37#return; {7982#true} is VALID [2018-11-23 13:14:33,648 INFO L256 TraceCheckUtils]: 3: Hoare triple {7982#true} call #t~ret3 := main(); {7982#true} is VALID [2018-11-23 13:14:33,648 INFO L273 TraceCheckUtils]: 4: Hoare triple {7982#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {7982#true} is VALID [2018-11-23 13:14:33,648 INFO L273 TraceCheckUtils]: 5: Hoare triple {7982#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {8002#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-23 13:14:33,649 INFO L273 TraceCheckUtils]: 6: Hoare triple {8002#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8006#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-23 13:14:33,650 INFO L273 TraceCheckUtils]: 7: Hoare triple {8006#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8010#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2018-11-23 13:14:33,651 INFO L273 TraceCheckUtils]: 8: Hoare triple {8010#(and (= main_~i~0 2) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8014#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-23 13:14:33,651 INFO L273 TraceCheckUtils]: 9: Hoare triple {8014#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8018#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-23 13:14:33,652 INFO L273 TraceCheckUtils]: 10: Hoare triple {8018#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8022#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-23 13:14:33,653 INFO L273 TraceCheckUtils]: 11: Hoare triple {8022#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8026#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-23 13:14:33,654 INFO L273 TraceCheckUtils]: 12: Hoare triple {8026#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8030#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-23 13:14:33,655 INFO L273 TraceCheckUtils]: 13: Hoare triple {8030#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8034#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-23 13:14:33,655 INFO L273 TraceCheckUtils]: 14: Hoare triple {8034#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8038#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-23 13:14:33,656 INFO L273 TraceCheckUtils]: 15: Hoare triple {8038#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8042#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-23 13:14:33,657 INFO L273 TraceCheckUtils]: 16: Hoare triple {8042#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8046#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-23 13:14:33,658 INFO L273 TraceCheckUtils]: 17: Hoare triple {8046#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8050#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-23 13:14:33,662 INFO L273 TraceCheckUtils]: 18: Hoare triple {8050#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8054#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} is VALID [2018-11-23 13:14:33,663 INFO L273 TraceCheckUtils]: 19: Hoare triple {8054#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8058#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-23 13:14:33,663 INFO L273 TraceCheckUtils]: 20: Hoare triple {8058#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8062#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} is VALID [2018-11-23 13:14:33,664 INFO L273 TraceCheckUtils]: 21: Hoare triple {8062#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8066#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-23 13:14:33,664 INFO L273 TraceCheckUtils]: 22: Hoare triple {8066#(and (= main_~i~0 9) (= main_~sum~0 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8070#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} is VALID [2018-11-23 13:14:33,665 INFO L273 TraceCheckUtils]: 23: Hoare triple {8070#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8074#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-23 13:14:33,665 INFO L273 TraceCheckUtils]: 24: Hoare triple {8074#(and (= main_~sum~0 45) (= main_~i~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8078#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} is VALID [2018-11-23 13:14:33,666 INFO L273 TraceCheckUtils]: 25: Hoare triple {8078#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8082#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-23 13:14:33,667 INFO L273 TraceCheckUtils]: 26: Hoare triple {8082#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8086#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} is VALID [2018-11-23 13:14:33,668 INFO L273 TraceCheckUtils]: 27: Hoare triple {8086#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8090#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-23 13:14:33,668 INFO L273 TraceCheckUtils]: 28: Hoare triple {8090#(and (= main_~i~0 12) (= main_~sum~0 66))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8094#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} is VALID [2018-11-23 13:14:33,669 INFO L273 TraceCheckUtils]: 29: Hoare triple {8094#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8098#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-23 13:14:33,670 INFO L273 TraceCheckUtils]: 30: Hoare triple {8098#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8102#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2018-11-23 13:14:33,670 INFO L273 TraceCheckUtils]: 31: Hoare triple {8102#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8106#(and (= main_~i~0 14) (= main_~sum~0 91))} is VALID [2018-11-23 13:14:33,671 INFO L273 TraceCheckUtils]: 32: Hoare triple {8106#(and (= main_~i~0 14) (= main_~sum~0 91))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8110#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} is VALID [2018-11-23 13:14:33,676 INFO L273 TraceCheckUtils]: 33: Hoare triple {8110#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8114#(and (= main_~sum~0 105) (= main_~i~0 15))} is VALID [2018-11-23 13:14:33,677 INFO L273 TraceCheckUtils]: 34: Hoare triple {8114#(and (= main_~sum~0 105) (= main_~i~0 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8118#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} is VALID [2018-11-23 13:14:33,680 INFO L273 TraceCheckUtils]: 35: Hoare triple {8118#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8122#(and (= main_~sum~0 120) (= main_~i~0 16))} is VALID [2018-11-23 13:14:33,680 INFO L273 TraceCheckUtils]: 36: Hoare triple {8122#(and (= main_~sum~0 120) (= main_~i~0 16))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8126#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} is VALID [2018-11-23 13:14:33,682 INFO L273 TraceCheckUtils]: 37: Hoare triple {8126#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8130#(and (= main_~i~0 17) (= main_~sum~0 136))} is VALID [2018-11-23 13:14:33,682 INFO L273 TraceCheckUtils]: 38: Hoare triple {8130#(and (= main_~i~0 17) (= main_~sum~0 136))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8134#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} is VALID [2018-11-23 13:14:33,684 INFO L273 TraceCheckUtils]: 39: Hoare triple {8134#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8138#(and (= main_~i~0 18) (= main_~sum~0 153))} is VALID [2018-11-23 13:14:33,684 INFO L273 TraceCheckUtils]: 40: Hoare triple {8138#(and (= main_~i~0 18) (= main_~sum~0 153))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8142#(and (= main_~i~0 18) (= main_~sum~0 (+ main_~i~0 153)))} is VALID [2018-11-23 13:14:33,686 INFO L273 TraceCheckUtils]: 41: Hoare triple {8142#(and (= main_~i~0 18) (= main_~sum~0 (+ main_~i~0 153)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8146#(and (= main_~i~0 19) (= main_~sum~0 171))} is VALID [2018-11-23 13:14:33,686 INFO L273 TraceCheckUtils]: 42: Hoare triple {8146#(and (= main_~i~0 19) (= main_~sum~0 171))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8150#(and (= (+ main_~i~0 171) main_~sum~0) (= main_~i~0 19))} is VALID [2018-11-23 13:14:33,692 INFO L273 TraceCheckUtils]: 43: Hoare triple {8150#(and (= (+ main_~i~0 171) main_~sum~0) (= main_~i~0 19))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8154#(and (= main_~i~0 20) (= main_~sum~0 190))} is VALID [2018-11-23 13:14:33,694 INFO L273 TraceCheckUtils]: 44: Hoare triple {8154#(and (= main_~i~0 20) (= main_~sum~0 190))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8158#(and (= main_~i~0 20) (= main_~sum~0 (+ main_~i~0 190)))} is VALID [2018-11-23 13:14:33,694 INFO L273 TraceCheckUtils]: 45: Hoare triple {8158#(and (= main_~i~0 20) (= main_~sum~0 (+ main_~i~0 190)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8162#(and (= main_~i~0 21) (= main_~sum~0 210))} is VALID [2018-11-23 13:14:33,696 INFO L273 TraceCheckUtils]: 46: Hoare triple {8162#(and (= main_~i~0 21) (= main_~sum~0 210))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8166#(and (= main_~sum~0 (+ main_~i~0 210)) (= main_~i~0 21))} is VALID [2018-11-23 13:14:33,696 INFO L273 TraceCheckUtils]: 47: Hoare triple {8166#(and (= main_~sum~0 (+ main_~i~0 210)) (= main_~i~0 21))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8170#(and (= main_~sum~0 231) (= main_~i~0 22))} is VALID [2018-11-23 13:14:33,699 INFO L273 TraceCheckUtils]: 48: Hoare triple {8170#(and (= main_~sum~0 231) (= main_~i~0 22))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8174#(and (= (+ main_~i~0 231) main_~sum~0) (= main_~i~0 22))} is VALID [2018-11-23 13:14:33,699 INFO L273 TraceCheckUtils]: 49: Hoare triple {8174#(and (= (+ main_~i~0 231) main_~sum~0) (= main_~i~0 22))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8178#(and (= main_~i~0 23) (= main_~sum~0 253))} is VALID [2018-11-23 13:14:33,705 INFO L273 TraceCheckUtils]: 50: Hoare triple {8178#(and (= main_~i~0 23) (= main_~sum~0 253))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8182#(and (= main_~i~0 23) (= main_~sum~0 (+ main_~i~0 253)))} is VALID [2018-11-23 13:14:33,707 INFO L273 TraceCheckUtils]: 51: Hoare triple {8182#(and (= main_~i~0 23) (= main_~sum~0 (+ main_~i~0 253)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8186#(and (= main_~i~0 24) (= main_~sum~0 276))} is VALID [2018-11-23 13:14:33,709 INFO L273 TraceCheckUtils]: 52: Hoare triple {8186#(and (= main_~i~0 24) (= main_~sum~0 276))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8190#(and (= main_~i~0 24) (<= main_~i~0 main_~n~0) (= (+ main_~i~0 276) main_~sum~0))} is VALID [2018-11-23 13:14:33,709 INFO L273 TraceCheckUtils]: 53: Hoare triple {8190#(and (= main_~i~0 24) (<= main_~i~0 main_~n~0) (= (+ main_~i~0 276) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8194#(and (<= main_~i~0 25) (<= 24 main_~n~0) (= main_~sum~0 300))} is VALID [2018-11-23 13:14:33,711 INFO L273 TraceCheckUtils]: 54: Hoare triple {8194#(and (<= main_~i~0 25) (<= 24 main_~n~0) (= main_~sum~0 300))} assume !(~i~0 <= ~n~0); {8198#(and (<= main_~n~0 24) (<= 24 main_~n~0) (= main_~sum~0 300))} is VALID [2018-11-23 13:14:33,716 INFO L256 TraceCheckUtils]: 55: Hoare triple {8198#(and (<= main_~n~0 24) (<= 24 main_~n~0) (= main_~sum~0 300))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {8202#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:14:33,718 INFO L273 TraceCheckUtils]: 56: Hoare triple {8202#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {8206#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:14:33,718 INFO L273 TraceCheckUtils]: 57: Hoare triple {8206#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7983#false} is VALID [2018-11-23 13:14:33,718 INFO L273 TraceCheckUtils]: 58: Hoare triple {7983#false} assume !false; {7983#false} is VALID [2018-11-23 13:14:33,725 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:14:33,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:14:33,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-11-23 13:14:33,744 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 59 [2018-11-23 13:14:33,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:14:33,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states. [2018-11-23 13:14:33,804 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:14:33,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-23 13:14:33,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-23 13:14:33,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=2756, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 13:14:33,806 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 54 states. [2018-11-23 13:14:39,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:39,516 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-11-23 13:14:39,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-23 13:14:39,516 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 59 [2018-11-23 13:14:39,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:14:39,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 13:14:39,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2018-11-23 13:14:39,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 13:14:39,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2018-11-23 13:14:39,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states and 67 transitions. [2018-11-23 13:14:39,586 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:39,587 INFO L225 Difference]: With dead ends: 67 [2018-11-23 13:14:39,587 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 13:14:39,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=114, Invalid=2966, Unknown=0, NotChecked=0, Total=3080 [2018-11-23 13:14:39,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 13:14:39,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-11-23 13:14:39,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:14:39,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 62 states. [2018-11-23 13:14:39,651 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2018-11-23 13:14:39,651 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2018-11-23 13:14:39,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:39,652 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-11-23 13:14:39,653 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-11-23 13:14:39,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:39,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:39,653 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2018-11-23 13:14:39,653 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2018-11-23 13:14:39,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:39,654 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-11-23 13:14:39,654 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-11-23 13:14:39,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:39,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:39,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:14:39,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:14:39,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 13:14:39,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-11-23 13:14:39,656 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2018-11-23 13:14:39,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:14:39,657 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-11-23 13:14:39,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-23 13:14:39,657 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-11-23 13:14:39,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 13:14:39,657 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:14:39,658 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:14:39,658 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:14:39,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:14:39,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1276579955, now seen corresponding path program 25 times [2018-11-23 13:14:39,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:14:39,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:14:39,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:39,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:14:39,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:39,667 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:14:39,667 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:14:39,667 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:39,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:14:39,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:39,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:41,935 INFO L256 TraceCheckUtils]: 0: Hoare triple {8535#true} call ULTIMATE.init(); {8535#true} is VALID [2018-11-23 13:14:41,935 INFO L273 TraceCheckUtils]: 1: Hoare triple {8535#true} assume true; {8535#true} is VALID [2018-11-23 13:14:41,935 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {8535#true} {8535#true} #37#return; {8535#true} is VALID [2018-11-23 13:14:41,936 INFO L256 TraceCheckUtils]: 3: Hoare triple {8535#true} call #t~ret3 := main(); {8535#true} is VALID [2018-11-23 13:14:41,936 INFO L273 TraceCheckUtils]: 4: Hoare triple {8535#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {8535#true} is VALID [2018-11-23 13:14:41,936 INFO L273 TraceCheckUtils]: 5: Hoare triple {8535#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {8555#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-23 13:14:41,937 INFO L273 TraceCheckUtils]: 6: Hoare triple {8555#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8559#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-23 13:14:41,937 INFO L273 TraceCheckUtils]: 7: Hoare triple {8559#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8563#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2018-11-23 13:14:41,938 INFO L273 TraceCheckUtils]: 8: Hoare triple {8563#(and (= main_~i~0 2) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8567#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-23 13:14:41,938 INFO L273 TraceCheckUtils]: 9: Hoare triple {8567#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8571#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-23 13:14:41,939 INFO L273 TraceCheckUtils]: 10: Hoare triple {8571#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8575#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-23 13:14:41,939 INFO L273 TraceCheckUtils]: 11: Hoare triple {8575#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8579#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-23 13:14:41,940 INFO L273 TraceCheckUtils]: 12: Hoare triple {8579#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8583#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-23 13:14:41,941 INFO L273 TraceCheckUtils]: 13: Hoare triple {8583#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8587#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-23 13:14:41,941 INFO L273 TraceCheckUtils]: 14: Hoare triple {8587#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8591#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-23 13:14:41,942 INFO L273 TraceCheckUtils]: 15: Hoare triple {8591#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8595#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-23 13:14:41,943 INFO L273 TraceCheckUtils]: 16: Hoare triple {8595#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8599#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-23 13:14:41,944 INFO L273 TraceCheckUtils]: 17: Hoare triple {8599#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8603#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-23 13:14:41,944 INFO L273 TraceCheckUtils]: 18: Hoare triple {8603#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8607#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} is VALID [2018-11-23 13:14:41,945 INFO L273 TraceCheckUtils]: 19: Hoare triple {8607#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8611#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-23 13:14:41,946 INFO L273 TraceCheckUtils]: 20: Hoare triple {8611#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8615#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} is VALID [2018-11-23 13:14:41,947 INFO L273 TraceCheckUtils]: 21: Hoare triple {8615#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8619#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-23 13:14:41,947 INFO L273 TraceCheckUtils]: 22: Hoare triple {8619#(and (= main_~i~0 9) (= main_~sum~0 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8623#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} is VALID [2018-11-23 13:14:41,948 INFO L273 TraceCheckUtils]: 23: Hoare triple {8623#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8627#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-23 13:14:41,949 INFO L273 TraceCheckUtils]: 24: Hoare triple {8627#(and (= main_~sum~0 45) (= main_~i~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8631#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} is VALID [2018-11-23 13:14:41,950 INFO L273 TraceCheckUtils]: 25: Hoare triple {8631#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8635#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-23 13:14:41,950 INFO L273 TraceCheckUtils]: 26: Hoare triple {8635#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8639#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} is VALID [2018-11-23 13:14:41,951 INFO L273 TraceCheckUtils]: 27: Hoare triple {8639#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8643#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-23 13:14:41,952 INFO L273 TraceCheckUtils]: 28: Hoare triple {8643#(and (= main_~i~0 12) (= main_~sum~0 66))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8647#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} is VALID [2018-11-23 13:14:41,953 INFO L273 TraceCheckUtils]: 29: Hoare triple {8647#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8651#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-23 13:14:41,953 INFO L273 TraceCheckUtils]: 30: Hoare triple {8651#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8655#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2018-11-23 13:14:41,954 INFO L273 TraceCheckUtils]: 31: Hoare triple {8655#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8659#(and (= main_~i~0 14) (= main_~sum~0 91))} is VALID [2018-11-23 13:14:41,955 INFO L273 TraceCheckUtils]: 32: Hoare triple {8659#(and (= main_~i~0 14) (= main_~sum~0 91))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8663#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} is VALID [2018-11-23 13:14:41,956 INFO L273 TraceCheckUtils]: 33: Hoare triple {8663#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8667#(and (= main_~sum~0 105) (= main_~i~0 15))} is VALID [2018-11-23 13:14:41,956 INFO L273 TraceCheckUtils]: 34: Hoare triple {8667#(and (= main_~sum~0 105) (= main_~i~0 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8671#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} is VALID [2018-11-23 13:14:41,957 INFO L273 TraceCheckUtils]: 35: Hoare triple {8671#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8675#(and (= main_~sum~0 120) (= main_~i~0 16))} is VALID [2018-11-23 13:14:41,958 INFO L273 TraceCheckUtils]: 36: Hoare triple {8675#(and (= main_~sum~0 120) (= main_~i~0 16))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8679#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} is VALID [2018-11-23 13:14:41,959 INFO L273 TraceCheckUtils]: 37: Hoare triple {8679#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8683#(and (= main_~i~0 17) (= main_~sum~0 136))} is VALID [2018-11-23 13:14:41,959 INFO L273 TraceCheckUtils]: 38: Hoare triple {8683#(and (= main_~i~0 17) (= main_~sum~0 136))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8687#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} is VALID [2018-11-23 13:14:41,960 INFO L273 TraceCheckUtils]: 39: Hoare triple {8687#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8691#(and (= main_~i~0 18) (= main_~sum~0 153))} is VALID [2018-11-23 13:14:41,961 INFO L273 TraceCheckUtils]: 40: Hoare triple {8691#(and (= main_~i~0 18) (= main_~sum~0 153))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8695#(and (= main_~i~0 18) (= main_~sum~0 (+ main_~i~0 153)))} is VALID [2018-11-23 13:14:41,962 INFO L273 TraceCheckUtils]: 41: Hoare triple {8695#(and (= main_~i~0 18) (= main_~sum~0 (+ main_~i~0 153)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8699#(and (= main_~i~0 19) (= main_~sum~0 171))} is VALID [2018-11-23 13:14:41,962 INFO L273 TraceCheckUtils]: 42: Hoare triple {8699#(and (= main_~i~0 19) (= main_~sum~0 171))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8703#(and (= (+ main_~i~0 171) main_~sum~0) (= main_~i~0 19))} is VALID [2018-11-23 13:14:41,963 INFO L273 TraceCheckUtils]: 43: Hoare triple {8703#(and (= (+ main_~i~0 171) main_~sum~0) (= main_~i~0 19))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8707#(and (= main_~i~0 20) (= main_~sum~0 190))} is VALID [2018-11-23 13:14:41,964 INFO L273 TraceCheckUtils]: 44: Hoare triple {8707#(and (= main_~i~0 20) (= main_~sum~0 190))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8711#(and (= main_~i~0 20) (= main_~sum~0 (+ main_~i~0 190)))} is VALID [2018-11-23 13:14:41,965 INFO L273 TraceCheckUtils]: 45: Hoare triple {8711#(and (= main_~i~0 20) (= main_~sum~0 (+ main_~i~0 190)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8715#(and (= main_~i~0 21) (= main_~sum~0 210))} is VALID [2018-11-23 13:14:41,966 INFO L273 TraceCheckUtils]: 46: Hoare triple {8715#(and (= main_~i~0 21) (= main_~sum~0 210))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8719#(and (= main_~sum~0 (+ main_~i~0 210)) (= main_~i~0 21))} is VALID [2018-11-23 13:14:41,967 INFO L273 TraceCheckUtils]: 47: Hoare triple {8719#(and (= main_~sum~0 (+ main_~i~0 210)) (= main_~i~0 21))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8723#(and (= main_~sum~0 231) (= main_~i~0 22))} is VALID [2018-11-23 13:14:41,967 INFO L273 TraceCheckUtils]: 48: Hoare triple {8723#(and (= main_~sum~0 231) (= main_~i~0 22))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8727#(and (= (+ main_~i~0 231) main_~sum~0) (= main_~i~0 22))} is VALID [2018-11-23 13:14:41,968 INFO L273 TraceCheckUtils]: 49: Hoare triple {8727#(and (= (+ main_~i~0 231) main_~sum~0) (= main_~i~0 22))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8731#(and (= main_~i~0 23) (= main_~sum~0 253))} is VALID [2018-11-23 13:14:41,969 INFO L273 TraceCheckUtils]: 50: Hoare triple {8731#(and (= main_~i~0 23) (= main_~sum~0 253))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8735#(and (= main_~i~0 23) (= main_~sum~0 (+ main_~i~0 253)))} is VALID [2018-11-23 13:14:41,970 INFO L273 TraceCheckUtils]: 51: Hoare triple {8735#(and (= main_~i~0 23) (= main_~sum~0 (+ main_~i~0 253)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8739#(and (= main_~i~0 24) (= main_~sum~0 276))} is VALID [2018-11-23 13:14:41,970 INFO L273 TraceCheckUtils]: 52: Hoare triple {8739#(and (= main_~i~0 24) (= main_~sum~0 276))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8743#(and (= main_~i~0 24) (= (+ main_~i~0 276) main_~sum~0))} is VALID [2018-11-23 13:14:41,971 INFO L273 TraceCheckUtils]: 53: Hoare triple {8743#(and (= main_~i~0 24) (= (+ main_~i~0 276) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8747#(and (= main_~sum~0 300) (= main_~i~0 25))} is VALID [2018-11-23 13:14:41,972 INFO L273 TraceCheckUtils]: 54: Hoare triple {8747#(and (= main_~sum~0 300) (= main_~i~0 25))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8751#(and (<= main_~i~0 main_~n~0) (= main_~i~0 25) (= main_~sum~0 (+ main_~i~0 300)))} is VALID [2018-11-23 13:14:41,973 INFO L273 TraceCheckUtils]: 55: Hoare triple {8751#(and (<= main_~i~0 main_~n~0) (= main_~i~0 25) (= main_~sum~0 (+ main_~i~0 300)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8755#(and (<= 25 main_~n~0) (= main_~sum~0 325) (<= main_~i~0 26))} is VALID [2018-11-23 13:14:41,974 INFO L273 TraceCheckUtils]: 56: Hoare triple {8755#(and (<= 25 main_~n~0) (= main_~sum~0 325) (<= main_~i~0 26))} assume !(~i~0 <= ~n~0); {8759#(and (<= 25 main_~n~0) (<= main_~n~0 25) (= main_~sum~0 325))} is VALID [2018-11-23 13:14:41,975 INFO L256 TraceCheckUtils]: 57: Hoare triple {8759#(and (<= 25 main_~n~0) (<= main_~n~0 25) (= main_~sum~0 325))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {8763#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:14:41,975 INFO L273 TraceCheckUtils]: 58: Hoare triple {8763#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {8767#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:14:41,976 INFO L273 TraceCheckUtils]: 59: Hoare triple {8767#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8536#false} is VALID [2018-11-23 13:14:41,976 INFO L273 TraceCheckUtils]: 60: Hoare triple {8536#false} assume !false; {8536#false} is VALID [2018-11-23 13:14:41,985 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:14:42,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:14:42,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-11-23 13:14:42,004 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 61 [2018-11-23 13:14:42,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:14:42,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states. [2018-11-23 13:14:42,063 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:14:42,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-11-23 13:14:42,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-11-23 13:14:42,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=2970, Unknown=0, NotChecked=0, Total=3080 [2018-11-23 13:14:42,065 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 56 states. [2018-11-23 13:14:48,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:48,485 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-11-23 13:14:48,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-11-23 13:14:48,485 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 61 [2018-11-23 13:14:48,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:14:48,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 13:14:48,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2018-11-23 13:14:48,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 13:14:48,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2018-11-23 13:14:48,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states and 69 transitions. [2018-11-23 13:14:48,622 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:48,623 INFO L225 Difference]: With dead ends: 69 [2018-11-23 13:14:48,624 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 13:14:48,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=118, Invalid=3188, Unknown=0, NotChecked=0, Total=3306 [2018-11-23 13:14:48,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 13:14:48,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-23 13:14:48,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:14:48,679 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 64 states. [2018-11-23 13:14:48,679 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-23 13:14:48,679 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-23 13:14:48,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:48,681 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-11-23 13:14:48,681 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-11-23 13:14:48,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:48,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:48,681 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-23 13:14:48,682 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-23 13:14:48,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:48,682 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-11-23 13:14:48,682 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-11-23 13:14:48,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:48,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:48,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:14:48,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:14:48,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 13:14:48,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-11-23 13:14:48,684 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2018-11-23 13:14:48,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:14:48,684 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-11-23 13:14:48,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-11-23 13:14:48,684 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-11-23 13:14:48,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 13:14:48,685 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:14:48,685 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:14:48,685 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:14:48,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:14:48,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1592296501, now seen corresponding path program 26 times [2018-11-23 13:14:48,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:14:48,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:14:48,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:48,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:14:48,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:48,694 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:14:48,694 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:14:48,694 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:48,713 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:14:48,759 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:14:48,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:14:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:48,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:51,046 INFO L256 TraceCheckUtils]: 0: Hoare triple {9106#true} call ULTIMATE.init(); {9106#true} is VALID [2018-11-23 13:14:51,046 INFO L273 TraceCheckUtils]: 1: Hoare triple {9106#true} assume true; {9106#true} is VALID [2018-11-23 13:14:51,046 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {9106#true} {9106#true} #37#return; {9106#true} is VALID [2018-11-23 13:14:51,047 INFO L256 TraceCheckUtils]: 3: Hoare triple {9106#true} call #t~ret3 := main(); {9106#true} is VALID [2018-11-23 13:14:51,047 INFO L273 TraceCheckUtils]: 4: Hoare triple {9106#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {9106#true} is VALID [2018-11-23 13:14:51,047 INFO L273 TraceCheckUtils]: 5: Hoare triple {9106#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {9126#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-23 13:14:51,048 INFO L273 TraceCheckUtils]: 6: Hoare triple {9126#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9130#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-23 13:14:51,048 INFO L273 TraceCheckUtils]: 7: Hoare triple {9130#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9134#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2018-11-23 13:14:51,049 INFO L273 TraceCheckUtils]: 8: Hoare triple {9134#(and (= main_~i~0 2) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9138#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-23 13:14:51,049 INFO L273 TraceCheckUtils]: 9: Hoare triple {9138#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9142#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-23 13:14:51,050 INFO L273 TraceCheckUtils]: 10: Hoare triple {9142#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9146#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-23 13:14:51,050 INFO L273 TraceCheckUtils]: 11: Hoare triple {9146#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9150#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-23 13:14:51,051 INFO L273 TraceCheckUtils]: 12: Hoare triple {9150#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9154#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-23 13:14:51,052 INFO L273 TraceCheckUtils]: 13: Hoare triple {9154#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9158#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-23 13:14:51,053 INFO L273 TraceCheckUtils]: 14: Hoare triple {9158#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9162#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-23 13:14:51,054 INFO L273 TraceCheckUtils]: 15: Hoare triple {9162#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9166#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-23 13:14:51,054 INFO L273 TraceCheckUtils]: 16: Hoare triple {9166#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9170#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-23 13:14:51,055 INFO L273 TraceCheckUtils]: 17: Hoare triple {9170#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9174#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-23 13:14:51,056 INFO L273 TraceCheckUtils]: 18: Hoare triple {9174#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9178#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} is VALID [2018-11-23 13:14:51,056 INFO L273 TraceCheckUtils]: 19: Hoare triple {9178#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9182#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-23 13:14:51,057 INFO L273 TraceCheckUtils]: 20: Hoare triple {9182#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9186#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} is VALID [2018-11-23 13:14:51,058 INFO L273 TraceCheckUtils]: 21: Hoare triple {9186#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9190#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-23 13:14:51,059 INFO L273 TraceCheckUtils]: 22: Hoare triple {9190#(and (= main_~i~0 9) (= main_~sum~0 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9194#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} is VALID [2018-11-23 13:14:51,060 INFO L273 TraceCheckUtils]: 23: Hoare triple {9194#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9198#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-23 13:14:51,060 INFO L273 TraceCheckUtils]: 24: Hoare triple {9198#(and (= main_~sum~0 45) (= main_~i~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9202#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} is VALID [2018-11-23 13:14:51,061 INFO L273 TraceCheckUtils]: 25: Hoare triple {9202#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9206#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-23 13:14:51,062 INFO L273 TraceCheckUtils]: 26: Hoare triple {9206#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9210#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} is VALID [2018-11-23 13:14:51,063 INFO L273 TraceCheckUtils]: 27: Hoare triple {9210#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9214#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-23 13:14:51,063 INFO L273 TraceCheckUtils]: 28: Hoare triple {9214#(and (= main_~i~0 12) (= main_~sum~0 66))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9218#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} is VALID [2018-11-23 13:14:51,064 INFO L273 TraceCheckUtils]: 29: Hoare triple {9218#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9222#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-23 13:14:51,065 INFO L273 TraceCheckUtils]: 30: Hoare triple {9222#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9226#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2018-11-23 13:14:51,065 INFO L273 TraceCheckUtils]: 31: Hoare triple {9226#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9230#(and (= main_~i~0 14) (= main_~sum~0 91))} is VALID [2018-11-23 13:14:51,066 INFO L273 TraceCheckUtils]: 32: Hoare triple {9230#(and (= main_~i~0 14) (= main_~sum~0 91))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9234#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} is VALID [2018-11-23 13:14:51,067 INFO L273 TraceCheckUtils]: 33: Hoare triple {9234#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9238#(and (= main_~sum~0 105) (= main_~i~0 15))} is VALID [2018-11-23 13:14:51,068 INFO L273 TraceCheckUtils]: 34: Hoare triple {9238#(and (= main_~sum~0 105) (= main_~i~0 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9242#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} is VALID [2018-11-23 13:14:51,068 INFO L273 TraceCheckUtils]: 35: Hoare triple {9242#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9246#(and (= main_~sum~0 120) (= main_~i~0 16))} is VALID [2018-11-23 13:14:51,069 INFO L273 TraceCheckUtils]: 36: Hoare triple {9246#(and (= main_~sum~0 120) (= main_~i~0 16))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9250#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} is VALID [2018-11-23 13:14:51,070 INFO L273 TraceCheckUtils]: 37: Hoare triple {9250#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9254#(and (= main_~i~0 17) (= main_~sum~0 136))} is VALID [2018-11-23 13:14:51,071 INFO L273 TraceCheckUtils]: 38: Hoare triple {9254#(and (= main_~i~0 17) (= main_~sum~0 136))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9258#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} is VALID [2018-11-23 13:14:51,071 INFO L273 TraceCheckUtils]: 39: Hoare triple {9258#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9262#(and (= main_~i~0 18) (= main_~sum~0 153))} is VALID [2018-11-23 13:14:51,072 INFO L273 TraceCheckUtils]: 40: Hoare triple {9262#(and (= main_~i~0 18) (= main_~sum~0 153))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9266#(and (= main_~i~0 18) (= main_~sum~0 (+ main_~i~0 153)))} is VALID [2018-11-23 13:14:51,073 INFO L273 TraceCheckUtils]: 41: Hoare triple {9266#(and (= main_~i~0 18) (= main_~sum~0 (+ main_~i~0 153)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9270#(and (= main_~i~0 19) (= main_~sum~0 171))} is VALID [2018-11-23 13:14:51,074 INFO L273 TraceCheckUtils]: 42: Hoare triple {9270#(and (= main_~i~0 19) (= main_~sum~0 171))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9274#(and (= (+ main_~i~0 171) main_~sum~0) (= main_~i~0 19))} is VALID [2018-11-23 13:14:51,075 INFO L273 TraceCheckUtils]: 43: Hoare triple {9274#(and (= (+ main_~i~0 171) main_~sum~0) (= main_~i~0 19))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9278#(and (= main_~i~0 20) (= main_~sum~0 190))} is VALID [2018-11-23 13:14:51,075 INFO L273 TraceCheckUtils]: 44: Hoare triple {9278#(and (= main_~i~0 20) (= main_~sum~0 190))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9282#(and (= main_~i~0 20) (= main_~sum~0 (+ main_~i~0 190)))} is VALID [2018-11-23 13:14:51,076 INFO L273 TraceCheckUtils]: 45: Hoare triple {9282#(and (= main_~i~0 20) (= main_~sum~0 (+ main_~i~0 190)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9286#(and (= main_~i~0 21) (= main_~sum~0 210))} is VALID [2018-11-23 13:14:51,077 INFO L273 TraceCheckUtils]: 46: Hoare triple {9286#(and (= main_~i~0 21) (= main_~sum~0 210))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9290#(and (= main_~sum~0 (+ main_~i~0 210)) (= main_~i~0 21))} is VALID [2018-11-23 13:14:51,078 INFO L273 TraceCheckUtils]: 47: Hoare triple {9290#(and (= main_~sum~0 (+ main_~i~0 210)) (= main_~i~0 21))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9294#(and (= main_~sum~0 231) (= main_~i~0 22))} is VALID [2018-11-23 13:14:51,078 INFO L273 TraceCheckUtils]: 48: Hoare triple {9294#(and (= main_~sum~0 231) (= main_~i~0 22))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9298#(and (= (+ main_~i~0 231) main_~sum~0) (= main_~i~0 22))} is VALID [2018-11-23 13:14:51,079 INFO L273 TraceCheckUtils]: 49: Hoare triple {9298#(and (= (+ main_~i~0 231) main_~sum~0) (= main_~i~0 22))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9302#(and (= main_~i~0 23) (= main_~sum~0 253))} is VALID [2018-11-23 13:14:51,080 INFO L273 TraceCheckUtils]: 50: Hoare triple {9302#(and (= main_~i~0 23) (= main_~sum~0 253))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9306#(and (= main_~i~0 23) (= main_~sum~0 (+ main_~i~0 253)))} is VALID [2018-11-23 13:14:51,081 INFO L273 TraceCheckUtils]: 51: Hoare triple {9306#(and (= main_~i~0 23) (= main_~sum~0 (+ main_~i~0 253)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9310#(and (= main_~i~0 24) (= main_~sum~0 276))} is VALID [2018-11-23 13:14:51,081 INFO L273 TraceCheckUtils]: 52: Hoare triple {9310#(and (= main_~i~0 24) (= main_~sum~0 276))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9314#(and (= main_~i~0 24) (= (+ main_~i~0 276) main_~sum~0))} is VALID [2018-11-23 13:14:51,082 INFO L273 TraceCheckUtils]: 53: Hoare triple {9314#(and (= main_~i~0 24) (= (+ main_~i~0 276) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9318#(and (= main_~sum~0 300) (= main_~i~0 25))} is VALID [2018-11-23 13:14:51,083 INFO L273 TraceCheckUtils]: 54: Hoare triple {9318#(and (= main_~sum~0 300) (= main_~i~0 25))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9322#(and (= main_~i~0 25) (= main_~sum~0 (+ main_~i~0 300)))} is VALID [2018-11-23 13:14:51,084 INFO L273 TraceCheckUtils]: 55: Hoare triple {9322#(and (= main_~i~0 25) (= main_~sum~0 (+ main_~i~0 300)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9326#(and (= main_~sum~0 325) (= main_~i~0 26))} is VALID [2018-11-23 13:14:51,084 INFO L273 TraceCheckUtils]: 56: Hoare triple {9326#(and (= main_~sum~0 325) (= main_~i~0 26))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9330#(and (<= main_~i~0 main_~n~0) (= (+ main_~i~0 325) main_~sum~0) (= main_~i~0 26))} is VALID [2018-11-23 13:14:51,085 INFO L273 TraceCheckUtils]: 57: Hoare triple {9330#(and (<= main_~i~0 main_~n~0) (= (+ main_~i~0 325) main_~sum~0) (= main_~i~0 26))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9334#(and (<= 26 main_~n~0) (<= main_~i~0 27) (= main_~sum~0 351))} is VALID [2018-11-23 13:14:51,086 INFO L273 TraceCheckUtils]: 58: Hoare triple {9334#(and (<= 26 main_~n~0) (<= main_~i~0 27) (= main_~sum~0 351))} assume !(~i~0 <= ~n~0); {9338#(and (<= 26 main_~n~0) (<= main_~n~0 26) (= main_~sum~0 351))} is VALID [2018-11-23 13:14:51,087 INFO L256 TraceCheckUtils]: 59: Hoare triple {9338#(and (<= 26 main_~n~0) (<= main_~n~0 26) (= main_~sum~0 351))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {9342#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:14:51,088 INFO L273 TraceCheckUtils]: 60: Hoare triple {9342#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {9346#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:14:51,088 INFO L273 TraceCheckUtils]: 61: Hoare triple {9346#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9107#false} is VALID [2018-11-23 13:14:51,089 INFO L273 TraceCheckUtils]: 62: Hoare triple {9107#false} assume !false; {9107#false} is VALID [2018-11-23 13:14:51,097 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:14:51,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:14:51,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-11-23 13:14:51,116 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 63 [2018-11-23 13:14:51,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:14:51,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states. [2018-11-23 13:14:51,178 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:14:51,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-11-23 13:14:51,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-11-23 13:14:51,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=3192, Unknown=0, NotChecked=0, Total=3306 [2018-11-23 13:14:51,180 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 58 states. [2018-11-23 13:14:57,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:57,699 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-11-23 13:14:57,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-11-23 13:14:57,699 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 63 [2018-11-23 13:14:57,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:14:57,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 13:14:57,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2018-11-23 13:14:57,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 13:14:57,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2018-11-23 13:14:57,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states and 71 transitions. [2018-11-23 13:14:57,768 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:57,769 INFO L225 Difference]: With dead ends: 71 [2018-11-23 13:14:57,770 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 13:14:57,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=122, Invalid=3418, Unknown=0, NotChecked=0, Total=3540 [2018-11-23 13:14:57,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 13:14:57,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-23 13:14:57,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:14:57,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 66 states. [2018-11-23 13:14:57,841 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2018-11-23 13:14:57,841 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2018-11-23 13:14:57,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:57,842 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-11-23 13:14:57,842 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-11-23 13:14:57,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:57,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:57,843 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2018-11-23 13:14:57,843 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2018-11-23 13:14:57,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:57,844 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-11-23 13:14:57,844 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-11-23 13:14:57,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:57,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:57,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:14:57,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:14:57,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 13:14:57,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-11-23 13:14:57,846 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2018-11-23 13:14:57,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:14:57,847 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-11-23 13:14:57,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-11-23 13:14:57,847 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-11-23 13:14:57,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 13:14:57,847 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:14:57,847 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:14:57,848 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:14:57,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:14:57,848 INFO L82 PathProgramCache]: Analyzing trace with hash -53219191, now seen corresponding path program 27 times [2018-11-23 13:14:57,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:14:57,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:14:57,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:57,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:14:57,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:57,857 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:14:57,857 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:14:57,857 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:57,878 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:14:58,150 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-11-23 13:14:58,150 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:14:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:58,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:00,497 INFO L256 TraceCheckUtils]: 0: Hoare triple {9695#true} call ULTIMATE.init(); {9695#true} is VALID [2018-11-23 13:15:00,497 INFO L273 TraceCheckUtils]: 1: Hoare triple {9695#true} assume true; {9695#true} is VALID [2018-11-23 13:15:00,497 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {9695#true} {9695#true} #37#return; {9695#true} is VALID [2018-11-23 13:15:00,497 INFO L256 TraceCheckUtils]: 3: Hoare triple {9695#true} call #t~ret3 := main(); {9695#true} is VALID [2018-11-23 13:15:00,498 INFO L273 TraceCheckUtils]: 4: Hoare triple {9695#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {9695#true} is VALID [2018-11-23 13:15:00,498 INFO L273 TraceCheckUtils]: 5: Hoare triple {9695#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {9715#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-23 13:15:00,499 INFO L273 TraceCheckUtils]: 6: Hoare triple {9715#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9719#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-23 13:15:00,499 INFO L273 TraceCheckUtils]: 7: Hoare triple {9719#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9723#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2018-11-23 13:15:00,500 INFO L273 TraceCheckUtils]: 8: Hoare triple {9723#(and (= main_~i~0 2) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9727#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-23 13:15:00,500 INFO L273 TraceCheckUtils]: 9: Hoare triple {9727#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9731#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-23 13:15:00,501 INFO L273 TraceCheckUtils]: 10: Hoare triple {9731#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9735#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-23 13:15:00,501 INFO L273 TraceCheckUtils]: 11: Hoare triple {9735#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9739#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-23 13:15:00,502 INFO L273 TraceCheckUtils]: 12: Hoare triple {9739#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9743#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-23 13:15:00,503 INFO L273 TraceCheckUtils]: 13: Hoare triple {9743#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9747#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-23 13:15:00,504 INFO L273 TraceCheckUtils]: 14: Hoare triple {9747#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9751#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-23 13:15:00,504 INFO L273 TraceCheckUtils]: 15: Hoare triple {9751#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9755#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-23 13:15:00,505 INFO L273 TraceCheckUtils]: 16: Hoare triple {9755#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9759#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-23 13:15:00,506 INFO L273 TraceCheckUtils]: 17: Hoare triple {9759#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9763#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-23 13:15:00,507 INFO L273 TraceCheckUtils]: 18: Hoare triple {9763#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9767#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} is VALID [2018-11-23 13:15:00,507 INFO L273 TraceCheckUtils]: 19: Hoare triple {9767#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9771#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-23 13:15:00,508 INFO L273 TraceCheckUtils]: 20: Hoare triple {9771#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9775#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} is VALID [2018-11-23 13:15:00,509 INFO L273 TraceCheckUtils]: 21: Hoare triple {9775#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9779#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-23 13:15:00,510 INFO L273 TraceCheckUtils]: 22: Hoare triple {9779#(and (= main_~i~0 9) (= main_~sum~0 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9783#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} is VALID [2018-11-23 13:15:00,510 INFO L273 TraceCheckUtils]: 23: Hoare triple {9783#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9787#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-23 13:15:00,511 INFO L273 TraceCheckUtils]: 24: Hoare triple {9787#(and (= main_~sum~0 45) (= main_~i~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9791#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} is VALID [2018-11-23 13:15:00,512 INFO L273 TraceCheckUtils]: 25: Hoare triple {9791#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9795#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-23 13:15:00,513 INFO L273 TraceCheckUtils]: 26: Hoare triple {9795#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9799#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} is VALID [2018-11-23 13:15:00,513 INFO L273 TraceCheckUtils]: 27: Hoare triple {9799#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9803#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-23 13:15:00,514 INFO L273 TraceCheckUtils]: 28: Hoare triple {9803#(and (= main_~i~0 12) (= main_~sum~0 66))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9807#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} is VALID [2018-11-23 13:15:00,515 INFO L273 TraceCheckUtils]: 29: Hoare triple {9807#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9811#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-23 13:15:00,516 INFO L273 TraceCheckUtils]: 30: Hoare triple {9811#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9815#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2018-11-23 13:15:00,516 INFO L273 TraceCheckUtils]: 31: Hoare triple {9815#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9819#(and (= main_~i~0 14) (= main_~sum~0 91))} is VALID [2018-11-23 13:15:00,517 INFO L273 TraceCheckUtils]: 32: Hoare triple {9819#(and (= main_~i~0 14) (= main_~sum~0 91))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9823#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} is VALID [2018-11-23 13:15:00,518 INFO L273 TraceCheckUtils]: 33: Hoare triple {9823#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9827#(and (= main_~sum~0 105) (= main_~i~0 15))} is VALID [2018-11-23 13:15:00,519 INFO L273 TraceCheckUtils]: 34: Hoare triple {9827#(and (= main_~sum~0 105) (= main_~i~0 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9831#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} is VALID [2018-11-23 13:15:00,519 INFO L273 TraceCheckUtils]: 35: Hoare triple {9831#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9835#(and (= main_~sum~0 120) (= main_~i~0 16))} is VALID [2018-11-23 13:15:00,520 INFO L273 TraceCheckUtils]: 36: Hoare triple {9835#(and (= main_~sum~0 120) (= main_~i~0 16))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9839#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} is VALID [2018-11-23 13:15:00,521 INFO L273 TraceCheckUtils]: 37: Hoare triple {9839#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9843#(and (= main_~i~0 17) (= main_~sum~0 136))} is VALID [2018-11-23 13:15:00,522 INFO L273 TraceCheckUtils]: 38: Hoare triple {9843#(and (= main_~i~0 17) (= main_~sum~0 136))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9847#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} is VALID [2018-11-23 13:15:00,522 INFO L273 TraceCheckUtils]: 39: Hoare triple {9847#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9851#(and (= main_~i~0 18) (= main_~sum~0 153))} is VALID [2018-11-23 13:15:00,523 INFO L273 TraceCheckUtils]: 40: Hoare triple {9851#(and (= main_~i~0 18) (= main_~sum~0 153))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9855#(and (= main_~i~0 18) (= main_~sum~0 (+ main_~i~0 153)))} is VALID [2018-11-23 13:15:00,524 INFO L273 TraceCheckUtils]: 41: Hoare triple {9855#(and (= main_~i~0 18) (= main_~sum~0 (+ main_~i~0 153)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9859#(and (= main_~i~0 19) (= main_~sum~0 171))} is VALID [2018-11-23 13:15:00,525 INFO L273 TraceCheckUtils]: 42: Hoare triple {9859#(and (= main_~i~0 19) (= main_~sum~0 171))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9863#(and (= (+ main_~i~0 171) main_~sum~0) (= main_~i~0 19))} is VALID [2018-11-23 13:15:00,525 INFO L273 TraceCheckUtils]: 43: Hoare triple {9863#(and (= (+ main_~i~0 171) main_~sum~0) (= main_~i~0 19))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9867#(and (= main_~i~0 20) (= main_~sum~0 190))} is VALID [2018-11-23 13:15:00,526 INFO L273 TraceCheckUtils]: 44: Hoare triple {9867#(and (= main_~i~0 20) (= main_~sum~0 190))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9871#(and (= main_~i~0 20) (= main_~sum~0 (+ main_~i~0 190)))} is VALID [2018-11-23 13:15:00,527 INFO L273 TraceCheckUtils]: 45: Hoare triple {9871#(and (= main_~i~0 20) (= main_~sum~0 (+ main_~i~0 190)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9875#(and (= main_~i~0 21) (= main_~sum~0 210))} is VALID [2018-11-23 13:15:00,528 INFO L273 TraceCheckUtils]: 46: Hoare triple {9875#(and (= main_~i~0 21) (= main_~sum~0 210))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9879#(and (= main_~sum~0 (+ main_~i~0 210)) (= main_~i~0 21))} is VALID [2018-11-23 13:15:00,528 INFO L273 TraceCheckUtils]: 47: Hoare triple {9879#(and (= main_~sum~0 (+ main_~i~0 210)) (= main_~i~0 21))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9883#(and (= main_~sum~0 231) (= main_~i~0 22))} is VALID [2018-11-23 13:15:00,529 INFO L273 TraceCheckUtils]: 48: Hoare triple {9883#(and (= main_~sum~0 231) (= main_~i~0 22))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9887#(and (= (+ main_~i~0 231) main_~sum~0) (= main_~i~0 22))} is VALID [2018-11-23 13:15:00,530 INFO L273 TraceCheckUtils]: 49: Hoare triple {9887#(and (= (+ main_~i~0 231) main_~sum~0) (= main_~i~0 22))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9891#(and (= main_~i~0 23) (= main_~sum~0 253))} is VALID [2018-11-23 13:15:00,531 INFO L273 TraceCheckUtils]: 50: Hoare triple {9891#(and (= main_~i~0 23) (= main_~sum~0 253))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9895#(and (= main_~i~0 23) (= main_~sum~0 (+ main_~i~0 253)))} is VALID [2018-11-23 13:15:00,532 INFO L273 TraceCheckUtils]: 51: Hoare triple {9895#(and (= main_~i~0 23) (= main_~sum~0 (+ main_~i~0 253)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9899#(and (= main_~i~0 24) (= main_~sum~0 276))} is VALID [2018-11-23 13:15:00,532 INFO L273 TraceCheckUtils]: 52: Hoare triple {9899#(and (= main_~i~0 24) (= main_~sum~0 276))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9903#(and (= main_~i~0 24) (= (+ main_~i~0 276) main_~sum~0))} is VALID [2018-11-23 13:15:00,533 INFO L273 TraceCheckUtils]: 53: Hoare triple {9903#(and (= main_~i~0 24) (= (+ main_~i~0 276) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9907#(and (= main_~sum~0 300) (= main_~i~0 25))} is VALID [2018-11-23 13:15:00,534 INFO L273 TraceCheckUtils]: 54: Hoare triple {9907#(and (= main_~sum~0 300) (= main_~i~0 25))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9911#(and (= main_~i~0 25) (= main_~sum~0 (+ main_~i~0 300)))} is VALID [2018-11-23 13:15:00,535 INFO L273 TraceCheckUtils]: 55: Hoare triple {9911#(and (= main_~i~0 25) (= main_~sum~0 (+ main_~i~0 300)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9915#(and (= main_~sum~0 325) (= main_~i~0 26))} is VALID [2018-11-23 13:15:00,535 INFO L273 TraceCheckUtils]: 56: Hoare triple {9915#(and (= main_~sum~0 325) (= main_~i~0 26))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9919#(and (= (+ main_~i~0 325) main_~sum~0) (= main_~i~0 26))} is VALID [2018-11-23 13:15:00,536 INFO L273 TraceCheckUtils]: 57: Hoare triple {9919#(and (= (+ main_~i~0 325) main_~sum~0) (= main_~i~0 26))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9923#(and (= main_~i~0 27) (= main_~sum~0 351))} is VALID [2018-11-23 13:15:00,537 INFO L273 TraceCheckUtils]: 58: Hoare triple {9923#(and (= main_~i~0 27) (= main_~sum~0 351))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9927#(and (= main_~i~0 27) (= (+ main_~i~0 351) main_~sum~0) (<= main_~i~0 main_~n~0))} is VALID [2018-11-23 13:15:00,538 INFO L273 TraceCheckUtils]: 59: Hoare triple {9927#(and (= main_~i~0 27) (= (+ main_~i~0 351) main_~sum~0) (<= main_~i~0 main_~n~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9931#(and (= main_~sum~0 378) (<= 27 main_~n~0) (<= main_~i~0 28))} is VALID [2018-11-23 13:15:00,538 INFO L273 TraceCheckUtils]: 60: Hoare triple {9931#(and (= main_~sum~0 378) (<= 27 main_~n~0) (<= main_~i~0 28))} assume !(~i~0 <= ~n~0); {9935#(and (= main_~sum~0 378) (<= main_~n~0 27) (<= 27 main_~n~0))} is VALID [2018-11-23 13:15:00,540 INFO L256 TraceCheckUtils]: 61: Hoare triple {9935#(and (= main_~sum~0 378) (<= main_~n~0 27) (<= 27 main_~n~0))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {9939#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:15:00,540 INFO L273 TraceCheckUtils]: 62: Hoare triple {9939#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {9943#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:15:00,541 INFO L273 TraceCheckUtils]: 63: Hoare triple {9943#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9696#false} is VALID [2018-11-23 13:15:00,541 INFO L273 TraceCheckUtils]: 64: Hoare triple {9696#false} assume !false; {9696#false} is VALID [2018-11-23 13:15:00,549 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:15:00,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:15:00,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-11-23 13:15:00,568 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 65 [2018-11-23 13:15:00,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:15:00,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 60 states. [2018-11-23 13:15:00,633 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:15:00,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-11-23 13:15:00,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-11-23 13:15:00,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=3422, Unknown=0, NotChecked=0, Total=3540 [2018-11-23 13:15:00,634 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 60 states. [2018-11-23 13:15:07,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:07,706 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-11-23 13:15:07,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-11-23 13:15:07,706 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 65 [2018-11-23 13:15:07,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:15:07,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 13:15:07,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2018-11-23 13:15:07,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 13:15:07,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2018-11-23 13:15:07,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 60 states and 73 transitions. [2018-11-23 13:15:07,776 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:15:07,777 INFO L225 Difference]: With dead ends: 73 [2018-11-23 13:15:07,777 INFO L226 Difference]: Without dead ends: 68 [2018-11-23 13:15:07,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=126, Invalid=3656, Unknown=0, NotChecked=0, Total=3782 [2018-11-23 13:15:07,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-23 13:15:07,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-23 13:15:07,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:15:07,839 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 68 states. [2018-11-23 13:15:07,839 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2018-11-23 13:15:07,839 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2018-11-23 13:15:07,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:07,840 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-11-23 13:15:07,841 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-11-23 13:15:07,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:07,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:07,841 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2018-11-23 13:15:07,841 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2018-11-23 13:15:07,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:07,843 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-11-23 13:15:07,843 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-11-23 13:15:07,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:07,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:07,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:15:07,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:15:07,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 13:15:07,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-11-23 13:15:07,845 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2018-11-23 13:15:07,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:15:07,845 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-11-23 13:15:07,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-11-23 13:15:07,846 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-11-23 13:15:07,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 13:15:07,846 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:15:07,846 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:15:07,847 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:15:07,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:07,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1531325895, now seen corresponding path program 28 times [2018-11-23 13:15:07,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:07,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:07,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:07,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:07,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:07,855 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:15:07,855 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:15:07,855 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:15:07,868 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:15:07,912 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:15:07,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:07,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:07,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:10,386 INFO L256 TraceCheckUtils]: 0: Hoare triple {10302#true} call ULTIMATE.init(); {10302#true} is VALID [2018-11-23 13:15:10,387 INFO L273 TraceCheckUtils]: 1: Hoare triple {10302#true} assume true; {10302#true} is VALID [2018-11-23 13:15:10,387 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {10302#true} {10302#true} #37#return; {10302#true} is VALID [2018-11-23 13:15:10,387 INFO L256 TraceCheckUtils]: 3: Hoare triple {10302#true} call #t~ret3 := main(); {10302#true} is VALID [2018-11-23 13:15:10,387 INFO L273 TraceCheckUtils]: 4: Hoare triple {10302#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {10302#true} is VALID [2018-11-23 13:15:10,388 INFO L273 TraceCheckUtils]: 5: Hoare triple {10302#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {10322#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-23 13:15:10,388 INFO L273 TraceCheckUtils]: 6: Hoare triple {10322#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10326#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-23 13:15:10,389 INFO L273 TraceCheckUtils]: 7: Hoare triple {10326#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10330#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2018-11-23 13:15:10,390 INFO L273 TraceCheckUtils]: 8: Hoare triple {10330#(and (= main_~i~0 2) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10334#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-23 13:15:10,390 INFO L273 TraceCheckUtils]: 9: Hoare triple {10334#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10338#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-23 13:15:10,391 INFO L273 TraceCheckUtils]: 10: Hoare triple {10338#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10342#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-23 13:15:10,392 INFO L273 TraceCheckUtils]: 11: Hoare triple {10342#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10346#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-23 13:15:10,393 INFO L273 TraceCheckUtils]: 12: Hoare triple {10346#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10350#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-23 13:15:10,394 INFO L273 TraceCheckUtils]: 13: Hoare triple {10350#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10354#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-23 13:15:10,394 INFO L273 TraceCheckUtils]: 14: Hoare triple {10354#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10358#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-23 13:15:10,395 INFO L273 TraceCheckUtils]: 15: Hoare triple {10358#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10362#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-23 13:15:10,396 INFO L273 TraceCheckUtils]: 16: Hoare triple {10362#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10366#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-23 13:15:10,397 INFO L273 TraceCheckUtils]: 17: Hoare triple {10366#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10370#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-23 13:15:10,397 INFO L273 TraceCheckUtils]: 18: Hoare triple {10370#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10374#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} is VALID [2018-11-23 13:15:10,398 INFO L273 TraceCheckUtils]: 19: Hoare triple {10374#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10378#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-23 13:15:10,399 INFO L273 TraceCheckUtils]: 20: Hoare triple {10378#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10382#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} is VALID [2018-11-23 13:15:10,400 INFO L273 TraceCheckUtils]: 21: Hoare triple {10382#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10386#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-23 13:15:10,401 INFO L273 TraceCheckUtils]: 22: Hoare triple {10386#(and (= main_~i~0 9) (= main_~sum~0 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10390#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} is VALID [2018-11-23 13:15:10,401 INFO L273 TraceCheckUtils]: 23: Hoare triple {10390#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10394#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-23 13:15:10,402 INFO L273 TraceCheckUtils]: 24: Hoare triple {10394#(and (= main_~sum~0 45) (= main_~i~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10398#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} is VALID [2018-11-23 13:15:10,403 INFO L273 TraceCheckUtils]: 25: Hoare triple {10398#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10402#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-23 13:15:10,404 INFO L273 TraceCheckUtils]: 26: Hoare triple {10402#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10406#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} is VALID [2018-11-23 13:15:10,404 INFO L273 TraceCheckUtils]: 27: Hoare triple {10406#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10410#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-23 13:15:10,405 INFO L273 TraceCheckUtils]: 28: Hoare triple {10410#(and (= main_~i~0 12) (= main_~sum~0 66))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10414#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} is VALID [2018-11-23 13:15:10,406 INFO L273 TraceCheckUtils]: 29: Hoare triple {10414#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10418#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-23 13:15:10,407 INFO L273 TraceCheckUtils]: 30: Hoare triple {10418#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10422#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2018-11-23 13:15:10,407 INFO L273 TraceCheckUtils]: 31: Hoare triple {10422#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10426#(and (= main_~i~0 14) (= main_~sum~0 91))} is VALID [2018-11-23 13:15:10,408 INFO L273 TraceCheckUtils]: 32: Hoare triple {10426#(and (= main_~i~0 14) (= main_~sum~0 91))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10430#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} is VALID [2018-11-23 13:15:10,409 INFO L273 TraceCheckUtils]: 33: Hoare triple {10430#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10434#(and (= main_~sum~0 105) (= main_~i~0 15))} is VALID [2018-11-23 13:15:10,410 INFO L273 TraceCheckUtils]: 34: Hoare triple {10434#(and (= main_~sum~0 105) (= main_~i~0 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10438#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} is VALID [2018-11-23 13:15:10,410 INFO L273 TraceCheckUtils]: 35: Hoare triple {10438#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10442#(and (= main_~sum~0 120) (= main_~i~0 16))} is VALID [2018-11-23 13:15:10,411 INFO L273 TraceCheckUtils]: 36: Hoare triple {10442#(and (= main_~sum~0 120) (= main_~i~0 16))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10446#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} is VALID [2018-11-23 13:15:10,412 INFO L273 TraceCheckUtils]: 37: Hoare triple {10446#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10450#(and (= main_~i~0 17) (= main_~sum~0 136))} is VALID [2018-11-23 13:15:10,413 INFO L273 TraceCheckUtils]: 38: Hoare triple {10450#(and (= main_~i~0 17) (= main_~sum~0 136))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10454#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} is VALID [2018-11-23 13:15:10,413 INFO L273 TraceCheckUtils]: 39: Hoare triple {10454#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10458#(and (= main_~i~0 18) (= main_~sum~0 153))} is VALID [2018-11-23 13:15:10,414 INFO L273 TraceCheckUtils]: 40: Hoare triple {10458#(and (= main_~i~0 18) (= main_~sum~0 153))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10462#(and (= main_~i~0 18) (= main_~sum~0 (+ main_~i~0 153)))} is VALID [2018-11-23 13:15:10,415 INFO L273 TraceCheckUtils]: 41: Hoare triple {10462#(and (= main_~i~0 18) (= main_~sum~0 (+ main_~i~0 153)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10466#(and (= main_~i~0 19) (= main_~sum~0 171))} is VALID [2018-11-23 13:15:10,416 INFO L273 TraceCheckUtils]: 42: Hoare triple {10466#(and (= main_~i~0 19) (= main_~sum~0 171))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10470#(and (= (+ main_~i~0 171) main_~sum~0) (= main_~i~0 19))} is VALID [2018-11-23 13:15:10,416 INFO L273 TraceCheckUtils]: 43: Hoare triple {10470#(and (= (+ main_~i~0 171) main_~sum~0) (= main_~i~0 19))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10474#(and (= main_~i~0 20) (= main_~sum~0 190))} is VALID [2018-11-23 13:15:10,417 INFO L273 TraceCheckUtils]: 44: Hoare triple {10474#(and (= main_~i~0 20) (= main_~sum~0 190))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10478#(and (= main_~i~0 20) (= main_~sum~0 (+ main_~i~0 190)))} is VALID [2018-11-23 13:15:10,418 INFO L273 TraceCheckUtils]: 45: Hoare triple {10478#(and (= main_~i~0 20) (= main_~sum~0 (+ main_~i~0 190)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10482#(and (= main_~i~0 21) (= main_~sum~0 210))} is VALID [2018-11-23 13:15:10,419 INFO L273 TraceCheckUtils]: 46: Hoare triple {10482#(and (= main_~i~0 21) (= main_~sum~0 210))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10486#(and (= main_~sum~0 (+ main_~i~0 210)) (= main_~i~0 21))} is VALID [2018-11-23 13:15:10,419 INFO L273 TraceCheckUtils]: 47: Hoare triple {10486#(and (= main_~sum~0 (+ main_~i~0 210)) (= main_~i~0 21))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10490#(and (= main_~sum~0 231) (= main_~i~0 22))} is VALID [2018-11-23 13:15:10,420 INFO L273 TraceCheckUtils]: 48: Hoare triple {10490#(and (= main_~sum~0 231) (= main_~i~0 22))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10494#(and (= (+ main_~i~0 231) main_~sum~0) (= main_~i~0 22))} is VALID [2018-11-23 13:15:10,421 INFO L273 TraceCheckUtils]: 49: Hoare triple {10494#(and (= (+ main_~i~0 231) main_~sum~0) (= main_~i~0 22))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10498#(and (= main_~i~0 23) (= main_~sum~0 253))} is VALID [2018-11-23 13:15:10,422 INFO L273 TraceCheckUtils]: 50: Hoare triple {10498#(and (= main_~i~0 23) (= main_~sum~0 253))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10502#(and (= main_~i~0 23) (= main_~sum~0 (+ main_~i~0 253)))} is VALID [2018-11-23 13:15:10,422 INFO L273 TraceCheckUtils]: 51: Hoare triple {10502#(and (= main_~i~0 23) (= main_~sum~0 (+ main_~i~0 253)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10506#(and (= main_~i~0 24) (= main_~sum~0 276))} is VALID [2018-11-23 13:15:10,423 INFO L273 TraceCheckUtils]: 52: Hoare triple {10506#(and (= main_~i~0 24) (= main_~sum~0 276))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10510#(and (= main_~i~0 24) (= (+ main_~i~0 276) main_~sum~0))} is VALID [2018-11-23 13:15:10,424 INFO L273 TraceCheckUtils]: 53: Hoare triple {10510#(and (= main_~i~0 24) (= (+ main_~i~0 276) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10514#(and (= main_~sum~0 300) (= main_~i~0 25))} is VALID [2018-11-23 13:15:10,425 INFO L273 TraceCheckUtils]: 54: Hoare triple {10514#(and (= main_~sum~0 300) (= main_~i~0 25))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10518#(and (= main_~i~0 25) (= main_~sum~0 (+ main_~i~0 300)))} is VALID [2018-11-23 13:15:10,425 INFO L273 TraceCheckUtils]: 55: Hoare triple {10518#(and (= main_~i~0 25) (= main_~sum~0 (+ main_~i~0 300)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10522#(and (= main_~sum~0 325) (= main_~i~0 26))} is VALID [2018-11-23 13:15:10,426 INFO L273 TraceCheckUtils]: 56: Hoare triple {10522#(and (= main_~sum~0 325) (= main_~i~0 26))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10526#(and (= (+ main_~i~0 325) main_~sum~0) (= main_~i~0 26))} is VALID [2018-11-23 13:15:10,427 INFO L273 TraceCheckUtils]: 57: Hoare triple {10526#(and (= (+ main_~i~0 325) main_~sum~0) (= main_~i~0 26))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10530#(and (= main_~i~0 27) (= main_~sum~0 351))} is VALID [2018-11-23 13:15:10,428 INFO L273 TraceCheckUtils]: 58: Hoare triple {10530#(and (= main_~i~0 27) (= main_~sum~0 351))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10534#(and (= main_~i~0 27) (= (+ main_~i~0 351) main_~sum~0))} is VALID [2018-11-23 13:15:10,428 INFO L273 TraceCheckUtils]: 59: Hoare triple {10534#(and (= main_~i~0 27) (= (+ main_~i~0 351) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10538#(and (= main_~sum~0 378) (= main_~i~0 28))} is VALID [2018-11-23 13:15:10,429 INFO L273 TraceCheckUtils]: 60: Hoare triple {10538#(and (= main_~sum~0 378) (= main_~i~0 28))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10542#(and (= main_~i~0 28) (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 378)))} is VALID [2018-11-23 13:15:10,430 INFO L273 TraceCheckUtils]: 61: Hoare triple {10542#(and (= main_~i~0 28) (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 378)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10546#(and (<= 28 main_~n~0) (<= main_~i~0 29) (= main_~sum~0 406))} is VALID [2018-11-23 13:15:10,431 INFO L273 TraceCheckUtils]: 62: Hoare triple {10546#(and (<= 28 main_~n~0) (<= main_~i~0 29) (= main_~sum~0 406))} assume !(~i~0 <= ~n~0); {10550#(and (<= main_~n~0 28) (<= 28 main_~n~0) (= main_~sum~0 406))} is VALID [2018-11-23 13:15:10,432 INFO L256 TraceCheckUtils]: 63: Hoare triple {10550#(and (<= main_~n~0 28) (<= 28 main_~n~0) (= main_~sum~0 406))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {10554#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:15:10,432 INFO L273 TraceCheckUtils]: 64: Hoare triple {10554#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {10558#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:15:10,433 INFO L273 TraceCheckUtils]: 65: Hoare triple {10558#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10303#false} is VALID [2018-11-23 13:15:10,433 INFO L273 TraceCheckUtils]: 66: Hoare triple {10303#false} assume !false; {10303#false} is VALID [2018-11-23 13:15:10,443 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:15:10,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:15:10,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-11-23 13:15:10,462 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 67 [2018-11-23 13:15:10,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:15:10,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states. [2018-11-23 13:15:10,527 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:15:10,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-11-23 13:15:10,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-11-23 13:15:10,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=3660, Unknown=0, NotChecked=0, Total=3782 [2018-11-23 13:15:10,528 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 62 states. [2018-11-23 13:15:17,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:17,951 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-11-23 13:15:17,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-11-23 13:15:17,952 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 67 [2018-11-23 13:15:17,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:15:17,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 13:15:17,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2018-11-23 13:15:17,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 13:15:17,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2018-11-23 13:15:17,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states and 75 transitions. [2018-11-23 13:15:18,031 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:15:18,032 INFO L225 Difference]: With dead ends: 75 [2018-11-23 13:15:18,032 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 13:15:18,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=130, Invalid=3902, Unknown=0, NotChecked=0, Total=4032 [2018-11-23 13:15:18,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 13:15:18,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-11-23 13:15:18,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:15:18,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 70 states. [2018-11-23 13:15:18,109 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2018-11-23 13:15:18,109 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2018-11-23 13:15:18,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:18,111 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-11-23 13:15:18,111 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-11-23 13:15:18,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:18,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:18,111 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2018-11-23 13:15:18,111 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2018-11-23 13:15:18,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:18,112 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-11-23 13:15:18,112 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-11-23 13:15:18,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:18,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:18,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:15:18,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:15:18,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 13:15:18,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-11-23 13:15:18,113 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2018-11-23 13:15:18,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:15:18,114 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-11-23 13:15:18,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-11-23 13:15:18,114 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-11-23 13:15:18,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 13:15:18,114 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:15:18,114 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:15:18,114 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:15:18,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:18,115 INFO L82 PathProgramCache]: Analyzing trace with hash -434236539, now seen corresponding path program 29 times [2018-11-23 13:15:18,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:18,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:18,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:18,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:18,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:18,123 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:15:18,123 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:15:18,123 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:15:18,142 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:15:18,198 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-11-23 13:15:18,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:18,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:18,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:20,856 INFO L256 TraceCheckUtils]: 0: Hoare triple {10927#true} call ULTIMATE.init(); {10927#true} is VALID [2018-11-23 13:15:20,857 INFO L273 TraceCheckUtils]: 1: Hoare triple {10927#true} assume true; {10927#true} is VALID [2018-11-23 13:15:20,857 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {10927#true} {10927#true} #37#return; {10927#true} is VALID [2018-11-23 13:15:20,857 INFO L256 TraceCheckUtils]: 3: Hoare triple {10927#true} call #t~ret3 := main(); {10927#true} is VALID [2018-11-23 13:15:20,858 INFO L273 TraceCheckUtils]: 4: Hoare triple {10927#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {10927#true} is VALID [2018-11-23 13:15:20,858 INFO L273 TraceCheckUtils]: 5: Hoare triple {10927#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {10947#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-23 13:15:20,858 INFO L273 TraceCheckUtils]: 6: Hoare triple {10947#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10951#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-23 13:15:20,859 INFO L273 TraceCheckUtils]: 7: Hoare triple {10951#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10955#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2018-11-23 13:15:20,859 INFO L273 TraceCheckUtils]: 8: Hoare triple {10955#(and (= main_~i~0 2) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10959#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-23 13:15:20,860 INFO L273 TraceCheckUtils]: 9: Hoare triple {10959#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10963#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-23 13:15:20,860 INFO L273 TraceCheckUtils]: 10: Hoare triple {10963#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10967#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-23 13:15:20,861 INFO L273 TraceCheckUtils]: 11: Hoare triple {10967#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10971#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-23 13:15:20,861 INFO L273 TraceCheckUtils]: 12: Hoare triple {10971#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10975#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-23 13:15:20,862 INFO L273 TraceCheckUtils]: 13: Hoare triple {10975#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10979#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-23 13:15:20,863 INFO L273 TraceCheckUtils]: 14: Hoare triple {10979#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10983#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-23 13:15:20,864 INFO L273 TraceCheckUtils]: 15: Hoare triple {10983#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10987#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-23 13:15:20,864 INFO L273 TraceCheckUtils]: 16: Hoare triple {10987#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10991#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-23 13:15:20,865 INFO L273 TraceCheckUtils]: 17: Hoare triple {10991#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10995#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-23 13:15:20,866 INFO L273 TraceCheckUtils]: 18: Hoare triple {10995#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {10999#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} is VALID [2018-11-23 13:15:20,867 INFO L273 TraceCheckUtils]: 19: Hoare triple {10999#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11003#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-23 13:15:20,867 INFO L273 TraceCheckUtils]: 20: Hoare triple {11003#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11007#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} is VALID [2018-11-23 13:15:20,868 INFO L273 TraceCheckUtils]: 21: Hoare triple {11007#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11011#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-23 13:15:20,869 INFO L273 TraceCheckUtils]: 22: Hoare triple {11011#(and (= main_~i~0 9) (= main_~sum~0 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11015#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} is VALID [2018-11-23 13:15:20,870 INFO L273 TraceCheckUtils]: 23: Hoare triple {11015#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11019#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-23 13:15:20,870 INFO L273 TraceCheckUtils]: 24: Hoare triple {11019#(and (= main_~sum~0 45) (= main_~i~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11023#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} is VALID [2018-11-23 13:15:20,871 INFO L273 TraceCheckUtils]: 25: Hoare triple {11023#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11027#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-23 13:15:20,872 INFO L273 TraceCheckUtils]: 26: Hoare triple {11027#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11031#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} is VALID [2018-11-23 13:15:20,873 INFO L273 TraceCheckUtils]: 27: Hoare triple {11031#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11035#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-23 13:15:20,873 INFO L273 TraceCheckUtils]: 28: Hoare triple {11035#(and (= main_~i~0 12) (= main_~sum~0 66))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11039#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} is VALID [2018-11-23 13:15:20,874 INFO L273 TraceCheckUtils]: 29: Hoare triple {11039#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11043#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-23 13:15:20,875 INFO L273 TraceCheckUtils]: 30: Hoare triple {11043#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11047#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2018-11-23 13:15:20,876 INFO L273 TraceCheckUtils]: 31: Hoare triple {11047#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11051#(and (= main_~i~0 14) (= main_~sum~0 91))} is VALID [2018-11-23 13:15:20,876 INFO L273 TraceCheckUtils]: 32: Hoare triple {11051#(and (= main_~i~0 14) (= main_~sum~0 91))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11055#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} is VALID [2018-11-23 13:15:20,877 INFO L273 TraceCheckUtils]: 33: Hoare triple {11055#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11059#(and (= main_~sum~0 105) (= main_~i~0 15))} is VALID [2018-11-23 13:15:20,878 INFO L273 TraceCheckUtils]: 34: Hoare triple {11059#(and (= main_~sum~0 105) (= main_~i~0 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11063#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} is VALID [2018-11-23 13:15:20,878 INFO L273 TraceCheckUtils]: 35: Hoare triple {11063#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11067#(and (= main_~sum~0 120) (= main_~i~0 16))} is VALID [2018-11-23 13:15:20,879 INFO L273 TraceCheckUtils]: 36: Hoare triple {11067#(and (= main_~sum~0 120) (= main_~i~0 16))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11071#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} is VALID [2018-11-23 13:15:20,880 INFO L273 TraceCheckUtils]: 37: Hoare triple {11071#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11075#(and (= main_~i~0 17) (= main_~sum~0 136))} is VALID [2018-11-23 13:15:20,881 INFO L273 TraceCheckUtils]: 38: Hoare triple {11075#(and (= main_~i~0 17) (= main_~sum~0 136))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11079#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} is VALID [2018-11-23 13:15:20,881 INFO L273 TraceCheckUtils]: 39: Hoare triple {11079#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11083#(and (= main_~i~0 18) (= main_~sum~0 153))} is VALID [2018-11-23 13:15:20,882 INFO L273 TraceCheckUtils]: 40: Hoare triple {11083#(and (= main_~i~0 18) (= main_~sum~0 153))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11087#(and (= main_~i~0 18) (= main_~sum~0 (+ main_~i~0 153)))} is VALID [2018-11-23 13:15:20,883 INFO L273 TraceCheckUtils]: 41: Hoare triple {11087#(and (= main_~i~0 18) (= main_~sum~0 (+ main_~i~0 153)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11091#(and (= main_~i~0 19) (= main_~sum~0 171))} is VALID [2018-11-23 13:15:20,884 INFO L273 TraceCheckUtils]: 42: Hoare triple {11091#(and (= main_~i~0 19) (= main_~sum~0 171))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11095#(and (= (+ main_~i~0 171) main_~sum~0) (= main_~i~0 19))} is VALID [2018-11-23 13:15:20,885 INFO L273 TraceCheckUtils]: 43: Hoare triple {11095#(and (= (+ main_~i~0 171) main_~sum~0) (= main_~i~0 19))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11099#(and (= main_~i~0 20) (= main_~sum~0 190))} is VALID [2018-11-23 13:15:20,885 INFO L273 TraceCheckUtils]: 44: Hoare triple {11099#(and (= main_~i~0 20) (= main_~sum~0 190))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11103#(and (= main_~i~0 20) (= main_~sum~0 (+ main_~i~0 190)))} is VALID [2018-11-23 13:15:20,886 INFO L273 TraceCheckUtils]: 45: Hoare triple {11103#(and (= main_~i~0 20) (= main_~sum~0 (+ main_~i~0 190)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11107#(and (= main_~i~0 21) (= main_~sum~0 210))} is VALID [2018-11-23 13:15:20,887 INFO L273 TraceCheckUtils]: 46: Hoare triple {11107#(and (= main_~i~0 21) (= main_~sum~0 210))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11111#(and (= main_~sum~0 (+ main_~i~0 210)) (= main_~i~0 21))} is VALID [2018-11-23 13:15:20,888 INFO L273 TraceCheckUtils]: 47: Hoare triple {11111#(and (= main_~sum~0 (+ main_~i~0 210)) (= main_~i~0 21))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11115#(and (= main_~sum~0 231) (= main_~i~0 22))} is VALID [2018-11-23 13:15:20,888 INFO L273 TraceCheckUtils]: 48: Hoare triple {11115#(and (= main_~sum~0 231) (= main_~i~0 22))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11119#(and (= (+ main_~i~0 231) main_~sum~0) (= main_~i~0 22))} is VALID [2018-11-23 13:15:20,889 INFO L273 TraceCheckUtils]: 49: Hoare triple {11119#(and (= (+ main_~i~0 231) main_~sum~0) (= main_~i~0 22))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11123#(and (= main_~i~0 23) (= main_~sum~0 253))} is VALID [2018-11-23 13:15:20,890 INFO L273 TraceCheckUtils]: 50: Hoare triple {11123#(and (= main_~i~0 23) (= main_~sum~0 253))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11127#(and (= main_~i~0 23) (= main_~sum~0 (+ main_~i~0 253)))} is VALID [2018-11-23 13:15:20,891 INFO L273 TraceCheckUtils]: 51: Hoare triple {11127#(and (= main_~i~0 23) (= main_~sum~0 (+ main_~i~0 253)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11131#(and (= main_~i~0 24) (= main_~sum~0 276))} is VALID [2018-11-23 13:15:20,891 INFO L273 TraceCheckUtils]: 52: Hoare triple {11131#(and (= main_~i~0 24) (= main_~sum~0 276))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11135#(and (= main_~i~0 24) (= (+ main_~i~0 276) main_~sum~0))} is VALID [2018-11-23 13:15:20,892 INFO L273 TraceCheckUtils]: 53: Hoare triple {11135#(and (= main_~i~0 24) (= (+ main_~i~0 276) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11139#(and (= main_~sum~0 300) (= main_~i~0 25))} is VALID [2018-11-23 13:15:20,893 INFO L273 TraceCheckUtils]: 54: Hoare triple {11139#(and (= main_~sum~0 300) (= main_~i~0 25))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11143#(and (= main_~i~0 25) (= main_~sum~0 (+ main_~i~0 300)))} is VALID [2018-11-23 13:15:20,894 INFO L273 TraceCheckUtils]: 55: Hoare triple {11143#(and (= main_~i~0 25) (= main_~sum~0 (+ main_~i~0 300)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11147#(and (= main_~sum~0 325) (= main_~i~0 26))} is VALID [2018-11-23 13:15:20,894 INFO L273 TraceCheckUtils]: 56: Hoare triple {11147#(and (= main_~sum~0 325) (= main_~i~0 26))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11151#(and (= (+ main_~i~0 325) main_~sum~0) (= main_~i~0 26))} is VALID [2018-11-23 13:15:20,895 INFO L273 TraceCheckUtils]: 57: Hoare triple {11151#(and (= (+ main_~i~0 325) main_~sum~0) (= main_~i~0 26))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11155#(and (= main_~i~0 27) (= main_~sum~0 351))} is VALID [2018-11-23 13:15:20,896 INFO L273 TraceCheckUtils]: 58: Hoare triple {11155#(and (= main_~i~0 27) (= main_~sum~0 351))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11159#(and (= main_~i~0 27) (= (+ main_~i~0 351) main_~sum~0))} is VALID [2018-11-23 13:15:20,897 INFO L273 TraceCheckUtils]: 59: Hoare triple {11159#(and (= main_~i~0 27) (= (+ main_~i~0 351) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11163#(and (= main_~sum~0 378) (= main_~i~0 28))} is VALID [2018-11-23 13:15:20,897 INFO L273 TraceCheckUtils]: 60: Hoare triple {11163#(and (= main_~sum~0 378) (= main_~i~0 28))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11167#(and (= main_~i~0 28) (= main_~sum~0 (+ main_~i~0 378)))} is VALID [2018-11-23 13:15:20,898 INFO L273 TraceCheckUtils]: 61: Hoare triple {11167#(and (= main_~i~0 28) (= main_~sum~0 (+ main_~i~0 378)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11171#(and (= main_~i~0 29) (= main_~sum~0 406))} is VALID [2018-11-23 13:15:20,899 INFO L273 TraceCheckUtils]: 62: Hoare triple {11171#(and (= main_~i~0 29) (= main_~sum~0 406))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11175#(and (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 406)) (= main_~i~0 29))} is VALID [2018-11-23 13:15:20,900 INFO L273 TraceCheckUtils]: 63: Hoare triple {11175#(and (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 406)) (= main_~i~0 29))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11179#(and (= main_~sum~0 435) (<= 29 main_~n~0) (<= main_~i~0 30))} is VALID [2018-11-23 13:15:20,901 INFO L273 TraceCheckUtils]: 64: Hoare triple {11179#(and (= main_~sum~0 435) (<= 29 main_~n~0) (<= main_~i~0 30))} assume !(~i~0 <= ~n~0); {11183#(and (= main_~sum~0 435) (<= 29 main_~n~0) (<= main_~n~0 29))} is VALID [2018-11-23 13:15:20,902 INFO L256 TraceCheckUtils]: 65: Hoare triple {11183#(and (= main_~sum~0 435) (<= 29 main_~n~0) (<= main_~n~0 29))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {11187#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:15:20,902 INFO L273 TraceCheckUtils]: 66: Hoare triple {11187#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {11191#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:15:20,903 INFO L273 TraceCheckUtils]: 67: Hoare triple {11191#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10928#false} is VALID [2018-11-23 13:15:20,903 INFO L273 TraceCheckUtils]: 68: Hoare triple {10928#false} assume !false; {10928#false} is VALID [2018-11-23 13:15:20,924 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:15:20,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:15:20,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-11-23 13:15:20,944 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 69 [2018-11-23 13:15:20,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:15:20,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 64 states. [2018-11-23 13:15:21,011 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:15:21,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-11-23 13:15:21,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-11-23 13:15:21,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=3906, Unknown=0, NotChecked=0, Total=4032 [2018-11-23 13:15:21,012 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 64 states. [2018-11-23 13:15:28,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:28,969 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-11-23 13:15:28,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-11-23 13:15:28,969 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 69 [2018-11-23 13:15:28,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:15:28,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 13:15:28,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2018-11-23 13:15:28,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 13:15:28,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2018-11-23 13:15:28,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 64 states and 77 transitions. [2018-11-23 13:15:29,043 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:15:29,044 INFO L225 Difference]: With dead ends: 77 [2018-11-23 13:15:29,044 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 13:15:29,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=134, Invalid=4156, Unknown=0, NotChecked=0, Total=4290 [2018-11-23 13:15:29,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 13:15:29,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-23 13:15:29,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:15:29,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 72 states. [2018-11-23 13:15:29,107 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2018-11-23 13:15:29,107 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2018-11-23 13:15:29,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:29,109 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-11-23 13:15:29,109 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-11-23 13:15:29,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:29,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:29,109 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2018-11-23 13:15:29,110 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2018-11-23 13:15:29,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:29,110 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-11-23 13:15:29,110 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-11-23 13:15:29,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:29,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:29,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:15:29,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:15:29,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 13:15:29,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-11-23 13:15:29,112 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2018-11-23 13:15:29,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:15:29,112 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-11-23 13:15:29,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-11-23 13:15:29,112 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-11-23 13:15:29,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 13:15:29,113 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:15:29,113 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:15:29,113 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:15:29,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:29,113 INFO L82 PathProgramCache]: Analyzing trace with hash 445874627, now seen corresponding path program 30 times [2018-11-23 13:15:29,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:29,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:29,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:29,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:29,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:29,121 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:15:29,121 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:15:29,122 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:15:29,138 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:15:29,307 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-11-23 13:15:29,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:29,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:32,002 INFO L256 TraceCheckUtils]: 0: Hoare triple {11570#true} call ULTIMATE.init(); {11570#true} is VALID [2018-11-23 13:15:32,002 INFO L273 TraceCheckUtils]: 1: Hoare triple {11570#true} assume true; {11570#true} is VALID [2018-11-23 13:15:32,002 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {11570#true} {11570#true} #37#return; {11570#true} is VALID [2018-11-23 13:15:32,003 INFO L256 TraceCheckUtils]: 3: Hoare triple {11570#true} call #t~ret3 := main(); {11570#true} is VALID [2018-11-23 13:15:32,003 INFO L273 TraceCheckUtils]: 4: Hoare triple {11570#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {11570#true} is VALID [2018-11-23 13:15:32,003 INFO L273 TraceCheckUtils]: 5: Hoare triple {11570#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {11590#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-23 13:15:32,004 INFO L273 TraceCheckUtils]: 6: Hoare triple {11590#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11594#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-23 13:15:32,004 INFO L273 TraceCheckUtils]: 7: Hoare triple {11594#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11598#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} is VALID [2018-11-23 13:15:32,005 INFO L273 TraceCheckUtils]: 8: Hoare triple {11598#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11602#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-23 13:15:32,005 INFO L273 TraceCheckUtils]: 9: Hoare triple {11602#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11606#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-23 13:15:32,006 INFO L273 TraceCheckUtils]: 10: Hoare triple {11606#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11610#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-23 13:15:32,007 INFO L273 TraceCheckUtils]: 11: Hoare triple {11610#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11614#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-23 13:15:32,008 INFO L273 TraceCheckUtils]: 12: Hoare triple {11614#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11618#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-23 13:15:32,008 INFO L273 TraceCheckUtils]: 13: Hoare triple {11618#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11622#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-23 13:15:32,009 INFO L273 TraceCheckUtils]: 14: Hoare triple {11622#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11626#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-23 13:15:32,010 INFO L273 TraceCheckUtils]: 15: Hoare triple {11626#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11630#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-23 13:15:32,011 INFO L273 TraceCheckUtils]: 16: Hoare triple {11630#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11634#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-23 13:15:32,011 INFO L273 TraceCheckUtils]: 17: Hoare triple {11634#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11638#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-23 13:15:32,012 INFO L273 TraceCheckUtils]: 18: Hoare triple {11638#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11642#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} is VALID [2018-11-23 13:15:32,013 INFO L273 TraceCheckUtils]: 19: Hoare triple {11642#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11646#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-23 13:15:32,014 INFO L273 TraceCheckUtils]: 20: Hoare triple {11646#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11650#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} is VALID [2018-11-23 13:15:32,014 INFO L273 TraceCheckUtils]: 21: Hoare triple {11650#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11654#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-23 13:15:32,015 INFO L273 TraceCheckUtils]: 22: Hoare triple {11654#(and (= main_~i~0 9) (= main_~sum~0 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11658#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} is VALID [2018-11-23 13:15:32,016 INFO L273 TraceCheckUtils]: 23: Hoare triple {11658#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11662#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-23 13:15:32,017 INFO L273 TraceCheckUtils]: 24: Hoare triple {11662#(and (= main_~sum~0 45) (= main_~i~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11666#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} is VALID [2018-11-23 13:15:32,017 INFO L273 TraceCheckUtils]: 25: Hoare triple {11666#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11670#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-23 13:15:32,018 INFO L273 TraceCheckUtils]: 26: Hoare triple {11670#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11674#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} is VALID [2018-11-23 13:15:32,019 INFO L273 TraceCheckUtils]: 27: Hoare triple {11674#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11678#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-23 13:15:32,020 INFO L273 TraceCheckUtils]: 28: Hoare triple {11678#(and (= main_~i~0 12) (= main_~sum~0 66))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11682#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} is VALID [2018-11-23 13:15:32,020 INFO L273 TraceCheckUtils]: 29: Hoare triple {11682#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11686#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-23 13:15:32,021 INFO L273 TraceCheckUtils]: 30: Hoare triple {11686#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11690#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2018-11-23 13:15:32,022 INFO L273 TraceCheckUtils]: 31: Hoare triple {11690#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11694#(and (= main_~i~0 14) (= main_~sum~0 91))} is VALID [2018-11-23 13:15:32,023 INFO L273 TraceCheckUtils]: 32: Hoare triple {11694#(and (= main_~i~0 14) (= main_~sum~0 91))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11698#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} is VALID [2018-11-23 13:15:32,023 INFO L273 TraceCheckUtils]: 33: Hoare triple {11698#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11702#(and (= main_~sum~0 105) (= main_~i~0 15))} is VALID [2018-11-23 13:15:32,024 INFO L273 TraceCheckUtils]: 34: Hoare triple {11702#(and (= main_~sum~0 105) (= main_~i~0 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11706#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} is VALID [2018-11-23 13:15:32,025 INFO L273 TraceCheckUtils]: 35: Hoare triple {11706#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11710#(and (= main_~sum~0 120) (= main_~i~0 16))} is VALID [2018-11-23 13:15:32,026 INFO L273 TraceCheckUtils]: 36: Hoare triple {11710#(and (= main_~sum~0 120) (= main_~i~0 16))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11714#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} is VALID [2018-11-23 13:15:32,026 INFO L273 TraceCheckUtils]: 37: Hoare triple {11714#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11718#(and (= main_~i~0 17) (= main_~sum~0 136))} is VALID [2018-11-23 13:15:32,027 INFO L273 TraceCheckUtils]: 38: Hoare triple {11718#(and (= main_~i~0 17) (= main_~sum~0 136))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11722#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} is VALID [2018-11-23 13:15:32,028 INFO L273 TraceCheckUtils]: 39: Hoare triple {11722#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11726#(and (= main_~i~0 18) (= main_~sum~0 153))} is VALID [2018-11-23 13:15:32,029 INFO L273 TraceCheckUtils]: 40: Hoare triple {11726#(and (= main_~i~0 18) (= main_~sum~0 153))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11730#(and (= main_~i~0 18) (= main_~sum~0 (+ main_~i~0 153)))} is VALID [2018-11-23 13:15:32,029 INFO L273 TraceCheckUtils]: 41: Hoare triple {11730#(and (= main_~i~0 18) (= main_~sum~0 (+ main_~i~0 153)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11734#(and (= main_~i~0 19) (= main_~sum~0 171))} is VALID [2018-11-23 13:15:32,030 INFO L273 TraceCheckUtils]: 42: Hoare triple {11734#(and (= main_~i~0 19) (= main_~sum~0 171))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11738#(and (= (+ main_~i~0 171) main_~sum~0) (= main_~i~0 19))} is VALID [2018-11-23 13:15:32,031 INFO L273 TraceCheckUtils]: 43: Hoare triple {11738#(and (= (+ main_~i~0 171) main_~sum~0) (= main_~i~0 19))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11742#(and (= main_~i~0 20) (= main_~sum~0 190))} is VALID [2018-11-23 13:15:32,032 INFO L273 TraceCheckUtils]: 44: Hoare triple {11742#(and (= main_~i~0 20) (= main_~sum~0 190))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11746#(and (= main_~i~0 20) (= main_~sum~0 (+ main_~i~0 190)))} is VALID [2018-11-23 13:15:32,032 INFO L273 TraceCheckUtils]: 45: Hoare triple {11746#(and (= main_~i~0 20) (= main_~sum~0 (+ main_~i~0 190)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11750#(and (= main_~i~0 21) (= main_~sum~0 210))} is VALID [2018-11-23 13:15:32,033 INFO L273 TraceCheckUtils]: 46: Hoare triple {11750#(and (= main_~i~0 21) (= main_~sum~0 210))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11754#(and (= main_~sum~0 (+ main_~i~0 210)) (= main_~i~0 21))} is VALID [2018-11-23 13:15:32,034 INFO L273 TraceCheckUtils]: 47: Hoare triple {11754#(and (= main_~sum~0 (+ main_~i~0 210)) (= main_~i~0 21))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11758#(and (= main_~sum~0 231) (= main_~i~0 22))} is VALID [2018-11-23 13:15:32,035 INFO L273 TraceCheckUtils]: 48: Hoare triple {11758#(and (= main_~sum~0 231) (= main_~i~0 22))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11762#(and (= (+ main_~i~0 231) main_~sum~0) (= main_~i~0 22))} is VALID [2018-11-23 13:15:32,036 INFO L273 TraceCheckUtils]: 49: Hoare triple {11762#(and (= (+ main_~i~0 231) main_~sum~0) (= main_~i~0 22))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11766#(and (= main_~i~0 23) (= main_~sum~0 253))} is VALID [2018-11-23 13:15:32,036 INFO L273 TraceCheckUtils]: 50: Hoare triple {11766#(and (= main_~i~0 23) (= main_~sum~0 253))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11770#(and (= main_~i~0 23) (= main_~sum~0 (+ main_~i~0 253)))} is VALID [2018-11-23 13:15:32,037 INFO L273 TraceCheckUtils]: 51: Hoare triple {11770#(and (= main_~i~0 23) (= main_~sum~0 (+ main_~i~0 253)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11774#(and (= main_~i~0 24) (= main_~sum~0 276))} is VALID [2018-11-23 13:15:32,038 INFO L273 TraceCheckUtils]: 52: Hoare triple {11774#(and (= main_~i~0 24) (= main_~sum~0 276))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11778#(and (= main_~i~0 24) (= (+ main_~i~0 276) main_~sum~0))} is VALID [2018-11-23 13:15:32,038 INFO L273 TraceCheckUtils]: 53: Hoare triple {11778#(and (= main_~i~0 24) (= (+ main_~i~0 276) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11782#(and (= main_~sum~0 300) (= main_~i~0 25))} is VALID [2018-11-23 13:15:32,039 INFO L273 TraceCheckUtils]: 54: Hoare triple {11782#(and (= main_~sum~0 300) (= main_~i~0 25))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11786#(and (= main_~i~0 25) (= main_~sum~0 (+ main_~i~0 300)))} is VALID [2018-11-23 13:15:32,040 INFO L273 TraceCheckUtils]: 55: Hoare triple {11786#(and (= main_~i~0 25) (= main_~sum~0 (+ main_~i~0 300)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11790#(and (= main_~sum~0 325) (= main_~i~0 26))} is VALID [2018-11-23 13:15:32,041 INFO L273 TraceCheckUtils]: 56: Hoare triple {11790#(and (= main_~sum~0 325) (= main_~i~0 26))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11794#(and (= (+ main_~i~0 325) main_~sum~0) (= main_~i~0 26))} is VALID [2018-11-23 13:15:32,041 INFO L273 TraceCheckUtils]: 57: Hoare triple {11794#(and (= (+ main_~i~0 325) main_~sum~0) (= main_~i~0 26))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11798#(and (= main_~i~0 27) (= main_~sum~0 351))} is VALID [2018-11-23 13:15:32,042 INFO L273 TraceCheckUtils]: 58: Hoare triple {11798#(and (= main_~i~0 27) (= main_~sum~0 351))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11802#(and (= main_~i~0 27) (= (+ main_~i~0 351) main_~sum~0))} is VALID [2018-11-23 13:15:32,043 INFO L273 TraceCheckUtils]: 59: Hoare triple {11802#(and (= main_~i~0 27) (= (+ main_~i~0 351) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11806#(and (= main_~sum~0 378) (= main_~i~0 28))} is VALID [2018-11-23 13:15:32,044 INFO L273 TraceCheckUtils]: 60: Hoare triple {11806#(and (= main_~sum~0 378) (= main_~i~0 28))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11810#(and (= main_~i~0 28) (= main_~sum~0 (+ main_~i~0 378)))} is VALID [2018-11-23 13:15:32,045 INFO L273 TraceCheckUtils]: 61: Hoare triple {11810#(and (= main_~i~0 28) (= main_~sum~0 (+ main_~i~0 378)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11814#(and (= main_~i~0 29) (= main_~sum~0 406))} is VALID [2018-11-23 13:15:32,045 INFO L273 TraceCheckUtils]: 62: Hoare triple {11814#(and (= main_~i~0 29) (= main_~sum~0 406))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11818#(and (= main_~sum~0 (+ main_~i~0 406)) (= main_~i~0 29))} is VALID [2018-11-23 13:15:32,046 INFO L273 TraceCheckUtils]: 63: Hoare triple {11818#(and (= main_~sum~0 (+ main_~i~0 406)) (= main_~i~0 29))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11822#(and (= main_~sum~0 435) (= main_~i~0 30))} is VALID [2018-11-23 13:15:32,047 INFO L273 TraceCheckUtils]: 64: Hoare triple {11822#(and (= main_~sum~0 435) (= main_~i~0 30))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {11826#(and (= main_~i~0 30) (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 435)))} is VALID [2018-11-23 13:15:32,048 INFO L273 TraceCheckUtils]: 65: Hoare triple {11826#(and (= main_~i~0 30) (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 435)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11830#(and (<= 30 main_~n~0) (= main_~sum~0 465) (<= main_~i~0 31))} is VALID [2018-11-23 13:15:32,049 INFO L273 TraceCheckUtils]: 66: Hoare triple {11830#(and (<= 30 main_~n~0) (= main_~sum~0 465) (<= main_~i~0 31))} assume !(~i~0 <= ~n~0); {11834#(and (<= 30 main_~n~0) (<= main_~n~0 30) (= main_~sum~0 465))} is VALID [2018-11-23 13:15:32,050 INFO L256 TraceCheckUtils]: 67: Hoare triple {11834#(and (<= 30 main_~n~0) (<= main_~n~0 30) (= main_~sum~0 465))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {11838#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:15:32,050 INFO L273 TraceCheckUtils]: 68: Hoare triple {11838#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {11842#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:15:32,051 INFO L273 TraceCheckUtils]: 69: Hoare triple {11842#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11571#false} is VALID [2018-11-23 13:15:32,051 INFO L273 TraceCheckUtils]: 70: Hoare triple {11571#false} assume !false; {11571#false} is VALID [2018-11-23 13:15:32,062 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:15:32,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:15:32,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-11-23 13:15:32,080 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 71 [2018-11-23 13:15:32,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:15:32,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 66 states. [2018-11-23 13:15:32,162 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:15:32,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-11-23 13:15:32,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-11-23 13:15:32,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=4160, Unknown=0, NotChecked=0, Total=4290 [2018-11-23 13:15:32,164 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 66 states. [2018-11-23 13:15:40,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:40,653 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-11-23 13:15:40,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-11-23 13:15:40,654 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 71 [2018-11-23 13:15:40,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:15:40,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 13:15:40,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2018-11-23 13:15:40,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 13:15:40,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2018-11-23 13:15:40,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 66 states and 79 transitions. [2018-11-23 13:15:40,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:15:40,775 INFO L225 Difference]: With dead ends: 79 [2018-11-23 13:15:40,775 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 13:15:40,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=138, Invalid=4418, Unknown=0, NotChecked=0, Total=4556 [2018-11-23 13:15:40,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 13:15:40,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-11-23 13:15:40,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:15:40,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 74 states. [2018-11-23 13:15:40,911 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2018-11-23 13:15:40,912 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2018-11-23 13:15:40,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:40,913 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-11-23 13:15:40,913 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-11-23 13:15:40,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:40,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:40,914 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2018-11-23 13:15:40,914 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2018-11-23 13:15:40,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:40,915 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-11-23 13:15:40,915 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-11-23 13:15:40,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:40,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:40,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:15:40,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:15:40,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 13:15:40,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-11-23 13:15:40,916 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2018-11-23 13:15:40,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:15:40,917 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-11-23 13:15:40,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-11-23 13:15:40,917 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-11-23 13:15:40,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 13:15:40,917 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:15:40,917 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:15:40,917 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:15:40,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:40,918 INFO L82 PathProgramCache]: Analyzing trace with hash 124147841, now seen corresponding path program 31 times [2018-11-23 13:15:40,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:40,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:40,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:40,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:40,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:40,926 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:15:40,927 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:15:40,927 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:15:40,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:41,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:43,528 INFO L256 TraceCheckUtils]: 0: Hoare triple {12231#true} call ULTIMATE.init(); {12231#true} is VALID [2018-11-23 13:15:43,529 INFO L273 TraceCheckUtils]: 1: Hoare triple {12231#true} assume true; {12231#true} is VALID [2018-11-23 13:15:43,529 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {12231#true} {12231#true} #37#return; {12231#true} is VALID [2018-11-23 13:15:43,529 INFO L256 TraceCheckUtils]: 3: Hoare triple {12231#true} call #t~ret3 := main(); {12231#true} is VALID [2018-11-23 13:15:43,529 INFO L273 TraceCheckUtils]: 4: Hoare triple {12231#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {12231#true} is VALID [2018-11-23 13:15:43,530 INFO L273 TraceCheckUtils]: 5: Hoare triple {12231#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {12251#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-23 13:15:43,531 INFO L273 TraceCheckUtils]: 6: Hoare triple {12251#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12255#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-23 13:15:43,531 INFO L273 TraceCheckUtils]: 7: Hoare triple {12255#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12259#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} is VALID [2018-11-23 13:15:43,532 INFO L273 TraceCheckUtils]: 8: Hoare triple {12259#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12263#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-23 13:15:43,533 INFO L273 TraceCheckUtils]: 9: Hoare triple {12263#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12267#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-23 13:15:43,533 INFO L273 TraceCheckUtils]: 10: Hoare triple {12267#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12271#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-23 13:15:43,534 INFO L273 TraceCheckUtils]: 11: Hoare triple {12271#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12275#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-23 13:15:43,535 INFO L273 TraceCheckUtils]: 12: Hoare triple {12275#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12279#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-23 13:15:43,536 INFO L273 TraceCheckUtils]: 13: Hoare triple {12279#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12283#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-23 13:15:43,537 INFO L273 TraceCheckUtils]: 14: Hoare triple {12283#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12287#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-23 13:15:43,537 INFO L273 TraceCheckUtils]: 15: Hoare triple {12287#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12291#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-23 13:15:43,538 INFO L273 TraceCheckUtils]: 16: Hoare triple {12291#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12295#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-23 13:15:43,539 INFO L273 TraceCheckUtils]: 17: Hoare triple {12295#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12299#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-23 13:15:43,540 INFO L273 TraceCheckUtils]: 18: Hoare triple {12299#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12303#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} is VALID [2018-11-23 13:15:43,540 INFO L273 TraceCheckUtils]: 19: Hoare triple {12303#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12307#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-23 13:15:43,541 INFO L273 TraceCheckUtils]: 20: Hoare triple {12307#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12311#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} is VALID [2018-11-23 13:15:43,542 INFO L273 TraceCheckUtils]: 21: Hoare triple {12311#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12315#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-23 13:15:43,543 INFO L273 TraceCheckUtils]: 22: Hoare triple {12315#(and (= main_~i~0 9) (= main_~sum~0 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12319#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} is VALID [2018-11-23 13:15:43,543 INFO L273 TraceCheckUtils]: 23: Hoare triple {12319#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12323#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-23 13:15:43,544 INFO L273 TraceCheckUtils]: 24: Hoare triple {12323#(and (= main_~sum~0 45) (= main_~i~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12327#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} is VALID [2018-11-23 13:15:43,545 INFO L273 TraceCheckUtils]: 25: Hoare triple {12327#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12331#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-23 13:15:43,546 INFO L273 TraceCheckUtils]: 26: Hoare triple {12331#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12335#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} is VALID [2018-11-23 13:15:43,546 INFO L273 TraceCheckUtils]: 27: Hoare triple {12335#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12339#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-23 13:15:43,547 INFO L273 TraceCheckUtils]: 28: Hoare triple {12339#(and (= main_~i~0 12) (= main_~sum~0 66))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12343#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} is VALID [2018-11-23 13:15:43,548 INFO L273 TraceCheckUtils]: 29: Hoare triple {12343#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12347#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-23 13:15:43,549 INFO L273 TraceCheckUtils]: 30: Hoare triple {12347#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12351#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2018-11-23 13:15:43,549 INFO L273 TraceCheckUtils]: 31: Hoare triple {12351#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12355#(and (= main_~i~0 14) (= main_~sum~0 91))} is VALID [2018-11-23 13:15:43,550 INFO L273 TraceCheckUtils]: 32: Hoare triple {12355#(and (= main_~i~0 14) (= main_~sum~0 91))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12359#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} is VALID [2018-11-23 13:15:43,551 INFO L273 TraceCheckUtils]: 33: Hoare triple {12359#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12363#(and (= main_~sum~0 105) (= main_~i~0 15))} is VALID [2018-11-23 13:15:43,552 INFO L273 TraceCheckUtils]: 34: Hoare triple {12363#(and (= main_~sum~0 105) (= main_~i~0 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12367#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} is VALID [2018-11-23 13:15:43,552 INFO L273 TraceCheckUtils]: 35: Hoare triple {12367#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12371#(and (= main_~sum~0 120) (= main_~i~0 16))} is VALID [2018-11-23 13:15:43,553 INFO L273 TraceCheckUtils]: 36: Hoare triple {12371#(and (= main_~sum~0 120) (= main_~i~0 16))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12375#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} is VALID [2018-11-23 13:15:43,554 INFO L273 TraceCheckUtils]: 37: Hoare triple {12375#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12379#(and (= main_~i~0 17) (= main_~sum~0 136))} is VALID [2018-11-23 13:15:43,554 INFO L273 TraceCheckUtils]: 38: Hoare triple {12379#(and (= main_~i~0 17) (= main_~sum~0 136))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12383#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} is VALID [2018-11-23 13:15:43,555 INFO L273 TraceCheckUtils]: 39: Hoare triple {12383#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12387#(and (= main_~i~0 18) (= main_~sum~0 153))} is VALID [2018-11-23 13:15:43,556 INFO L273 TraceCheckUtils]: 40: Hoare triple {12387#(and (= main_~i~0 18) (= main_~sum~0 153))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12391#(and (= main_~i~0 18) (= main_~sum~0 (+ main_~i~0 153)))} is VALID [2018-11-23 13:15:43,557 INFO L273 TraceCheckUtils]: 41: Hoare triple {12391#(and (= main_~i~0 18) (= main_~sum~0 (+ main_~i~0 153)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12395#(and (= main_~i~0 19) (= main_~sum~0 171))} is VALID [2018-11-23 13:15:43,557 INFO L273 TraceCheckUtils]: 42: Hoare triple {12395#(and (= main_~i~0 19) (= main_~sum~0 171))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12399#(and (= (+ main_~i~0 171) main_~sum~0) (= main_~i~0 19))} is VALID [2018-11-23 13:15:43,558 INFO L273 TraceCheckUtils]: 43: Hoare triple {12399#(and (= (+ main_~i~0 171) main_~sum~0) (= main_~i~0 19))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12403#(and (= main_~i~0 20) (= main_~sum~0 190))} is VALID [2018-11-23 13:15:43,559 INFO L273 TraceCheckUtils]: 44: Hoare triple {12403#(and (= main_~i~0 20) (= main_~sum~0 190))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12407#(and (= main_~i~0 20) (= main_~sum~0 (+ main_~i~0 190)))} is VALID [2018-11-23 13:15:43,560 INFO L273 TraceCheckUtils]: 45: Hoare triple {12407#(and (= main_~i~0 20) (= main_~sum~0 (+ main_~i~0 190)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12411#(and (= main_~i~0 21) (= main_~sum~0 210))} is VALID [2018-11-23 13:15:43,560 INFO L273 TraceCheckUtils]: 46: Hoare triple {12411#(and (= main_~i~0 21) (= main_~sum~0 210))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12415#(and (= main_~sum~0 (+ main_~i~0 210)) (= main_~i~0 21))} is VALID [2018-11-23 13:15:43,561 INFO L273 TraceCheckUtils]: 47: Hoare triple {12415#(and (= main_~sum~0 (+ main_~i~0 210)) (= main_~i~0 21))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12419#(and (= main_~sum~0 231) (= main_~i~0 22))} is VALID [2018-11-23 13:15:43,562 INFO L273 TraceCheckUtils]: 48: Hoare triple {12419#(and (= main_~sum~0 231) (= main_~i~0 22))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12423#(and (= (+ main_~i~0 231) main_~sum~0) (= main_~i~0 22))} is VALID [2018-11-23 13:15:43,563 INFO L273 TraceCheckUtils]: 49: Hoare triple {12423#(and (= (+ main_~i~0 231) main_~sum~0) (= main_~i~0 22))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12427#(and (= main_~i~0 23) (= main_~sum~0 253))} is VALID [2018-11-23 13:15:43,564 INFO L273 TraceCheckUtils]: 50: Hoare triple {12427#(and (= main_~i~0 23) (= main_~sum~0 253))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12431#(and (= main_~i~0 23) (= main_~sum~0 (+ main_~i~0 253)))} is VALID [2018-11-23 13:15:43,564 INFO L273 TraceCheckUtils]: 51: Hoare triple {12431#(and (= main_~i~0 23) (= main_~sum~0 (+ main_~i~0 253)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12435#(and (= main_~i~0 24) (= main_~sum~0 276))} is VALID [2018-11-23 13:15:43,565 INFO L273 TraceCheckUtils]: 52: Hoare triple {12435#(and (= main_~i~0 24) (= main_~sum~0 276))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12439#(and (= main_~i~0 24) (= (+ main_~i~0 276) main_~sum~0))} is VALID [2018-11-23 13:15:43,566 INFO L273 TraceCheckUtils]: 53: Hoare triple {12439#(and (= main_~i~0 24) (= (+ main_~i~0 276) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12443#(and (= main_~sum~0 300) (= main_~i~0 25))} is VALID [2018-11-23 13:15:43,567 INFO L273 TraceCheckUtils]: 54: Hoare triple {12443#(and (= main_~sum~0 300) (= main_~i~0 25))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12447#(and (= main_~i~0 25) (= main_~sum~0 (+ main_~i~0 300)))} is VALID [2018-11-23 13:15:43,567 INFO L273 TraceCheckUtils]: 55: Hoare triple {12447#(and (= main_~i~0 25) (= main_~sum~0 (+ main_~i~0 300)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12451#(and (= main_~sum~0 325) (= main_~i~0 26))} is VALID [2018-11-23 13:15:43,568 INFO L273 TraceCheckUtils]: 56: Hoare triple {12451#(and (= main_~sum~0 325) (= main_~i~0 26))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12455#(and (= (+ main_~i~0 325) main_~sum~0) (= main_~i~0 26))} is VALID [2018-11-23 13:15:43,569 INFO L273 TraceCheckUtils]: 57: Hoare triple {12455#(and (= (+ main_~i~0 325) main_~sum~0) (= main_~i~0 26))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12459#(and (= main_~i~0 27) (= main_~sum~0 351))} is VALID [2018-11-23 13:15:43,570 INFO L273 TraceCheckUtils]: 58: Hoare triple {12459#(and (= main_~i~0 27) (= main_~sum~0 351))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12463#(and (= main_~i~0 27) (= (+ main_~i~0 351) main_~sum~0))} is VALID [2018-11-23 13:15:43,570 INFO L273 TraceCheckUtils]: 59: Hoare triple {12463#(and (= main_~i~0 27) (= (+ main_~i~0 351) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12467#(and (= main_~sum~0 378) (= main_~i~0 28))} is VALID [2018-11-23 13:15:43,589 INFO L273 TraceCheckUtils]: 60: Hoare triple {12467#(and (= main_~sum~0 378) (= main_~i~0 28))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12471#(and (= main_~i~0 28) (= main_~sum~0 (+ main_~i~0 378)))} is VALID [2018-11-23 13:15:43,590 INFO L273 TraceCheckUtils]: 61: Hoare triple {12471#(and (= main_~i~0 28) (= main_~sum~0 (+ main_~i~0 378)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12475#(and (= main_~i~0 29) (= main_~sum~0 406))} is VALID [2018-11-23 13:15:43,591 INFO L273 TraceCheckUtils]: 62: Hoare triple {12475#(and (= main_~i~0 29) (= main_~sum~0 406))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12479#(and (= main_~sum~0 (+ main_~i~0 406)) (= main_~i~0 29))} is VALID [2018-11-23 13:15:43,591 INFO L273 TraceCheckUtils]: 63: Hoare triple {12479#(and (= main_~sum~0 (+ main_~i~0 406)) (= main_~i~0 29))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12483#(and (= main_~sum~0 435) (= main_~i~0 30))} is VALID [2018-11-23 13:15:43,592 INFO L273 TraceCheckUtils]: 64: Hoare triple {12483#(and (= main_~sum~0 435) (= main_~i~0 30))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12487#(and (= main_~i~0 30) (= main_~sum~0 (+ main_~i~0 435)))} is VALID [2018-11-23 13:15:43,592 INFO L273 TraceCheckUtils]: 65: Hoare triple {12487#(and (= main_~i~0 30) (= main_~sum~0 (+ main_~i~0 435)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12491#(and (= main_~i~0 31) (= main_~sum~0 465))} is VALID [2018-11-23 13:15:43,593 INFO L273 TraceCheckUtils]: 66: Hoare triple {12491#(and (= main_~i~0 31) (= main_~sum~0 465))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12495#(and (<= main_~i~0 main_~n~0) (= main_~i~0 31) (= (+ main_~i~0 465) main_~sum~0))} is VALID [2018-11-23 13:15:43,593 INFO L273 TraceCheckUtils]: 67: Hoare triple {12495#(and (<= main_~i~0 main_~n~0) (= main_~i~0 31) (= (+ main_~i~0 465) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12499#(and (= main_~sum~0 496) (<= main_~i~0 32) (<= 31 main_~n~0))} is VALID [2018-11-23 13:15:43,594 INFO L273 TraceCheckUtils]: 68: Hoare triple {12499#(and (= main_~sum~0 496) (<= main_~i~0 32) (<= 31 main_~n~0))} assume !(~i~0 <= ~n~0); {12503#(and (<= main_~n~0 31) (= main_~sum~0 496) (<= 31 main_~n~0))} is VALID [2018-11-23 13:15:43,594 INFO L256 TraceCheckUtils]: 69: Hoare triple {12503#(and (<= main_~n~0 31) (= main_~sum~0 496) (<= 31 main_~n~0))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {12507#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:15:43,595 INFO L273 TraceCheckUtils]: 70: Hoare triple {12507#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {12511#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:15:43,596 INFO L273 TraceCheckUtils]: 71: Hoare triple {12511#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12232#false} is VALID [2018-11-23 13:15:43,596 INFO L273 TraceCheckUtils]: 72: Hoare triple {12232#false} assume !false; {12232#false} is VALID [2018-11-23 13:15:43,607 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:15:43,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:15:43,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-11-23 13:15:43,626 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 73 [2018-11-23 13:15:43,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:15:43,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 68 states. [2018-11-23 13:15:43,702 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:15:43,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-11-23 13:15:43,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-11-23 13:15:43,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=4422, Unknown=0, NotChecked=0, Total=4556 [2018-11-23 13:15:43,703 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 68 states. [2018-11-23 13:15:52,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:52,663 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-11-23 13:15:52,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-11-23 13:15:52,663 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 73 [2018-11-23 13:15:52,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:15:52,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 13:15:52,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2018-11-23 13:15:52,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 13:15:52,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2018-11-23 13:15:52,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 68 states and 81 transitions. [2018-11-23 13:15:52,742 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:15:52,743 INFO L225 Difference]: With dead ends: 81 [2018-11-23 13:15:52,743 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 13:15:52,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=142, Invalid=4688, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 13:15:52,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 13:15:52,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-11-23 13:15:52,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:15:52,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 76 states. [2018-11-23 13:15:52,824 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2018-11-23 13:15:52,824 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2018-11-23 13:15:52,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:52,825 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-11-23 13:15:52,826 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-11-23 13:15:52,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:52,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:52,826 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2018-11-23 13:15:52,826 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2018-11-23 13:15:52,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:52,827 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-11-23 13:15:52,827 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-11-23 13:15:52,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:52,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:52,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:15:52,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:15:52,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 13:15:52,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-11-23 13:15:52,829 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2018-11-23 13:15:52,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:15:52,830 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-11-23 13:15:52,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-11-23 13:15:52,830 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-11-23 13:15:52,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 13:15:52,830 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:15:52,831 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:15:52,831 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:15:52,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:52,831 INFO L82 PathProgramCache]: Analyzing trace with hash 182351807, now seen corresponding path program 32 times [2018-11-23 13:15:52,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:52,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:52,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:52,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:52,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:52,840 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:15:52,840 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:15:52,840 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:15:52,857 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:15:52,915 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:15:52,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:52,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:55,637 INFO L256 TraceCheckUtils]: 0: Hoare triple {12910#true} call ULTIMATE.init(); {12910#true} is VALID [2018-11-23 13:15:55,637 INFO L273 TraceCheckUtils]: 1: Hoare triple {12910#true} assume true; {12910#true} is VALID [2018-11-23 13:15:55,637 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {12910#true} {12910#true} #37#return; {12910#true} is VALID [2018-11-23 13:15:55,638 INFO L256 TraceCheckUtils]: 3: Hoare triple {12910#true} call #t~ret3 := main(); {12910#true} is VALID [2018-11-23 13:15:55,638 INFO L273 TraceCheckUtils]: 4: Hoare triple {12910#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {12910#true} is VALID [2018-11-23 13:15:55,638 INFO L273 TraceCheckUtils]: 5: Hoare triple {12910#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {12930#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-23 13:15:55,639 INFO L273 TraceCheckUtils]: 6: Hoare triple {12930#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12934#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-23 13:15:55,640 INFO L273 TraceCheckUtils]: 7: Hoare triple {12934#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12938#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2018-11-23 13:15:55,640 INFO L273 TraceCheckUtils]: 8: Hoare triple {12938#(and (= main_~i~0 2) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12942#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-23 13:15:55,641 INFO L273 TraceCheckUtils]: 9: Hoare triple {12942#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12946#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-23 13:15:55,641 INFO L273 TraceCheckUtils]: 10: Hoare triple {12946#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12950#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-23 13:15:55,642 INFO L273 TraceCheckUtils]: 11: Hoare triple {12950#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12954#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-23 13:15:55,642 INFO L273 TraceCheckUtils]: 12: Hoare triple {12954#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12958#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-23 13:15:55,643 INFO L273 TraceCheckUtils]: 13: Hoare triple {12958#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12962#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-23 13:15:55,644 INFO L273 TraceCheckUtils]: 14: Hoare triple {12962#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12966#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-23 13:15:55,644 INFO L273 TraceCheckUtils]: 15: Hoare triple {12966#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12970#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-23 13:15:55,645 INFO L273 TraceCheckUtils]: 16: Hoare triple {12970#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12974#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-23 13:15:55,646 INFO L273 TraceCheckUtils]: 17: Hoare triple {12974#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12978#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-23 13:15:55,647 INFO L273 TraceCheckUtils]: 18: Hoare triple {12978#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12982#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} is VALID [2018-11-23 13:15:55,647 INFO L273 TraceCheckUtils]: 19: Hoare triple {12982#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12986#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-23 13:15:55,648 INFO L273 TraceCheckUtils]: 20: Hoare triple {12986#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12990#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} is VALID [2018-11-23 13:15:55,649 INFO L273 TraceCheckUtils]: 21: Hoare triple {12990#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12994#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-23 13:15:55,650 INFO L273 TraceCheckUtils]: 22: Hoare triple {12994#(and (= main_~i~0 9) (= main_~sum~0 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {12998#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} is VALID [2018-11-23 13:15:55,650 INFO L273 TraceCheckUtils]: 23: Hoare triple {12998#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13002#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-23 13:15:55,651 INFO L273 TraceCheckUtils]: 24: Hoare triple {13002#(and (= main_~sum~0 45) (= main_~i~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13006#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} is VALID [2018-11-23 13:15:55,652 INFO L273 TraceCheckUtils]: 25: Hoare triple {13006#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13010#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-23 13:15:55,653 INFO L273 TraceCheckUtils]: 26: Hoare triple {13010#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13014#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} is VALID [2018-11-23 13:15:55,653 INFO L273 TraceCheckUtils]: 27: Hoare triple {13014#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13018#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-23 13:15:55,654 INFO L273 TraceCheckUtils]: 28: Hoare triple {13018#(and (= main_~i~0 12) (= main_~sum~0 66))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13022#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} is VALID [2018-11-23 13:15:55,655 INFO L273 TraceCheckUtils]: 29: Hoare triple {13022#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13026#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-23 13:15:55,656 INFO L273 TraceCheckUtils]: 30: Hoare triple {13026#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13030#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2018-11-23 13:15:55,656 INFO L273 TraceCheckUtils]: 31: Hoare triple {13030#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13034#(and (= main_~i~0 14) (= main_~sum~0 91))} is VALID [2018-11-23 13:15:55,657 INFO L273 TraceCheckUtils]: 32: Hoare triple {13034#(and (= main_~i~0 14) (= main_~sum~0 91))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13038#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} is VALID [2018-11-23 13:15:55,658 INFO L273 TraceCheckUtils]: 33: Hoare triple {13038#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13042#(and (= main_~sum~0 105) (= main_~i~0 15))} is VALID [2018-11-23 13:15:55,658 INFO L273 TraceCheckUtils]: 34: Hoare triple {13042#(and (= main_~sum~0 105) (= main_~i~0 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13046#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} is VALID [2018-11-23 13:15:55,659 INFO L273 TraceCheckUtils]: 35: Hoare triple {13046#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13050#(and (= main_~sum~0 120) (= main_~i~0 16))} is VALID [2018-11-23 13:15:55,660 INFO L273 TraceCheckUtils]: 36: Hoare triple {13050#(and (= main_~sum~0 120) (= main_~i~0 16))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13054#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} is VALID [2018-11-23 13:15:55,661 INFO L273 TraceCheckUtils]: 37: Hoare triple {13054#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13058#(and (= main_~i~0 17) (= main_~sum~0 136))} is VALID [2018-11-23 13:15:55,661 INFO L273 TraceCheckUtils]: 38: Hoare triple {13058#(and (= main_~i~0 17) (= main_~sum~0 136))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13062#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} is VALID [2018-11-23 13:15:55,662 INFO L273 TraceCheckUtils]: 39: Hoare triple {13062#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13066#(and (= main_~i~0 18) (= main_~sum~0 153))} is VALID [2018-11-23 13:15:55,663 INFO L273 TraceCheckUtils]: 40: Hoare triple {13066#(and (= main_~i~0 18) (= main_~sum~0 153))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13070#(and (= main_~i~0 18) (= main_~sum~0 (+ main_~i~0 153)))} is VALID [2018-11-23 13:15:55,664 INFO L273 TraceCheckUtils]: 41: Hoare triple {13070#(and (= main_~i~0 18) (= main_~sum~0 (+ main_~i~0 153)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13074#(and (= main_~i~0 19) (= main_~sum~0 171))} is VALID [2018-11-23 13:15:55,664 INFO L273 TraceCheckUtils]: 42: Hoare triple {13074#(and (= main_~i~0 19) (= main_~sum~0 171))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13078#(and (= (+ main_~i~0 171) main_~sum~0) (= main_~i~0 19))} is VALID [2018-11-23 13:15:55,665 INFO L273 TraceCheckUtils]: 43: Hoare triple {13078#(and (= (+ main_~i~0 171) main_~sum~0) (= main_~i~0 19))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13082#(and (= main_~i~0 20) (= main_~sum~0 190))} is VALID [2018-11-23 13:15:55,666 INFO L273 TraceCheckUtils]: 44: Hoare triple {13082#(and (= main_~i~0 20) (= main_~sum~0 190))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13086#(and (= main_~i~0 20) (= main_~sum~0 (+ main_~i~0 190)))} is VALID [2018-11-23 13:15:55,667 INFO L273 TraceCheckUtils]: 45: Hoare triple {13086#(and (= main_~i~0 20) (= main_~sum~0 (+ main_~i~0 190)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13090#(and (= main_~i~0 21) (= main_~sum~0 210))} is VALID [2018-11-23 13:15:55,667 INFO L273 TraceCheckUtils]: 46: Hoare triple {13090#(and (= main_~i~0 21) (= main_~sum~0 210))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13094#(and (= main_~sum~0 (+ main_~i~0 210)) (= main_~i~0 21))} is VALID [2018-11-23 13:15:55,668 INFO L273 TraceCheckUtils]: 47: Hoare triple {13094#(and (= main_~sum~0 (+ main_~i~0 210)) (= main_~i~0 21))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13098#(and (= main_~sum~0 231) (= main_~i~0 22))} is VALID [2018-11-23 13:15:55,669 INFO L273 TraceCheckUtils]: 48: Hoare triple {13098#(and (= main_~sum~0 231) (= main_~i~0 22))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13102#(and (= (+ main_~i~0 231) main_~sum~0) (= main_~i~0 22))} is VALID [2018-11-23 13:15:55,670 INFO L273 TraceCheckUtils]: 49: Hoare triple {13102#(and (= (+ main_~i~0 231) main_~sum~0) (= main_~i~0 22))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13106#(and (= main_~i~0 23) (= main_~sum~0 253))} is VALID [2018-11-23 13:15:55,670 INFO L273 TraceCheckUtils]: 50: Hoare triple {13106#(and (= main_~i~0 23) (= main_~sum~0 253))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13110#(and (= main_~i~0 23) (= main_~sum~0 (+ main_~i~0 253)))} is VALID [2018-11-23 13:15:55,671 INFO L273 TraceCheckUtils]: 51: Hoare triple {13110#(and (= main_~i~0 23) (= main_~sum~0 (+ main_~i~0 253)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13114#(and (= main_~i~0 24) (= main_~sum~0 276))} is VALID [2018-11-23 13:15:55,672 INFO L273 TraceCheckUtils]: 52: Hoare triple {13114#(and (= main_~i~0 24) (= main_~sum~0 276))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13118#(and (= main_~i~0 24) (= (+ main_~i~0 276) main_~sum~0))} is VALID [2018-11-23 13:15:55,673 INFO L273 TraceCheckUtils]: 53: Hoare triple {13118#(and (= main_~i~0 24) (= (+ main_~i~0 276) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13122#(and (= main_~sum~0 300) (= main_~i~0 25))} is VALID [2018-11-23 13:15:55,674 INFO L273 TraceCheckUtils]: 54: Hoare triple {13122#(and (= main_~sum~0 300) (= main_~i~0 25))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13126#(and (= main_~i~0 25) (= main_~sum~0 (+ main_~i~0 300)))} is VALID [2018-11-23 13:15:55,675 INFO L273 TraceCheckUtils]: 55: Hoare triple {13126#(and (= main_~i~0 25) (= main_~sum~0 (+ main_~i~0 300)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13130#(and (= main_~sum~0 325) (= main_~i~0 26))} is VALID [2018-11-23 13:15:55,675 INFO L273 TraceCheckUtils]: 56: Hoare triple {13130#(and (= main_~sum~0 325) (= main_~i~0 26))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13134#(and (= (+ main_~i~0 325) main_~sum~0) (= main_~i~0 26))} is VALID [2018-11-23 13:15:55,676 INFO L273 TraceCheckUtils]: 57: Hoare triple {13134#(and (= (+ main_~i~0 325) main_~sum~0) (= main_~i~0 26))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13138#(and (= main_~i~0 27) (= main_~sum~0 351))} is VALID [2018-11-23 13:15:55,677 INFO L273 TraceCheckUtils]: 58: Hoare triple {13138#(and (= main_~i~0 27) (= main_~sum~0 351))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13142#(and (= main_~i~0 27) (= (+ main_~i~0 351) main_~sum~0))} is VALID [2018-11-23 13:15:55,678 INFO L273 TraceCheckUtils]: 59: Hoare triple {13142#(and (= main_~i~0 27) (= (+ main_~i~0 351) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13146#(and (= main_~sum~0 378) (= main_~i~0 28))} is VALID [2018-11-23 13:15:55,678 INFO L273 TraceCheckUtils]: 60: Hoare triple {13146#(and (= main_~sum~0 378) (= main_~i~0 28))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13150#(and (= main_~i~0 28) (= main_~sum~0 (+ main_~i~0 378)))} is VALID [2018-11-23 13:15:55,679 INFO L273 TraceCheckUtils]: 61: Hoare triple {13150#(and (= main_~i~0 28) (= main_~sum~0 (+ main_~i~0 378)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13154#(and (= main_~i~0 29) (= main_~sum~0 406))} is VALID [2018-11-23 13:15:55,680 INFO L273 TraceCheckUtils]: 62: Hoare triple {13154#(and (= main_~i~0 29) (= main_~sum~0 406))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13158#(and (= main_~sum~0 (+ main_~i~0 406)) (= main_~i~0 29))} is VALID [2018-11-23 13:15:55,681 INFO L273 TraceCheckUtils]: 63: Hoare triple {13158#(and (= main_~sum~0 (+ main_~i~0 406)) (= main_~i~0 29))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13162#(and (= main_~sum~0 435) (= main_~i~0 30))} is VALID [2018-11-23 13:15:55,681 INFO L273 TraceCheckUtils]: 64: Hoare triple {13162#(and (= main_~sum~0 435) (= main_~i~0 30))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13166#(and (= main_~i~0 30) (= main_~sum~0 (+ main_~i~0 435)))} is VALID [2018-11-23 13:15:55,682 INFO L273 TraceCheckUtils]: 65: Hoare triple {13166#(and (= main_~i~0 30) (= main_~sum~0 (+ main_~i~0 435)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13170#(and (= main_~i~0 31) (= main_~sum~0 465))} is VALID [2018-11-23 13:15:55,683 INFO L273 TraceCheckUtils]: 66: Hoare triple {13170#(and (= main_~i~0 31) (= main_~sum~0 465))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13174#(and (= main_~i~0 31) (= (+ main_~i~0 465) main_~sum~0))} is VALID [2018-11-23 13:15:55,684 INFO L273 TraceCheckUtils]: 67: Hoare triple {13174#(and (= main_~i~0 31) (= (+ main_~i~0 465) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13178#(and (= main_~sum~0 496) (= main_~i~0 32))} is VALID [2018-11-23 13:15:55,684 INFO L273 TraceCheckUtils]: 68: Hoare triple {13178#(and (= main_~sum~0 496) (= main_~i~0 32))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13182#(and (<= main_~i~0 main_~n~0) (= main_~i~0 32) (= main_~sum~0 (+ main_~i~0 496)))} is VALID [2018-11-23 13:15:55,685 INFO L273 TraceCheckUtils]: 69: Hoare triple {13182#(and (<= main_~i~0 main_~n~0) (= main_~i~0 32) (= main_~sum~0 (+ main_~i~0 496)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13186#(and (<= main_~i~0 33) (= main_~sum~0 528) (<= 32 main_~n~0))} is VALID [2018-11-23 13:15:55,686 INFO L273 TraceCheckUtils]: 70: Hoare triple {13186#(and (<= main_~i~0 33) (= main_~sum~0 528) (<= 32 main_~n~0))} assume !(~i~0 <= ~n~0); {13190#(and (= main_~sum~0 528) (<= 32 main_~n~0) (<= main_~n~0 32))} is VALID [2018-11-23 13:15:55,687 INFO L256 TraceCheckUtils]: 71: Hoare triple {13190#(and (= main_~sum~0 528) (<= 32 main_~n~0) (<= main_~n~0 32))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {13194#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:15:55,688 INFO L273 TraceCheckUtils]: 72: Hoare triple {13194#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {13198#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:15:55,688 INFO L273 TraceCheckUtils]: 73: Hoare triple {13198#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12911#false} is VALID [2018-11-23 13:15:55,689 INFO L273 TraceCheckUtils]: 74: Hoare triple {12911#false} assume !false; {12911#false} is VALID [2018-11-23 13:15:55,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:15:55,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:15:55,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-11-23 13:15:55,719 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 75 [2018-11-23 13:15:55,719 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:15:55,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 70 states. [2018-11-23 13:15:55,789 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:15:55,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-11-23 13:15:55,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-11-23 13:15:55,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=4692, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 13:15:55,790 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 70 states. [2018-11-23 13:16:05,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:05,163 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-11-23 13:16:05,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-11-23 13:16:05,163 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 75 [2018-11-23 13:16:05,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:05,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 13:16:05,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2018-11-23 13:16:05,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 13:16:05,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2018-11-23 13:16:05,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 70 states and 83 transitions. [2018-11-23 13:16:05,243 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:05,244 INFO L225 Difference]: With dead ends: 83 [2018-11-23 13:16:05,244 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 13:16:05,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=146, Invalid=4966, Unknown=0, NotChecked=0, Total=5112 [2018-11-23 13:16:05,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 13:16:05,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-11-23 13:16:05,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:05,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 78 states. [2018-11-23 13:16:05,315 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2018-11-23 13:16:05,315 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2018-11-23 13:16:05,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:05,316 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-11-23 13:16:05,317 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-11-23 13:16:05,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:05,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:05,317 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2018-11-23 13:16:05,317 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2018-11-23 13:16:05,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:05,318 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-11-23 13:16:05,318 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-11-23 13:16:05,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:05,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:05,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:05,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:05,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-23 13:16:05,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-11-23 13:16:05,320 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2018-11-23 13:16:05,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:05,320 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-11-23 13:16:05,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-11-23 13:16:05,320 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-11-23 13:16:05,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 13:16:05,321 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:05,321 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:05,321 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:05,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:05,322 INFO L82 PathProgramCache]: Analyzing trace with hash 281788285, now seen corresponding path program 33 times [2018-11-23 13:16:05,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:05,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:05,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:05,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:05,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:05,329 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:16:05,330 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:16:05,330 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:16:05,348 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:16:06,300 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-11-23 13:16:06,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:16:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:06,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:09,266 INFO L256 TraceCheckUtils]: 0: Hoare triple {13607#true} call ULTIMATE.init(); {13607#true} is VALID [2018-11-23 13:16:09,267 INFO L273 TraceCheckUtils]: 1: Hoare triple {13607#true} assume true; {13607#true} is VALID [2018-11-23 13:16:09,267 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {13607#true} {13607#true} #37#return; {13607#true} is VALID [2018-11-23 13:16:09,267 INFO L256 TraceCheckUtils]: 3: Hoare triple {13607#true} call #t~ret3 := main(); {13607#true} is VALID [2018-11-23 13:16:09,267 INFO L273 TraceCheckUtils]: 4: Hoare triple {13607#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {13607#true} is VALID [2018-11-23 13:16:09,268 INFO L273 TraceCheckUtils]: 5: Hoare triple {13607#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {13627#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-23 13:16:09,268 INFO L273 TraceCheckUtils]: 6: Hoare triple {13627#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13631#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-23 13:16:09,269 INFO L273 TraceCheckUtils]: 7: Hoare triple {13631#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13635#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} is VALID [2018-11-23 13:16:09,270 INFO L273 TraceCheckUtils]: 8: Hoare triple {13635#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13639#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-23 13:16:09,271 INFO L273 TraceCheckUtils]: 9: Hoare triple {13639#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13643#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-23 13:16:09,271 INFO L273 TraceCheckUtils]: 10: Hoare triple {13643#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13647#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-23 13:16:09,272 INFO L273 TraceCheckUtils]: 11: Hoare triple {13647#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13651#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-23 13:16:09,273 INFO L273 TraceCheckUtils]: 12: Hoare triple {13651#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13655#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-23 13:16:09,274 INFO L273 TraceCheckUtils]: 13: Hoare triple {13655#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13659#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-23 13:16:09,274 INFO L273 TraceCheckUtils]: 14: Hoare triple {13659#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13663#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-23 13:16:09,275 INFO L273 TraceCheckUtils]: 15: Hoare triple {13663#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13667#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-23 13:16:09,276 INFO L273 TraceCheckUtils]: 16: Hoare triple {13667#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13671#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-23 13:16:09,277 INFO L273 TraceCheckUtils]: 17: Hoare triple {13671#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13675#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-23 13:16:09,277 INFO L273 TraceCheckUtils]: 18: Hoare triple {13675#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13679#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} is VALID [2018-11-23 13:16:09,278 INFO L273 TraceCheckUtils]: 19: Hoare triple {13679#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13683#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-23 13:16:09,279 INFO L273 TraceCheckUtils]: 20: Hoare triple {13683#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13687#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} is VALID [2018-11-23 13:16:09,280 INFO L273 TraceCheckUtils]: 21: Hoare triple {13687#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13691#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-23 13:16:09,280 INFO L273 TraceCheckUtils]: 22: Hoare triple {13691#(and (= main_~i~0 9) (= main_~sum~0 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13695#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} is VALID [2018-11-23 13:16:09,281 INFO L273 TraceCheckUtils]: 23: Hoare triple {13695#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13699#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-23 13:16:09,282 INFO L273 TraceCheckUtils]: 24: Hoare triple {13699#(and (= main_~sum~0 45) (= main_~i~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13703#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} is VALID [2018-11-23 13:16:09,283 INFO L273 TraceCheckUtils]: 25: Hoare triple {13703#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13707#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-23 13:16:09,283 INFO L273 TraceCheckUtils]: 26: Hoare triple {13707#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13711#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} is VALID [2018-11-23 13:16:09,284 INFO L273 TraceCheckUtils]: 27: Hoare triple {13711#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13715#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-23 13:16:09,285 INFO L273 TraceCheckUtils]: 28: Hoare triple {13715#(and (= main_~i~0 12) (= main_~sum~0 66))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13719#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} is VALID [2018-11-23 13:16:09,286 INFO L273 TraceCheckUtils]: 29: Hoare triple {13719#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13723#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-23 13:16:09,286 INFO L273 TraceCheckUtils]: 30: Hoare triple {13723#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13727#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2018-11-23 13:16:09,287 INFO L273 TraceCheckUtils]: 31: Hoare triple {13727#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13731#(and (= main_~i~0 14) (= main_~sum~0 91))} is VALID [2018-11-23 13:16:09,288 INFO L273 TraceCheckUtils]: 32: Hoare triple {13731#(and (= main_~i~0 14) (= main_~sum~0 91))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13735#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} is VALID [2018-11-23 13:16:09,289 INFO L273 TraceCheckUtils]: 33: Hoare triple {13735#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13739#(and (= main_~sum~0 105) (= main_~i~0 15))} is VALID [2018-11-23 13:16:09,289 INFO L273 TraceCheckUtils]: 34: Hoare triple {13739#(and (= main_~sum~0 105) (= main_~i~0 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13743#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} is VALID [2018-11-23 13:16:09,290 INFO L273 TraceCheckUtils]: 35: Hoare triple {13743#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13747#(and (= main_~sum~0 120) (= main_~i~0 16))} is VALID [2018-11-23 13:16:09,291 INFO L273 TraceCheckUtils]: 36: Hoare triple {13747#(and (= main_~sum~0 120) (= main_~i~0 16))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13751#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} is VALID [2018-11-23 13:16:09,292 INFO L273 TraceCheckUtils]: 37: Hoare triple {13751#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13755#(and (= main_~i~0 17) (= main_~sum~0 136))} is VALID [2018-11-23 13:16:09,292 INFO L273 TraceCheckUtils]: 38: Hoare triple {13755#(and (= main_~i~0 17) (= main_~sum~0 136))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13759#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} is VALID [2018-11-23 13:16:09,293 INFO L273 TraceCheckUtils]: 39: Hoare triple {13759#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13763#(and (= main_~i~0 18) (= main_~sum~0 153))} is VALID [2018-11-23 13:16:09,294 INFO L273 TraceCheckUtils]: 40: Hoare triple {13763#(and (= main_~i~0 18) (= main_~sum~0 153))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13767#(and (= main_~i~0 18) (= main_~sum~0 (+ main_~i~0 153)))} is VALID [2018-11-23 13:16:09,295 INFO L273 TraceCheckUtils]: 41: Hoare triple {13767#(and (= main_~i~0 18) (= main_~sum~0 (+ main_~i~0 153)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13771#(and (= main_~i~0 19) (= main_~sum~0 171))} is VALID [2018-11-23 13:16:09,295 INFO L273 TraceCheckUtils]: 42: Hoare triple {13771#(and (= main_~i~0 19) (= main_~sum~0 171))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13775#(and (= (+ main_~i~0 171) main_~sum~0) (= main_~i~0 19))} is VALID [2018-11-23 13:16:09,296 INFO L273 TraceCheckUtils]: 43: Hoare triple {13775#(and (= (+ main_~i~0 171) main_~sum~0) (= main_~i~0 19))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13779#(and (= main_~i~0 20) (= main_~sum~0 190))} is VALID [2018-11-23 13:16:09,297 INFO L273 TraceCheckUtils]: 44: Hoare triple {13779#(and (= main_~i~0 20) (= main_~sum~0 190))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13783#(and (= main_~i~0 20) (= main_~sum~0 (+ main_~i~0 190)))} is VALID [2018-11-23 13:16:09,298 INFO L273 TraceCheckUtils]: 45: Hoare triple {13783#(and (= main_~i~0 20) (= main_~sum~0 (+ main_~i~0 190)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13787#(and (= main_~i~0 21) (= main_~sum~0 210))} is VALID [2018-11-23 13:16:09,298 INFO L273 TraceCheckUtils]: 46: Hoare triple {13787#(and (= main_~i~0 21) (= main_~sum~0 210))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13791#(and (= main_~sum~0 (+ main_~i~0 210)) (= main_~i~0 21))} is VALID [2018-11-23 13:16:09,299 INFO L273 TraceCheckUtils]: 47: Hoare triple {13791#(and (= main_~sum~0 (+ main_~i~0 210)) (= main_~i~0 21))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13795#(and (= main_~sum~0 231) (= main_~i~0 22))} is VALID [2018-11-23 13:16:09,300 INFO L273 TraceCheckUtils]: 48: Hoare triple {13795#(and (= main_~sum~0 231) (= main_~i~0 22))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13799#(and (= (+ main_~i~0 231) main_~sum~0) (= main_~i~0 22))} is VALID [2018-11-23 13:16:09,301 INFO L273 TraceCheckUtils]: 49: Hoare triple {13799#(and (= (+ main_~i~0 231) main_~sum~0) (= main_~i~0 22))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13803#(and (= main_~i~0 23) (= main_~sum~0 253))} is VALID [2018-11-23 13:16:09,301 INFO L273 TraceCheckUtils]: 50: Hoare triple {13803#(and (= main_~i~0 23) (= main_~sum~0 253))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13807#(and (= main_~i~0 23) (= main_~sum~0 (+ main_~i~0 253)))} is VALID [2018-11-23 13:16:09,302 INFO L273 TraceCheckUtils]: 51: Hoare triple {13807#(and (= main_~i~0 23) (= main_~sum~0 (+ main_~i~0 253)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13811#(and (= main_~i~0 24) (= main_~sum~0 276))} is VALID [2018-11-23 13:16:09,303 INFO L273 TraceCheckUtils]: 52: Hoare triple {13811#(and (= main_~i~0 24) (= main_~sum~0 276))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13815#(and (= main_~i~0 24) (= (+ main_~i~0 276) main_~sum~0))} is VALID [2018-11-23 13:16:09,304 INFO L273 TraceCheckUtils]: 53: Hoare triple {13815#(and (= main_~i~0 24) (= (+ main_~i~0 276) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13819#(and (= main_~sum~0 300) (= main_~i~0 25))} is VALID [2018-11-23 13:16:09,304 INFO L273 TraceCheckUtils]: 54: Hoare triple {13819#(and (= main_~sum~0 300) (= main_~i~0 25))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13823#(and (= main_~i~0 25) (= main_~sum~0 (+ main_~i~0 300)))} is VALID [2018-11-23 13:16:09,305 INFO L273 TraceCheckUtils]: 55: Hoare triple {13823#(and (= main_~i~0 25) (= main_~sum~0 (+ main_~i~0 300)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13827#(and (= main_~sum~0 325) (= main_~i~0 26))} is VALID [2018-11-23 13:16:09,306 INFO L273 TraceCheckUtils]: 56: Hoare triple {13827#(and (= main_~sum~0 325) (= main_~i~0 26))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13831#(and (= (+ main_~i~0 325) main_~sum~0) (= main_~i~0 26))} is VALID [2018-11-23 13:16:09,307 INFO L273 TraceCheckUtils]: 57: Hoare triple {13831#(and (= (+ main_~i~0 325) main_~sum~0) (= main_~i~0 26))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13835#(and (= main_~i~0 27) (= main_~sum~0 351))} is VALID [2018-11-23 13:16:09,307 INFO L273 TraceCheckUtils]: 58: Hoare triple {13835#(and (= main_~i~0 27) (= main_~sum~0 351))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13839#(and (= main_~i~0 27) (= (+ main_~i~0 351) main_~sum~0))} is VALID [2018-11-23 13:16:09,308 INFO L273 TraceCheckUtils]: 59: Hoare triple {13839#(and (= main_~i~0 27) (= (+ main_~i~0 351) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13843#(and (= main_~sum~0 378) (= main_~i~0 28))} is VALID [2018-11-23 13:16:09,309 INFO L273 TraceCheckUtils]: 60: Hoare triple {13843#(and (= main_~sum~0 378) (= main_~i~0 28))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13847#(and (= main_~i~0 28) (= main_~sum~0 (+ main_~i~0 378)))} is VALID [2018-11-23 13:16:09,310 INFO L273 TraceCheckUtils]: 61: Hoare triple {13847#(and (= main_~i~0 28) (= main_~sum~0 (+ main_~i~0 378)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13851#(and (= main_~i~0 29) (= main_~sum~0 406))} is VALID [2018-11-23 13:16:09,310 INFO L273 TraceCheckUtils]: 62: Hoare triple {13851#(and (= main_~i~0 29) (= main_~sum~0 406))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13855#(and (= main_~sum~0 (+ main_~i~0 406)) (= main_~i~0 29))} is VALID [2018-11-23 13:16:09,311 INFO L273 TraceCheckUtils]: 63: Hoare triple {13855#(and (= main_~sum~0 (+ main_~i~0 406)) (= main_~i~0 29))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13859#(and (= main_~sum~0 435) (= main_~i~0 30))} is VALID [2018-11-23 13:16:09,312 INFO L273 TraceCheckUtils]: 64: Hoare triple {13859#(and (= main_~sum~0 435) (= main_~i~0 30))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13863#(and (= main_~i~0 30) (= main_~sum~0 (+ main_~i~0 435)))} is VALID [2018-11-23 13:16:09,313 INFO L273 TraceCheckUtils]: 65: Hoare triple {13863#(and (= main_~i~0 30) (= main_~sum~0 (+ main_~i~0 435)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13867#(and (= main_~i~0 31) (= main_~sum~0 465))} is VALID [2018-11-23 13:16:09,313 INFO L273 TraceCheckUtils]: 66: Hoare triple {13867#(and (= main_~i~0 31) (= main_~sum~0 465))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13871#(and (= main_~i~0 31) (= (+ main_~i~0 465) main_~sum~0))} is VALID [2018-11-23 13:16:09,314 INFO L273 TraceCheckUtils]: 67: Hoare triple {13871#(and (= main_~i~0 31) (= (+ main_~i~0 465) main_~sum~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13875#(and (= main_~sum~0 496) (= main_~i~0 32))} is VALID [2018-11-23 13:16:09,315 INFO L273 TraceCheckUtils]: 68: Hoare triple {13875#(and (= main_~sum~0 496) (= main_~i~0 32))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13879#(and (= main_~i~0 32) (= main_~sum~0 (+ main_~i~0 496)))} is VALID [2018-11-23 13:16:09,316 INFO L273 TraceCheckUtils]: 69: Hoare triple {13879#(and (= main_~i~0 32) (= main_~sum~0 (+ main_~i~0 496)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13883#(and (= main_~i~0 33) (= main_~sum~0 528))} is VALID [2018-11-23 13:16:09,317 INFO L273 TraceCheckUtils]: 70: Hoare triple {13883#(and (= main_~i~0 33) (= main_~sum~0 528))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {13887#(and (<= main_~i~0 main_~n~0) (= main_~i~0 33) (= main_~sum~0 (+ main_~i~0 528)))} is VALID [2018-11-23 13:16:09,317 INFO L273 TraceCheckUtils]: 71: Hoare triple {13887#(and (<= main_~i~0 main_~n~0) (= main_~i~0 33) (= main_~sum~0 (+ main_~i~0 528)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13891#(and (<= 33 main_~n~0) (<= main_~i~0 34) (= main_~sum~0 561))} is VALID [2018-11-23 13:16:09,318 INFO L273 TraceCheckUtils]: 72: Hoare triple {13891#(and (<= 33 main_~n~0) (<= main_~i~0 34) (= main_~sum~0 561))} assume !(~i~0 <= ~n~0); {13895#(and (<= 33 main_~n~0) (<= main_~n~0 33) (= main_~sum~0 561))} is VALID [2018-11-23 13:16:09,319 INFO L256 TraceCheckUtils]: 73: Hoare triple {13895#(and (<= 33 main_~n~0) (<= main_~n~0 33) (= main_~sum~0 561))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {13899#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:16:09,320 INFO L273 TraceCheckUtils]: 74: Hoare triple {13899#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {13903#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:16:09,321 INFO L273 TraceCheckUtils]: 75: Hoare triple {13903#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13608#false} is VALID [2018-11-23 13:16:09,321 INFO L273 TraceCheckUtils]: 76: Hoare triple {13608#false} assume !false; {13608#false} is VALID [2018-11-23 13:16:09,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:09,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:16:09,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-11-23 13:16:09,352 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 77 [2018-11-23 13:16:09,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:09,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 72 states. [2018-11-23 13:16:09,444 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:09,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-11-23 13:16:09,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-11-23 13:16:09,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=4970, Unknown=0, NotChecked=0, Total=5112 [2018-11-23 13:16:09,446 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 72 states.