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/AutomizerC.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-370d6ab [2018-11-14 17:35:46,859 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:35:46,861 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:35:46,872 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:35:46,872 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:35:46,873 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:35:46,875 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:35:46,876 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:35:46,878 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:35:46,879 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:35:46,880 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:35:46,880 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:35:46,881 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:35:46,882 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:35:46,883 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:35:46,884 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:35:46,885 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:35:46,886 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:35:46,888 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:35:46,890 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:35:46,891 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:35:46,893 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:35:46,895 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:35:46,895 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:35:46,895 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:35:46,896 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:35:46,897 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:35:46,898 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:35:46,899 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:35:46,900 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:35:46,901 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:35:46,901 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:35:46,902 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:35:46,902 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:35:46,906 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:35:46,907 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:35:46,907 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-14 17:35:46,932 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:35:46,932 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:35:46,933 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:35:46,933 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:35:46,934 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:35:46,934 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:35:46,934 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:35:46,934 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:35:46,934 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:35:46,935 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:35:46,935 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:35:46,935 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:35:46,935 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:35:46,935 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:35:46,936 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:35:46,936 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:35:46,936 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:35:46,936 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:35:46,936 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:35:46,936 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:35:46,937 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:35:46,937 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:35:46,937 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:35:46,937 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:35:46,937 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:35:46,938 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:35:46,938 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:35:46,938 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:35:46,938 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:35:46,938 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:35:47,016 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:35:47,030 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:35:47,035 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:35:47,037 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:35:47,037 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:35:47,038 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-14 17:35:47,120 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ebf0f24c/95572577db3a402aaafc1b03773dbf20/FLAGf431f26b3 [2018-11-14 17:35:47,607 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:35:47,608 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum_true-unreach-call_true-termination.i [2018-11-14 17:35:47,615 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ebf0f24c/95572577db3a402aaafc1b03773dbf20/FLAGf431f26b3 [2018-11-14 17:35:47,630 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ebf0f24c/95572577db3a402aaafc1b03773dbf20 [2018-11-14 17:35:47,640 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:35:47,641 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:35:47,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:35:47,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:35:47,646 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:35:47,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:35:47" (1/1) ... [2018-11-14 17:35:47,651 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1651d8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:47, skipping insertion in model container [2018-11-14 17:35:47,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:35:47" (1/1) ... [2018-11-14 17:35:47,662 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:35:47,684 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:35:47,920 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:35:47,925 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:35:47,947 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:35:47,965 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:35:47,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:47 WrapperNode [2018-11-14 17:35:47,966 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:35:47,967 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:35:47,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:35:47,967 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:35:47,978 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:47" (1/1) ... [2018-11-14 17:35:47,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:47" (1/1) ... [2018-11-14 17:35:47,984 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:47" (1/1) ... [2018-11-14 17:35:47,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:47" (1/1) ... [2018-11-14 17:35:47,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:47" (1/1) ... [2018-11-14 17:35:47,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:47" (1/1) ... [2018-11-14 17:35:47,997 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:47" (1/1) ... [2018-11-14 17:35:47,998 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:35:47,999 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:35:47,999 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:35:47,999 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:35:48,000 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:47" (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-14 17:35:48,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:35:48,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:35:48,167 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:35:48,167 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:35:48,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:35:48,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 17:35:48,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:35:48,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:35:48,168 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:35:48,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:35:48,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:35:48,795 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:35:48,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:35:48 BoogieIcfgContainer [2018-11-14 17:35:48,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:35:48,797 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:35:48,797 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:35:48,800 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:35:48,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:35:47" (1/3) ... [2018-11-14 17:35:48,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4131f4e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:35:48, skipping insertion in model container [2018-11-14 17:35:48,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:47" (2/3) ... [2018-11-14 17:35:48,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4131f4e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:35:48, skipping insertion in model container [2018-11-14 17:35:48,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:35:48" (3/3) ... [2018-11-14 17:35:48,804 INFO L112 eAbstractionObserver]: Analyzing ICFG gauss_sum_true-unreach-call_true-termination.i [2018-11-14 17:35:48,814 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:35:48,822 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:35:48,840 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:35:48,874 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:35:48,875 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:35:48,875 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:35:48,875 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:35:48,875 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:35:48,875 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:35:48,875 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:35:48,876 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:35:48,876 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:35:48,895 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-14 17:35:48,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 17:35:48,902 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:48,903 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:48,906 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:48,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:48,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1152414567, now seen corresponding path program 1 times [2018-11-14 17:35:48,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:48,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:48,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:48,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:48,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:49,076 INFO L256 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2018-11-14 17:35:49,080 INFO L273 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2018-11-14 17:35:49,081 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #38#return; {24#true} is VALID [2018-11-14 17:35:49,081 INFO L256 TraceCheckUtils]: 3: Hoare triple {24#true} call #t~ret3 := main(); {24#true} is VALID [2018-11-14 17:35:49,082 INFO L273 TraceCheckUtils]: 4: Hoare triple {24#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {24#true} is VALID [2018-11-14 17:35:49,082 INFO L273 TraceCheckUtils]: 5: Hoare triple {24#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {24#true} is VALID [2018-11-14 17:35:49,092 INFO L273 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2018-11-14 17:35:49,093 INFO L256 TraceCheckUtils]: 7: Hoare triple {25#false} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (~n~0 + 1) then 1 else 0)); {25#false} is VALID [2018-11-14 17:35:49,093 INFO L273 TraceCheckUtils]: 8: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2018-11-14 17:35:49,093 INFO L273 TraceCheckUtils]: 9: Hoare triple {25#false} assume ~cond == 0; {25#false} is VALID [2018-11-14 17:35:49,094 INFO L273 TraceCheckUtils]: 10: Hoare triple {25#false} assume !false; {25#false} is VALID [2018-11-14 17:35:49,097 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-14 17:35:49,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:35:49,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:35:49,104 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 17:35:49,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:49,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:35:49,171 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-14 17:35:49,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:35:49,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:35:49,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:35:49,185 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-14 17:35:49,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:49,316 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-14 17:35:49,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:35:49,316 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 17:35:49,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:49,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:35:49,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2018-11-14 17:35:49,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:35:49,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2018-11-14 17:35:49,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 37 transitions. [2018-11-14 17:35:49,642 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-14 17:35:49,654 INFO L225 Difference]: With dead ends: 33 [2018-11-14 17:35:49,654 INFO L226 Difference]: Without dead ends: 14 [2018-11-14 17:35:49,657 INFO L604 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-14 17:35:49,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-14 17:35:49,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-14 17:35:49,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:49,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-14 17:35:49,781 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 17:35:49,781 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 17:35:49,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:49,785 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-14 17:35:49,785 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 17:35:49,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:49,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:49,786 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 17:35:49,786 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 17:35:49,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:49,789 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-14 17:35:49,789 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 17:35:49,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:49,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:49,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:49,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:49,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:35:49,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-14 17:35:49,794 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-11-14 17:35:49,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:49,795 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-14 17:35:49,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:35:49,795 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 17:35:49,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 17:35:49,796 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:49,796 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:49,796 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:49,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:49,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1083883255, now seen corresponding path program 1 times [2018-11-14 17:35:49,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:49,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:49,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:49,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:49,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:49,805 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:35:49,806 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:35:49,806 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-14 17:35:49,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:49,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:49,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:35:50,251 INFO L256 TraceCheckUtils]: 0: Hoare triple {119#true} call ULTIMATE.init(); {119#true} is VALID [2018-11-14 17:35:50,252 INFO L273 TraceCheckUtils]: 1: Hoare triple {119#true} assume true; {119#true} is VALID [2018-11-14 17:35:50,252 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {119#true} {119#true} #38#return; {119#true} is VALID [2018-11-14 17:35:50,253 INFO L256 TraceCheckUtils]: 3: Hoare triple {119#true} call #t~ret3 := main(); {119#true} is VALID [2018-11-14 17:35:50,253 INFO L273 TraceCheckUtils]: 4: Hoare triple {119#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {119#true} is VALID [2018-11-14 17:35:50,262 INFO L273 TraceCheckUtils]: 5: Hoare triple {119#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {139#(and (<= main_~i~0 1) (<= 1 main_~n~0))} is VALID [2018-11-14 17:35:50,276 INFO L273 TraceCheckUtils]: 6: Hoare triple {139#(and (<= main_~i~0 1) (<= 1 main_~n~0))} assume true; {139#(and (<= main_~i~0 1) (<= 1 main_~n~0))} is VALID [2018-11-14 17:35:50,294 INFO L273 TraceCheckUtils]: 7: Hoare triple {139#(and (<= main_~i~0 1) (<= 1 main_~n~0))} assume !(~i~0 <= ~n~0); {120#false} is VALID [2018-11-14 17:35:50,295 INFO L256 TraceCheckUtils]: 8: Hoare triple {120#false} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (~n~0 + 1) then 1 else 0)); {120#false} is VALID [2018-11-14 17:35:50,295 INFO L273 TraceCheckUtils]: 9: Hoare triple {120#false} ~cond := #in~cond; {120#false} is VALID [2018-11-14 17:35:50,295 INFO L273 TraceCheckUtils]: 10: Hoare triple {120#false} assume ~cond == 0; {120#false} is VALID [2018-11-14 17:35:50,296 INFO L273 TraceCheckUtils]: 11: Hoare triple {120#false} assume !false; {120#false} is VALID [2018-11-14 17:35:50,297 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-14 17:35:50,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:35:50,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:35:50,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-14 17:35:50,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:50,330 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:35:50,363 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:50,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:35:50,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:35:50,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:35:50,365 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 3 states. [2018-11-14 17:35:50,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:50,550 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-14 17:35:50,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:35:50,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-14 17:35:50,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:50,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:35:50,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-11-14 17:35:50,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:35:50,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-11-14 17:35:50,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 22 transitions. [2018-11-14 17:35:50,631 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:50,633 INFO L225 Difference]: With dead ends: 22 [2018-11-14 17:35:50,633 INFO L226 Difference]: Without dead ends: 17 [2018-11-14 17:35:50,634 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-14 17:35:50,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-14 17:35:50,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-11-14 17:35:50,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:50,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 16 states. [2018-11-14 17:35:50,675 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 16 states. [2018-11-14 17:35:50,676 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 16 states. [2018-11-14 17:35:50,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:50,678 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-14 17:35:50,678 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-14 17:35:50,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:50,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:50,679 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 17 states. [2018-11-14 17:35:50,679 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 17 states. [2018-11-14 17:35:50,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:50,681 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-14 17:35:50,681 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-14 17:35:50,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:50,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:50,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:50,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:50,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 17:35:50,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-14 17:35:50,684 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2018-11-14 17:35:50,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:50,685 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-14 17:35:50,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:35:50,685 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-14 17:35:50,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 17:35:50,686 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:50,686 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:50,686 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:50,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:50,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1128913667, now seen corresponding path program 1 times [2018-11-14 17:35:50,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:50,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:50,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:50,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:50,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:50,702 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:35:50,702 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:35:50,702 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-14 17:35:50,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:50,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:50,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:35:51,173 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-14 17:35:51,471 INFO L256 TraceCheckUtils]: 0: Hoare triple {247#true} call ULTIMATE.init(); {247#true} is VALID [2018-11-14 17:35:51,472 INFO L273 TraceCheckUtils]: 1: Hoare triple {247#true} assume true; {247#true} is VALID [2018-11-14 17:35:51,472 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {247#true} {247#true} #38#return; {247#true} is VALID [2018-11-14 17:35:51,472 INFO L256 TraceCheckUtils]: 3: Hoare triple {247#true} call #t~ret3 := main(); {247#true} is VALID [2018-11-14 17:35:51,472 INFO L273 TraceCheckUtils]: 4: Hoare triple {247#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {247#true} is VALID [2018-11-14 17:35:51,473 INFO L273 TraceCheckUtils]: 5: Hoare triple {247#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {267#(and (= main_~sum~0 0) (= main_~i~0 1) (<= 1 main_~n~0))} is VALID [2018-11-14 17:35:51,474 INFO L273 TraceCheckUtils]: 6: Hoare triple {267#(and (= main_~sum~0 0) (= main_~i~0 1) (<= 1 main_~n~0))} assume true; {267#(and (= main_~sum~0 0) (= main_~i~0 1) (<= 1 main_~n~0))} is VALID [2018-11-14 17:35:51,474 INFO L273 TraceCheckUtils]: 7: Hoare triple {267#(and (= main_~sum~0 0) (= main_~i~0 1) (<= 1 main_~n~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {274#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1) (<= 1 main_~n~0))} is VALID [2018-11-14 17:35:51,475 INFO L273 TraceCheckUtils]: 8: Hoare triple {274#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1) (<= 1 main_~n~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {278#(and (<= main_~i~0 2) (= main_~sum~0 1) (<= 1 main_~n~0))} is VALID [2018-11-14 17:35:51,476 INFO L273 TraceCheckUtils]: 9: Hoare triple {278#(and (<= main_~i~0 2) (= main_~sum~0 1) (<= 1 main_~n~0))} assume true; {278#(and (<= main_~i~0 2) (= main_~sum~0 1) (<= 1 main_~n~0))} is VALID [2018-11-14 17:35:51,477 INFO L273 TraceCheckUtils]: 10: Hoare triple {278#(and (<= main_~i~0 2) (= main_~sum~0 1) (<= 1 main_~n~0))} assume !(~i~0 <= ~n~0); {285#(and (= main_~sum~0 1) (<= 1 main_~n~0) (<= main_~n~0 1))} is VALID [2018-11-14 17:35:51,479 INFO L256 TraceCheckUtils]: 11: Hoare triple {285#(and (= main_~sum~0 1) (<= 1 main_~n~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (~n~0 + 1) then 1 else 0)); {289#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:35:51,480 INFO L273 TraceCheckUtils]: 12: Hoare triple {289#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {293#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:35:51,481 INFO L273 TraceCheckUtils]: 13: Hoare triple {293#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {248#false} is VALID [2018-11-14 17:35:51,481 INFO L273 TraceCheckUtils]: 14: Hoare triple {248#false} assume !false; {248#false} is VALID [2018-11-14 17:35:51,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:35:51,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:35:51,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-14 17:35:51,506 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-11-14 17:35:51,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:51,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 17:35:51,569 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-14 17:35:51,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 17:35:51,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 17:35:51,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:35:51,570 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 8 states. [2018-11-14 17:35:52,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:52,039 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-14 17:35:52,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:35:52,040 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-11-14 17:35:52,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:52,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:35:52,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2018-11-14 17:35:52,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:35:52,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2018-11-14 17:35:52,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 24 transitions. [2018-11-14 17:35:52,086 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:52,087 INFO L225 Difference]: With dead ends: 24 [2018-11-14 17:35:52,087 INFO L226 Difference]: Without dead ends: 19 [2018-11-14 17:35:52,088 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:35:52,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-14 17:35:52,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-14 17:35:52,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:52,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-14 17:35:52,112 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-14 17:35:52,112 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-14 17:35:52,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:52,114 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-14 17:35:52,114 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-14 17:35:52,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:52,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:52,115 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-14 17:35:52,115 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-14 17:35:52,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:52,117 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-14 17:35:52,117 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-14 17:35:52,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:52,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:52,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:52,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:52,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 17:35:52,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-14 17:35:52,120 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 15 [2018-11-14 17:35:52,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:52,121 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-11-14 17:35:52,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 17:35:52,121 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-14 17:35:52,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 17:35:52,122 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:52,122 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:52,122 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:52,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:52,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1694846089, now seen corresponding path program 2 times [2018-11-14 17:35:52,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:52,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:52,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:52,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:52,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:52,133 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:35:52,133 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:35:52,133 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-14 17:35:52,146 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:35:52,159 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:35:52,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:35:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:52,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:35:52,473 INFO L256 TraceCheckUtils]: 0: Hoare triple {404#true} call ULTIMATE.init(); {404#true} is VALID [2018-11-14 17:35:52,473 INFO L273 TraceCheckUtils]: 1: Hoare triple {404#true} assume true; {404#true} is VALID [2018-11-14 17:35:52,473 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {404#true} {404#true} #38#return; {404#true} is VALID [2018-11-14 17:35:52,473 INFO L256 TraceCheckUtils]: 3: Hoare triple {404#true} call #t~ret3 := main(); {404#true} is VALID [2018-11-14 17:35:52,474 INFO L273 TraceCheckUtils]: 4: Hoare triple {404#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {404#true} is VALID [2018-11-14 17:35:52,475 INFO L273 TraceCheckUtils]: 5: Hoare triple {404#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {424#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-14 17:35:52,475 INFO L273 TraceCheckUtils]: 6: Hoare triple {424#(and (= main_~sum~0 0) (= main_~i~0 1))} assume true; {424#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-14 17:35:52,476 INFO L273 TraceCheckUtils]: 7: Hoare triple {424#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {431#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-14 17:35:52,477 INFO L273 TraceCheckUtils]: 8: Hoare triple {431#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {435#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} is VALID [2018-11-14 17:35:52,477 INFO L273 TraceCheckUtils]: 9: Hoare triple {435#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} assume true; {435#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} is VALID [2018-11-14 17:35:52,478 INFO L273 TraceCheckUtils]: 10: Hoare triple {435#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {442#(and (= main_~i~0 2) (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-14 17:35:52,479 INFO L273 TraceCheckUtils]: 11: Hoare triple {442#(and (= main_~i~0 2) (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {446#(and (<= main_~i~0 3) (<= 2 main_~n~0) (= main_~sum~0 3))} is VALID [2018-11-14 17:35:52,480 INFO L273 TraceCheckUtils]: 12: Hoare triple {446#(and (<= main_~i~0 3) (<= 2 main_~n~0) (= main_~sum~0 3))} assume true; {446#(and (<= main_~i~0 3) (<= 2 main_~n~0) (= main_~sum~0 3))} is VALID [2018-11-14 17:35:52,485 INFO L273 TraceCheckUtils]: 13: Hoare triple {446#(and (<= main_~i~0 3) (<= 2 main_~n~0) (= main_~sum~0 3))} assume !(~i~0 <= ~n~0); {453#(and (<= 2 main_~n~0) (<= main_~n~0 2) (= main_~sum~0 3))} is VALID [2018-11-14 17:35:52,487 INFO L256 TraceCheckUtils]: 14: Hoare triple {453#(and (<= 2 main_~n~0) (<= main_~n~0 2) (= main_~sum~0 3))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (~n~0 + 1) then 1 else 0)); {457#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:35:52,489 INFO L273 TraceCheckUtils]: 15: Hoare triple {457#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {461#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:35:52,489 INFO L273 TraceCheckUtils]: 16: Hoare triple {461#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {405#false} is VALID [2018-11-14 17:35:52,489 INFO L273 TraceCheckUtils]: 17: Hoare triple {405#false} assume !false; {405#false} is VALID [2018-11-14 17:35:52,491 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:35:52,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:35:52,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-11-14 17:35:52,512 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-11-14 17:35:52,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:52,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 17:35:52,532 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:52,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 17:35:52,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 17:35:52,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:35:52,534 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2018-11-14 17:35:52,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:52,949 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-14 17:35:52,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 17:35:52,950 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-11-14 17:35:52,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:52,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:35:52,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 27 transitions. [2018-11-14 17:35:52,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:35:52,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 27 transitions. [2018-11-14 17:35:52,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 27 transitions. [2018-11-14 17:35:52,996 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-14 17:35:52,997 INFO L225 Difference]: With dead ends: 27 [2018-11-14 17:35:52,998 INFO L226 Difference]: Without dead ends: 22 [2018-11-14 17:35:52,998 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:35:52,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-14 17:35:53,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-14 17:35:53,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:53,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-14 17:35:53,013 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 17:35:53,014 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 17:35:53,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:53,015 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-14 17:35:53,016 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-14 17:35:53,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:53,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:53,017 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 17:35:53,017 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 17:35:53,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:53,019 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-14 17:35:53,019 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-14 17:35:53,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:53,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:53,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:53,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:53,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 17:35:53,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-14 17:35:53,022 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 18 [2018-11-14 17:35:53,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:53,022 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-14 17:35:53,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 17:35:53,022 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-14 17:35:53,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 17:35:53,023 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:53,023 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:53,023 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:53,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:53,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1202689667, now seen corresponding path program 3 times [2018-11-14 17:35:53,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:53,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:53,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:53,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:35:53,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:53,033 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:35:53,034 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:35:53,034 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-14 17:35:53,046 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:35:53,058 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-14 17:35:53,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:35:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:53,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:35:53,400 INFO L256 TraceCheckUtils]: 0: Hoare triple {586#true} call ULTIMATE.init(); {586#true} is VALID [2018-11-14 17:35:53,401 INFO L273 TraceCheckUtils]: 1: Hoare triple {586#true} assume true; {586#true} is VALID [2018-11-14 17:35:53,401 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {586#true} {586#true} #38#return; {586#true} is VALID [2018-11-14 17:35:53,402 INFO L256 TraceCheckUtils]: 3: Hoare triple {586#true} call #t~ret3 := main(); {586#true} is VALID [2018-11-14 17:35:53,402 INFO L273 TraceCheckUtils]: 4: Hoare triple {586#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {586#true} is VALID [2018-11-14 17:35:53,407 INFO L273 TraceCheckUtils]: 5: Hoare triple {586#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {606#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-14 17:35:53,409 INFO L273 TraceCheckUtils]: 6: Hoare triple {606#(and (= main_~sum~0 0) (= main_~i~0 1))} assume true; {606#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-14 17:35:53,410 INFO L273 TraceCheckUtils]: 7: Hoare triple {606#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {613#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-14 17:35:53,411 INFO L273 TraceCheckUtils]: 8: Hoare triple {613#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {617#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2018-11-14 17:35:53,412 INFO L273 TraceCheckUtils]: 9: Hoare triple {617#(and (= main_~i~0 2) (= main_~sum~0 1))} assume true; {617#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2018-11-14 17:35:53,412 INFO L273 TraceCheckUtils]: 10: Hoare triple {617#(and (= main_~i~0 2) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {624#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-14 17:35:53,413 INFO L273 TraceCheckUtils]: 11: Hoare triple {624#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {628#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-14 17:35:53,414 INFO L273 TraceCheckUtils]: 12: Hoare triple {628#(and (= main_~i~0 3) (= main_~sum~0 3))} assume true; {628#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-14 17:35:53,414 INFO L273 TraceCheckUtils]: 13: Hoare triple {628#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {635#(and (= main_~i~0 3) (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-14 17:35:53,416 INFO L273 TraceCheckUtils]: 14: Hoare triple {635#(and (= main_~i~0 3) (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {639#(and (<= 3 main_~n~0) (= main_~sum~0 6) (<= main_~i~0 4))} is VALID [2018-11-14 17:35:53,421 INFO L273 TraceCheckUtils]: 15: Hoare triple {639#(and (<= 3 main_~n~0) (= main_~sum~0 6) (<= main_~i~0 4))} assume true; {639#(and (<= 3 main_~n~0) (= main_~sum~0 6) (<= main_~i~0 4))} is VALID [2018-11-14 17:35:53,422 INFO L273 TraceCheckUtils]: 16: Hoare triple {639#(and (<= 3 main_~n~0) (= main_~sum~0 6) (<= main_~i~0 4))} assume !(~i~0 <= ~n~0); {646#(and (<= 3 main_~n~0) (= main_~sum~0 6) (<= main_~n~0 3))} is VALID [2018-11-14 17:35:53,426 INFO L256 TraceCheckUtils]: 17: Hoare triple {646#(and (<= 3 main_~n~0) (= main_~sum~0 6) (<= main_~n~0 3))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (~n~0 + 1) then 1 else 0)); {650#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:35:53,427 INFO L273 TraceCheckUtils]: 18: Hoare triple {650#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {654#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:35:53,428 INFO L273 TraceCheckUtils]: 19: Hoare triple {654#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {587#false} is VALID [2018-11-14 17:35:53,428 INFO L273 TraceCheckUtils]: 20: Hoare triple {587#false} assume !false; {587#false} is VALID [2018-11-14 17:35:53,430 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:35:53,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:35:53,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-11-14 17:35:53,452 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-11-14 17:35:53,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:53,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 17:35:53,480 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-14 17:35:53,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 17:35:53,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 17:35:53,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:35:53,482 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 12 states. [2018-11-14 17:35:54,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:54,091 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-14 17:35:54,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 17:35:54,092 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-11-14 17:35:54,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:54,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:35:54,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 30 transitions. [2018-11-14 17:35:54,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:35:54,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 30 transitions. [2018-11-14 17:35:54,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 30 transitions. [2018-11-14 17:35:54,132 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:54,134 INFO L225 Difference]: With dead ends: 30 [2018-11-14 17:35:54,134 INFO L226 Difference]: Without dead ends: 25 [2018-11-14 17:35:54,135 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 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-14 17:35:54,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-14 17:35:54,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-14 17:35:54,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:54,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-14 17:35:54,161 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-14 17:35:54,161 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-14 17:35:54,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:54,163 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-14 17:35:54,163 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-14 17:35:54,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:54,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:54,164 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-14 17:35:54,164 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-14 17:35:54,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:54,166 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-14 17:35:54,166 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-14 17:35:54,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:54,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:54,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:54,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:54,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 17:35:54,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-11-14 17:35:54,169 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 21 [2018-11-14 17:35:54,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:54,169 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-11-14 17:35:54,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 17:35:54,170 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-14 17:35:54,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 17:35:54,170 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:54,171 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:54,171 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:54,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:54,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1437681655, now seen corresponding path program 4 times [2018-11-14 17:35:54,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:54,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:54,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:54,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:35:54,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:54,185 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:35:54,186 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:35:54,186 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-14 17:35:54,197 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:35:54,235 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:35:54,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:35:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:54,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:35:54,711 INFO L256 TraceCheckUtils]: 0: Hoare triple {793#true} call ULTIMATE.init(); {793#true} is VALID [2018-11-14 17:35:54,711 INFO L273 TraceCheckUtils]: 1: Hoare triple {793#true} assume true; {793#true} is VALID [2018-11-14 17:35:54,712 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {793#true} {793#true} #38#return; {793#true} is VALID [2018-11-14 17:35:54,712 INFO L256 TraceCheckUtils]: 3: Hoare triple {793#true} call #t~ret3 := main(); {793#true} is VALID [2018-11-14 17:35:54,712 INFO L273 TraceCheckUtils]: 4: Hoare triple {793#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {793#true} is VALID [2018-11-14 17:35:54,717 INFO L273 TraceCheckUtils]: 5: Hoare triple {793#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {813#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-14 17:35:54,720 INFO L273 TraceCheckUtils]: 6: Hoare triple {813#(and (= main_~sum~0 0) (= main_~i~0 1))} assume true; {813#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-14 17:35:54,723 INFO L273 TraceCheckUtils]: 7: Hoare triple {813#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {820#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-14 17:35:54,723 INFO L273 TraceCheckUtils]: 8: Hoare triple {820#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {824#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} is VALID [2018-11-14 17:35:54,725 INFO L273 TraceCheckUtils]: 9: Hoare triple {824#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} assume true; {824#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} is VALID [2018-11-14 17:35:54,725 INFO L273 TraceCheckUtils]: 10: Hoare triple {824#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {831#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-14 17:35:54,727 INFO L273 TraceCheckUtils]: 11: Hoare triple {831#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {835#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-14 17:35:54,727 INFO L273 TraceCheckUtils]: 12: Hoare triple {835#(and (= main_~i~0 3) (= main_~sum~0 3))} assume true; {835#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-14 17:35:54,729 INFO L273 TraceCheckUtils]: 13: Hoare triple {835#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {842#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-14 17:35:54,730 INFO L273 TraceCheckUtils]: 14: Hoare triple {842#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {846#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-14 17:35:54,741 INFO L273 TraceCheckUtils]: 15: Hoare triple {846#(and (= main_~sum~0 6) (= main_~i~0 4))} assume true; {846#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-14 17:35:54,742 INFO L273 TraceCheckUtils]: 16: Hoare triple {846#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {853#(and (= main_~sum~0 (+ main_~i~0 6)) (<= main_~i~0 main_~n~0) (= main_~i~0 4))} is VALID [2018-11-14 17:35:54,744 INFO L273 TraceCheckUtils]: 17: Hoare triple {853#(and (= main_~sum~0 (+ main_~i~0 6)) (<= main_~i~0 main_~n~0) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {857#(and (<= main_~i~0 5) (<= 4 main_~n~0) (= main_~sum~0 10))} is VALID [2018-11-14 17:35:54,744 INFO L273 TraceCheckUtils]: 18: Hoare triple {857#(and (<= main_~i~0 5) (<= 4 main_~n~0) (= main_~sum~0 10))} assume true; {857#(and (<= main_~i~0 5) (<= 4 main_~n~0) (= main_~sum~0 10))} is VALID [2018-11-14 17:35:54,745 INFO L273 TraceCheckUtils]: 19: Hoare triple {857#(and (<= main_~i~0 5) (<= 4 main_~n~0) (= main_~sum~0 10))} assume !(~i~0 <= ~n~0); {864#(and (<= main_~n~0 4) (<= 4 main_~n~0) (= main_~sum~0 10))} is VALID [2018-11-14 17:35:54,755 INFO L256 TraceCheckUtils]: 20: Hoare triple {864#(and (<= main_~n~0 4) (<= 4 main_~n~0) (= main_~sum~0 10))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (~n~0 + 1) then 1 else 0)); {868#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:35:54,755 INFO L273 TraceCheckUtils]: 21: Hoare triple {868#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {872#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:35:54,756 INFO L273 TraceCheckUtils]: 22: Hoare triple {872#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {794#false} is VALID [2018-11-14 17:35:54,756 INFO L273 TraceCheckUtils]: 23: Hoare triple {794#false} assume !false; {794#false} is VALID [2018-11-14 17:35:54,759 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:35:54,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:35:54,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-11-14 17:35:54,786 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-11-14 17:35:54,786 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:54,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 17:35:54,827 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:54,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 17:35:54,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 17:35:54,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:35:54,828 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2018-11-14 17:35:55,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:55,525 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-14 17:35:55,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 17:35:55,526 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-11-14 17:35:55,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:55,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:35:55,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 33 transitions. [2018-11-14 17:35:55,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:35:55,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 33 transitions. [2018-11-14 17:35:55,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 33 transitions. [2018-11-14 17:35:55,568 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-14 17:35:55,570 INFO L225 Difference]: With dead ends: 33 [2018-11-14 17:35:55,570 INFO L226 Difference]: Without dead ends: 28 [2018-11-14 17:35:55,571 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-11-14 17:35:55,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-14 17:35:55,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-14 17:35:55,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:55,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-14 17:35:55,593 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 17:35:55,593 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 17:35:55,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:55,595 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-14 17:35:55,596 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-14 17:35:55,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:55,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:55,597 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 17:35:55,597 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 17:35:55,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:55,598 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-14 17:35:55,599 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-14 17:35:55,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:55,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:55,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:55,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:55,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 17:35:55,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-11-14 17:35:55,601 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 24 [2018-11-14 17:35:55,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:55,602 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-11-14 17:35:55,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 17:35:55,602 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-14 17:35:55,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 17:35:55,603 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:55,603 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:55,603 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:55,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:55,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1287303683, now seen corresponding path program 5 times [2018-11-14 17:35:55,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:55,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:55,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:55,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:35:55,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:55,616 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:35:55,617 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:35:55,617 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-14 17:35:55,626 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:35:55,641 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-14 17:35:55,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:35:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:55,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:35:56,173 INFO L256 TraceCheckUtils]: 0: Hoare triple {1025#true} call ULTIMATE.init(); {1025#true} is VALID [2018-11-14 17:35:56,173 INFO L273 TraceCheckUtils]: 1: Hoare triple {1025#true} assume true; {1025#true} is VALID [2018-11-14 17:35:56,174 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1025#true} {1025#true} #38#return; {1025#true} is VALID [2018-11-14 17:35:56,174 INFO L256 TraceCheckUtils]: 3: Hoare triple {1025#true} call #t~ret3 := main(); {1025#true} is VALID [2018-11-14 17:35:56,174 INFO L273 TraceCheckUtils]: 4: Hoare triple {1025#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1025#true} is VALID [2018-11-14 17:35:56,181 INFO L273 TraceCheckUtils]: 5: Hoare triple {1025#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {1045#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-14 17:35:56,182 INFO L273 TraceCheckUtils]: 6: Hoare triple {1045#(and (= main_~sum~0 0) (= main_~i~0 1))} assume true; {1045#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-14 17:35:56,182 INFO L273 TraceCheckUtils]: 7: Hoare triple {1045#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1052#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-14 17:35:56,183 INFO L273 TraceCheckUtils]: 8: Hoare triple {1052#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1056#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2018-11-14 17:35:56,184 INFO L273 TraceCheckUtils]: 9: Hoare triple {1056#(and (= main_~i~0 2) (= main_~sum~0 1))} assume true; {1056#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2018-11-14 17:35:56,184 INFO L273 TraceCheckUtils]: 10: Hoare triple {1056#(and (= main_~i~0 2) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1063#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-14 17:35:56,185 INFO L273 TraceCheckUtils]: 11: Hoare triple {1063#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1067#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-14 17:35:56,186 INFO L273 TraceCheckUtils]: 12: Hoare triple {1067#(and (= main_~i~0 3) (= main_~sum~0 3))} assume true; {1067#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-14 17:35:56,187 INFO L273 TraceCheckUtils]: 13: Hoare triple {1067#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1074#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-14 17:35:56,189 INFO L273 TraceCheckUtils]: 14: Hoare triple {1074#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1078#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-14 17:35:56,190 INFO L273 TraceCheckUtils]: 15: Hoare triple {1078#(and (= main_~sum~0 6) (= main_~i~0 4))} assume true; {1078#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-14 17:35:56,191 INFO L273 TraceCheckUtils]: 16: Hoare triple {1078#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1085#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-14 17:35:56,192 INFO L273 TraceCheckUtils]: 17: Hoare triple {1085#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1089#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-14 17:35:56,194 INFO L273 TraceCheckUtils]: 18: Hoare triple {1089#(and (= main_~sum~0 10) (= main_~i~0 5))} assume true; {1089#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-14 17:35:56,195 INFO L273 TraceCheckUtils]: 19: Hoare triple {1089#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1096#(and (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-14 17:35:56,204 INFO L273 TraceCheckUtils]: 20: Hoare triple {1096#(and (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1100#(and (= main_~sum~0 15) (<= 5 main_~n~0) (<= main_~i~0 6))} is VALID [2018-11-14 17:35:56,210 INFO L273 TraceCheckUtils]: 21: Hoare triple {1100#(and (= main_~sum~0 15) (<= 5 main_~n~0) (<= main_~i~0 6))} assume true; {1100#(and (= main_~sum~0 15) (<= 5 main_~n~0) (<= main_~i~0 6))} is VALID [2018-11-14 17:35:56,211 INFO L273 TraceCheckUtils]: 22: Hoare triple {1100#(and (= main_~sum~0 15) (<= 5 main_~n~0) (<= main_~i~0 6))} assume !(~i~0 <= ~n~0); {1107#(and (= main_~sum~0 15) (<= main_~n~0 5) (<= 5 main_~n~0))} is VALID [2018-11-14 17:35:56,212 INFO L256 TraceCheckUtils]: 23: Hoare triple {1107#(and (= main_~sum~0 15) (<= main_~n~0 5) (<= 5 main_~n~0))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (~n~0 + 1) then 1 else 0)); {1111#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:35:56,214 INFO L273 TraceCheckUtils]: 24: Hoare triple {1111#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1115#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:35:56,214 INFO L273 TraceCheckUtils]: 25: Hoare triple {1115#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {1026#false} is VALID [2018-11-14 17:35:56,215 INFO L273 TraceCheckUtils]: 26: Hoare triple {1026#false} assume !false; {1026#false} is VALID [2018-11-14 17:35:56,218 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:35:56,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:35:56,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-11-14 17:35:56,238 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2018-11-14 17:35:56,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:56,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 17:35:56,276 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-14 17:35:56,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 17:35:56,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 17:35:56,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-11-14 17:35:56,277 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 16 states. [2018-11-14 17:35:57,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:57,371 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-14 17:35:57,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 17:35:57,372 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2018-11-14 17:35:57,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:57,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 17:35:57,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 36 transitions. [2018-11-14 17:35:57,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 17:35:57,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 36 transitions. [2018-11-14 17:35:57,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 36 transitions. [2018-11-14 17:35:57,444 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-14 17:35:57,446 INFO L225 Difference]: With dead ends: 36 [2018-11-14 17:35:57,446 INFO L226 Difference]: Without dead ends: 31 [2018-11-14 17:35:57,447 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-11-14 17:35:57,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-14 17:35:57,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-14 17:35:57,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:57,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-14 17:35:57,557 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-14 17:35:57,557 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-14 17:35:57,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:57,559 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-14 17:35:57,559 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-14 17:35:57,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:57,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:57,559 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-14 17:35:57,560 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-14 17:35:57,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:57,561 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-14 17:35:57,561 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-14 17:35:57,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:57,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:57,562 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:57,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:57,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 17:35:57,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-11-14 17:35:57,564 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 27 [2018-11-14 17:35:57,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:57,564 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-11-14 17:35:57,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 17:35:57,564 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-14 17:35:57,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 17:35:57,565 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:57,565 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:57,565 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:57,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:57,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1028029559, now seen corresponding path program 6 times [2018-11-14 17:35:57,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:57,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:57,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:57,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:35:57,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:57,577 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:35:57,577 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:35:57,577 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-14 17:35:57,592 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:35:57,608 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-14 17:35:57,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:35:57,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:57,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:35:58,019 INFO L256 TraceCheckUtils]: 0: Hoare triple {1282#true} call ULTIMATE.init(); {1282#true} is VALID [2018-11-14 17:35:58,019 INFO L273 TraceCheckUtils]: 1: Hoare triple {1282#true} assume true; {1282#true} is VALID [2018-11-14 17:35:58,020 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1282#true} {1282#true} #38#return; {1282#true} is VALID [2018-11-14 17:35:58,020 INFO L256 TraceCheckUtils]: 3: Hoare triple {1282#true} call #t~ret3 := main(); {1282#true} is VALID [2018-11-14 17:35:58,020 INFO L273 TraceCheckUtils]: 4: Hoare triple {1282#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1282#true} is VALID [2018-11-14 17:35:58,021 INFO L273 TraceCheckUtils]: 5: Hoare triple {1282#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {1302#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-14 17:35:58,022 INFO L273 TraceCheckUtils]: 6: Hoare triple {1302#(and (= main_~sum~0 0) (= main_~i~0 1))} assume true; {1302#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-14 17:35:58,022 INFO L273 TraceCheckUtils]: 7: Hoare triple {1302#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1309#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-14 17:35:58,023 INFO L273 TraceCheckUtils]: 8: Hoare triple {1309#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1313#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} is VALID [2018-11-14 17:35:58,024 INFO L273 TraceCheckUtils]: 9: Hoare triple {1313#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} assume true; {1313#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} is VALID [2018-11-14 17:35:58,025 INFO L273 TraceCheckUtils]: 10: Hoare triple {1313#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1320#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-14 17:35:58,044 INFO L273 TraceCheckUtils]: 11: Hoare triple {1320#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1324#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-14 17:35:58,045 INFO L273 TraceCheckUtils]: 12: Hoare triple {1324#(and (= main_~i~0 3) (= main_~sum~0 3))} assume true; {1324#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-14 17:35:58,046 INFO L273 TraceCheckUtils]: 13: Hoare triple {1324#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1331#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-14 17:35:58,046 INFO L273 TraceCheckUtils]: 14: Hoare triple {1331#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1335#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-14 17:35:58,047 INFO L273 TraceCheckUtils]: 15: Hoare triple {1335#(and (= main_~sum~0 6) (= main_~i~0 4))} assume true; {1335#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-14 17:35:58,047 INFO L273 TraceCheckUtils]: 16: Hoare triple {1335#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1342#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-14 17:35:58,048 INFO L273 TraceCheckUtils]: 17: Hoare triple {1342#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1346#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-14 17:35:58,048 INFO L273 TraceCheckUtils]: 18: Hoare triple {1346#(and (= main_~sum~0 10) (= main_~i~0 5))} assume true; {1346#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-14 17:35:58,049 INFO L273 TraceCheckUtils]: 19: Hoare triple {1346#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1353#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-14 17:35:58,050 INFO L273 TraceCheckUtils]: 20: Hoare triple {1353#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1357#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-14 17:35:58,051 INFO L273 TraceCheckUtils]: 21: Hoare triple {1357#(and (= main_~sum~0 15) (= main_~i~0 6))} assume true; {1357#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-14 17:35:58,052 INFO L273 TraceCheckUtils]: 22: Hoare triple {1357#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1364#(and (<= main_~i~0 main_~n~0) (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-14 17:35:58,053 INFO L273 TraceCheckUtils]: 23: Hoare triple {1364#(and (<= main_~i~0 main_~n~0) (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1368#(and (<= 6 main_~n~0) (= main_~sum~0 21) (<= main_~i~0 7))} is VALID [2018-11-14 17:35:58,054 INFO L273 TraceCheckUtils]: 24: Hoare triple {1368#(and (<= 6 main_~n~0) (= main_~sum~0 21) (<= main_~i~0 7))} assume true; {1368#(and (<= 6 main_~n~0) (= main_~sum~0 21) (<= main_~i~0 7))} is VALID [2018-11-14 17:35:58,055 INFO L273 TraceCheckUtils]: 25: Hoare triple {1368#(and (<= 6 main_~n~0) (= main_~sum~0 21) (<= main_~i~0 7))} assume !(~i~0 <= ~n~0); {1375#(and (<= main_~n~0 6) (<= 6 main_~n~0) (= main_~sum~0 21))} is VALID [2018-11-14 17:35:58,056 INFO L256 TraceCheckUtils]: 26: Hoare triple {1375#(and (<= main_~n~0 6) (<= 6 main_~n~0) (= main_~sum~0 21))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (~n~0 + 1) then 1 else 0)); {1379#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:35:58,057 INFO L273 TraceCheckUtils]: 27: Hoare triple {1379#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1383#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:35:58,058 INFO L273 TraceCheckUtils]: 28: Hoare triple {1383#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {1283#false} is VALID [2018-11-14 17:35:58,058 INFO L273 TraceCheckUtils]: 29: Hoare triple {1283#false} assume !false; {1283#false} is VALID [2018-11-14 17:35:58,061 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:35:58,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:35:58,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-11-14 17:35:58,082 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2018-11-14 17:35:58,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:58,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 17:35:58,113 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:58,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 17:35:58,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 17:35:58,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-11-14 17:35:58,115 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 18 states. [2018-11-14 17:35:59,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:59,120 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-14 17:35:59,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-14 17:35:59,120 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2018-11-14 17:35:59,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:59,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:35:59,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 39 transitions. [2018-11-14 17:35:59,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:35:59,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 39 transitions. [2018-11-14 17:35:59,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 39 transitions. [2018-11-14 17:35:59,204 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-14 17:35:59,206 INFO L225 Difference]: With dead ends: 39 [2018-11-14 17:35:59,206 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 17:35:59,207 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 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-14 17:35:59,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 17:35:59,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-14 17:35:59,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:59,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2018-11-14 17:35:59,269 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-14 17:35:59,269 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-14 17:35:59,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:59,272 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-14 17:35:59,272 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-14 17:35:59,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:59,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:59,272 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-14 17:35:59,273 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-14 17:35:59,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:59,274 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-14 17:35:59,274 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-14 17:35:59,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:59,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:59,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:59,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:59,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 17:35:59,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-11-14 17:35:59,277 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 30 [2018-11-14 17:35:59,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:59,277 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-11-14 17:35:59,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 17:35:59,277 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-14 17:35:59,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-14 17:35:59,278 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:59,278 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:59,278 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:59,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:59,279 INFO L82 PathProgramCache]: Analyzing trace with hash -656200317, now seen corresponding path program 7 times [2018-11-14 17:35:59,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:59,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:59,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:59,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:35:59,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:59,293 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:35:59,293 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:35:59,293 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-14 17:35:59,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:59,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:00,218 INFO L256 TraceCheckUtils]: 0: Hoare triple {1564#true} call ULTIMATE.init(); {1564#true} is VALID [2018-11-14 17:36:00,218 INFO L273 TraceCheckUtils]: 1: Hoare triple {1564#true} assume true; {1564#true} is VALID [2018-11-14 17:36:00,219 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1564#true} {1564#true} #38#return; {1564#true} is VALID [2018-11-14 17:36:00,219 INFO L256 TraceCheckUtils]: 3: Hoare triple {1564#true} call #t~ret3 := main(); {1564#true} is VALID [2018-11-14 17:36:00,219 INFO L273 TraceCheckUtils]: 4: Hoare triple {1564#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1564#true} is VALID [2018-11-14 17:36:00,220 INFO L273 TraceCheckUtils]: 5: Hoare triple {1564#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {1584#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-14 17:36:00,220 INFO L273 TraceCheckUtils]: 6: Hoare triple {1584#(and (= main_~sum~0 0) (= main_~i~0 1))} assume true; {1584#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-14 17:36:00,221 INFO L273 TraceCheckUtils]: 7: Hoare triple {1584#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1591#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-14 17:36:00,222 INFO L273 TraceCheckUtils]: 8: Hoare triple {1591#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1595#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2018-11-14 17:36:00,222 INFO L273 TraceCheckUtils]: 9: Hoare triple {1595#(and (= main_~i~0 2) (= main_~sum~0 1))} assume true; {1595#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2018-11-14 17:36:00,223 INFO L273 TraceCheckUtils]: 10: Hoare triple {1595#(and (= main_~i~0 2) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1602#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-14 17:36:00,223 INFO L273 TraceCheckUtils]: 11: Hoare triple {1602#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1606#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-14 17:36:00,224 INFO L273 TraceCheckUtils]: 12: Hoare triple {1606#(and (= main_~i~0 3) (= main_~sum~0 3))} assume true; {1606#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-14 17:36:00,225 INFO L273 TraceCheckUtils]: 13: Hoare triple {1606#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1613#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-14 17:36:00,226 INFO L273 TraceCheckUtils]: 14: Hoare triple {1613#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1617#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-14 17:36:00,227 INFO L273 TraceCheckUtils]: 15: Hoare triple {1617#(and (= main_~sum~0 6) (= main_~i~0 4))} assume true; {1617#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-14 17:36:00,228 INFO L273 TraceCheckUtils]: 16: Hoare triple {1617#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1624#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-14 17:36:00,229 INFO L273 TraceCheckUtils]: 17: Hoare triple {1624#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1628#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-14 17:36:00,230 INFO L273 TraceCheckUtils]: 18: Hoare triple {1628#(and (= main_~sum~0 10) (= main_~i~0 5))} assume true; {1628#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-14 17:36:00,231 INFO L273 TraceCheckUtils]: 19: Hoare triple {1628#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1635#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-14 17:36:00,232 INFO L273 TraceCheckUtils]: 20: Hoare triple {1635#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1639#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-14 17:36:00,232 INFO L273 TraceCheckUtils]: 21: Hoare triple {1639#(and (= main_~sum~0 15) (= main_~i~0 6))} assume true; {1639#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-14 17:36:00,233 INFO L273 TraceCheckUtils]: 22: Hoare triple {1639#(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-14 17:36:00,234 INFO L273 TraceCheckUtils]: 23: Hoare triple {1646#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1650#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-14 17:36:00,235 INFO L273 TraceCheckUtils]: 24: Hoare triple {1650#(and (= main_~sum~0 21) (= main_~i~0 7))} assume true; {1650#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-14 17:36:00,236 INFO L273 TraceCheckUtils]: 25: Hoare triple {1650#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1657#(and (= (+ main_~i~0 21) main_~sum~0) (<= main_~i~0 main_~n~0) (= main_~i~0 7))} is VALID [2018-11-14 17:36:00,237 INFO L273 TraceCheckUtils]: 26: Hoare triple {1657#(and (= (+ main_~i~0 21) main_~sum~0) (<= main_~i~0 main_~n~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1661#(and (= main_~sum~0 28) (<= main_~i~0 8) (<= 7 main_~n~0))} is VALID [2018-11-14 17:36:00,238 INFO L273 TraceCheckUtils]: 27: Hoare triple {1661#(and (= main_~sum~0 28) (<= main_~i~0 8) (<= 7 main_~n~0))} assume true; {1661#(and (= main_~sum~0 28) (<= main_~i~0 8) (<= 7 main_~n~0))} is VALID [2018-11-14 17:36:00,239 INFO L273 TraceCheckUtils]: 28: Hoare triple {1661#(and (= main_~sum~0 28) (<= main_~i~0 8) (<= 7 main_~n~0))} assume !(~i~0 <= ~n~0); {1668#(and (= main_~sum~0 28) (<= main_~n~0 7) (<= 7 main_~n~0))} is VALID [2018-11-14 17:36:00,240 INFO L256 TraceCheckUtils]: 29: Hoare triple {1668#(and (= main_~sum~0 28) (<= main_~n~0 7) (<= 7 main_~n~0))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (~n~0 + 1) then 1 else 0)); {1672#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:36:00,241 INFO L273 TraceCheckUtils]: 30: Hoare triple {1672#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1676#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:36:00,242 INFO L273 TraceCheckUtils]: 31: Hoare triple {1676#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {1565#false} is VALID [2018-11-14 17:36:00,242 INFO L273 TraceCheckUtils]: 32: Hoare triple {1565#false} assume !false; {1565#false} is VALID [2018-11-14 17:36:00,245 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:00,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:00,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-11-14 17:36:00,267 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 33 [2018-11-14 17:36:00,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:00,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-14 17:36:00,298 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-14 17:36:00,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-14 17:36:00,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-14 17:36:00,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-11-14 17:36:00,299 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 20 states. [2018-11-14 17:36:01,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:01,501 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-14 17:36:01,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-14 17:36:01,501 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 33 [2018-11-14 17:36:01,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:01,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 17:36:01,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 42 transitions. [2018-11-14 17:36:01,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 17:36:01,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 42 transitions. [2018-11-14 17:36:01,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 42 transitions. [2018-11-14 17:36:01,571 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:01,572 INFO L225 Difference]: With dead ends: 42 [2018-11-14 17:36:01,572 INFO L226 Difference]: Without dead ends: 37 [2018-11-14 17:36:01,573 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2018-11-14 17:36:01,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-14 17:36:01,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-14 17:36:01,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:01,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-14 17:36:01,601 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-14 17:36:01,601 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-14 17:36:01,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:01,603 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-11-14 17:36:01,603 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-11-14 17:36:01,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:01,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:01,604 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-14 17:36:01,604 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-14 17:36:01,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:01,606 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-11-14 17:36:01,606 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-11-14 17:36:01,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:01,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:01,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:01,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:01,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 17:36:01,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-11-14 17:36:01,608 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 33 [2018-11-14 17:36:01,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:01,608 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-11-14 17:36:01,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-14 17:36:01,609 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-11-14 17:36:01,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-14 17:36:01,609 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:01,610 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:01,610 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:01,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:01,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1740484361, now seen corresponding path program 8 times [2018-11-14 17:36:01,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:01,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:01,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:01,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:36:01,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:01,627 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:01,627 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:01,628 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-14 17:36:01,652 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:36:01,677 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:36:01,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:01,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:02,159 INFO L256 TraceCheckUtils]: 0: Hoare triple {1871#true} call ULTIMATE.init(); {1871#true} is VALID [2018-11-14 17:36:02,160 INFO L273 TraceCheckUtils]: 1: Hoare triple {1871#true} assume true; {1871#true} is VALID [2018-11-14 17:36:02,160 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1871#true} {1871#true} #38#return; {1871#true} is VALID [2018-11-14 17:36:02,160 INFO L256 TraceCheckUtils]: 3: Hoare triple {1871#true} call #t~ret3 := main(); {1871#true} is VALID [2018-11-14 17:36:02,161 INFO L273 TraceCheckUtils]: 4: Hoare triple {1871#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1871#true} is VALID [2018-11-14 17:36:02,166 INFO L273 TraceCheckUtils]: 5: Hoare triple {1871#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {1891#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-14 17:36:02,167 INFO L273 TraceCheckUtils]: 6: Hoare triple {1891#(and (= main_~sum~0 0) (= main_~i~0 1))} assume true; {1891#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-14 17:36:02,167 INFO L273 TraceCheckUtils]: 7: Hoare triple {1891#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1898#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-14 17:36:02,168 INFO L273 TraceCheckUtils]: 8: Hoare triple {1898#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1902#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2018-11-14 17:36:02,168 INFO L273 TraceCheckUtils]: 9: Hoare triple {1902#(and (= main_~i~0 2) (= main_~sum~0 1))} assume true; {1902#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2018-11-14 17:36:02,169 INFO L273 TraceCheckUtils]: 10: Hoare triple {1902#(and (= main_~i~0 2) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1909#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-14 17:36:02,170 INFO L273 TraceCheckUtils]: 11: Hoare triple {1909#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1913#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-14 17:36:02,177 INFO L273 TraceCheckUtils]: 12: Hoare triple {1913#(and (= main_~i~0 3) (= main_~sum~0 3))} assume true; {1913#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-14 17:36:02,178 INFO L273 TraceCheckUtils]: 13: Hoare triple {1913#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1920#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-14 17:36:02,179 INFO L273 TraceCheckUtils]: 14: Hoare triple {1920#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1924#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-14 17:36:02,179 INFO L273 TraceCheckUtils]: 15: Hoare triple {1924#(and (= main_~sum~0 6) (= main_~i~0 4))} assume true; {1924#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-14 17:36:02,180 INFO L273 TraceCheckUtils]: 16: Hoare triple {1924#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1931#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-14 17:36:02,180 INFO L273 TraceCheckUtils]: 17: Hoare triple {1931#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1935#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-14 17:36:02,184 INFO L273 TraceCheckUtils]: 18: Hoare triple {1935#(and (= main_~sum~0 10) (= main_~i~0 5))} assume true; {1935#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-14 17:36:02,185 INFO L273 TraceCheckUtils]: 19: Hoare triple {1935#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1942#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-14 17:36:02,185 INFO L273 TraceCheckUtils]: 20: Hoare triple {1942#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1946#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-14 17:36:02,186 INFO L273 TraceCheckUtils]: 21: Hoare triple {1946#(and (= main_~sum~0 15) (= main_~i~0 6))} assume true; {1946#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-14 17:36:02,186 INFO L273 TraceCheckUtils]: 22: Hoare triple {1946#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1953#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-14 17:36:02,187 INFO L273 TraceCheckUtils]: 23: Hoare triple {1953#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1957#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-14 17:36:02,187 INFO L273 TraceCheckUtils]: 24: Hoare triple {1957#(and (= main_~sum~0 21) (= main_~i~0 7))} assume true; {1957#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-14 17:36:02,188 INFO L273 TraceCheckUtils]: 25: Hoare triple {1957#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1964#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} is VALID [2018-11-14 17:36:02,189 INFO L273 TraceCheckUtils]: 26: Hoare triple {1964#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1968#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-14 17:36:02,190 INFO L273 TraceCheckUtils]: 27: Hoare triple {1968#(and (= main_~sum~0 28) (= main_~i~0 8))} assume true; {1968#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-14 17:36:02,191 INFO L273 TraceCheckUtils]: 28: Hoare triple {1968#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {1975#(and (<= main_~i~0 main_~n~0) (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} is VALID [2018-11-14 17:36:02,192 INFO L273 TraceCheckUtils]: 29: Hoare triple {1975#(and (<= main_~i~0 main_~n~0) (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1979#(and (<= 8 main_~n~0) (<= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-14 17:36:02,192 INFO L273 TraceCheckUtils]: 30: Hoare triple {1979#(and (<= 8 main_~n~0) (<= main_~i~0 9) (= main_~sum~0 36))} assume true; {1979#(and (<= 8 main_~n~0) (<= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-14 17:36:02,193 INFO L273 TraceCheckUtils]: 31: Hoare triple {1979#(and (<= 8 main_~n~0) (<= main_~i~0 9) (= main_~sum~0 36))} assume !(~i~0 <= ~n~0); {1986#(and (<= 8 main_~n~0) (= main_~sum~0 36) (<= main_~n~0 8))} is VALID [2018-11-14 17:36:02,195 INFO L256 TraceCheckUtils]: 32: Hoare triple {1986#(and (<= 8 main_~n~0) (= main_~sum~0 36) (<= main_~n~0 8))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (~n~0 + 1) then 1 else 0)); {1990#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:36:02,196 INFO L273 TraceCheckUtils]: 33: Hoare triple {1990#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1994#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:36:02,196 INFO L273 TraceCheckUtils]: 34: Hoare triple {1994#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {1872#false} is VALID [2018-11-14 17:36:02,197 INFO L273 TraceCheckUtils]: 35: Hoare triple {1872#false} assume !false; {1872#false} is VALID [2018-11-14 17:36:02,201 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-14 17:36:02,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:02,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-11-14 17:36:02,223 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 36 [2018-11-14 17:36:02,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:02,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-14 17:36:02,257 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-14 17:36:02,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-14 17:36:02,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-14 17:36:02,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-11-14 17:36:02,259 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 22 states. [2018-11-14 17:36:03,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:03,511 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-14 17:36:03,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-14 17:36:03,511 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 36 [2018-11-14 17:36:03,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:03,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 17:36:03,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 45 transitions. [2018-11-14 17:36:03,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 17:36:03,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 45 transitions. [2018-11-14 17:36:03,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 45 transitions. [2018-11-14 17:36:03,608 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-14 17:36:03,610 INFO L225 Difference]: With dead ends: 45 [2018-11-14 17:36:03,610 INFO L226 Difference]: Without dead ends: 40 [2018-11-14 17:36:03,611 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=502, Unknown=0, NotChecked=0, Total=552 [2018-11-14 17:36:03,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-14 17:36:03,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-14 17:36:03,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:03,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-14 17:36:03,643 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-14 17:36:03,643 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-14 17:36:03,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:03,645 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-11-14 17:36:03,645 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-11-14 17:36:03,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:03,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:03,645 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-14 17:36:03,645 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-14 17:36:03,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:03,647 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-11-14 17:36:03,647 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-11-14 17:36:03,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:03,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:03,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:03,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:03,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-14 17:36:03,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-11-14 17:36:03,649 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 36 [2018-11-14 17:36:03,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:03,649 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-11-14 17:36:03,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-14 17:36:03,649 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-11-14 17:36:03,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-14 17:36:03,650 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:03,650 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:03,651 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:03,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:03,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1197405949, now seen corresponding path program 9 times [2018-11-14 17:36:03,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:03,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:03,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:03,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:03,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:03,662 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:03,663 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:03,663 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-14 17:36:03,680 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:36:03,704 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-14 17:36:03,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:03,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:04,404 INFO L256 TraceCheckUtils]: 0: Hoare triple {2203#true} call ULTIMATE.init(); {2203#true} is VALID [2018-11-14 17:36:04,405 INFO L273 TraceCheckUtils]: 1: Hoare triple {2203#true} assume true; {2203#true} is VALID [2018-11-14 17:36:04,405 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2203#true} {2203#true} #38#return; {2203#true} is VALID [2018-11-14 17:36:04,405 INFO L256 TraceCheckUtils]: 3: Hoare triple {2203#true} call #t~ret3 := main(); {2203#true} is VALID [2018-11-14 17:36:04,405 INFO L273 TraceCheckUtils]: 4: Hoare triple {2203#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2203#true} is VALID [2018-11-14 17:36:04,427 INFO L273 TraceCheckUtils]: 5: Hoare triple {2203#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {2223#(and (= main_~sum~0 0) (= main_~i~0 1) (<= 1 main_~n~0))} is VALID [2018-11-14 17:36:04,441 INFO L273 TraceCheckUtils]: 6: Hoare triple {2223#(and (= main_~sum~0 0) (= main_~i~0 1) (<= 1 main_~n~0))} assume true; {2223#(and (= main_~sum~0 0) (= main_~i~0 1) (<= 1 main_~n~0))} is VALID [2018-11-14 17:36:04,457 INFO L273 TraceCheckUtils]: 7: Hoare triple {2223#(and (= main_~sum~0 0) (= main_~i~0 1) (<= 1 main_~n~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2230#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1) (<= 1 main_~n~0))} is VALID [2018-11-14 17:36:04,472 INFO L273 TraceCheckUtils]: 8: Hoare triple {2230#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1) (<= 1 main_~n~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2234#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1) (<= 1 main_~n~0))} is VALID [2018-11-14 17:36:04,472 INFO L273 TraceCheckUtils]: 9: Hoare triple {2234#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1) (<= 1 main_~n~0))} assume true; {2234#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1) (<= 1 main_~n~0))} is VALID [2018-11-14 17:36:04,473 INFO L273 TraceCheckUtils]: 10: Hoare triple {2234#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1) (<= 1 main_~n~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2241#(and (= main_~i~0 2) (<= 1 main_~n~0) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-14 17:36:04,474 INFO L273 TraceCheckUtils]: 11: Hoare triple {2241#(and (= main_~i~0 2) (<= 1 main_~n~0) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2245#(and (= main_~i~0 3) (<= 1 main_~n~0) (= main_~sum~0 3))} is VALID [2018-11-14 17:36:04,474 INFO L273 TraceCheckUtils]: 12: Hoare triple {2245#(and (= main_~i~0 3) (<= 1 main_~n~0) (= main_~sum~0 3))} assume true; {2245#(and (= main_~i~0 3) (<= 1 main_~n~0) (= main_~sum~0 3))} is VALID [2018-11-14 17:36:04,481 INFO L273 TraceCheckUtils]: 13: Hoare triple {2245#(and (= main_~i~0 3) (<= 1 main_~n~0) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2252#(and (= main_~i~0 3) (<= 1 main_~n~0) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-14 17:36:04,482 INFO L273 TraceCheckUtils]: 14: Hoare triple {2252#(and (= main_~i~0 3) (<= 1 main_~n~0) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2256#(and (= main_~sum~0 6) (<= 1 main_~n~0) (= main_~i~0 4))} is VALID [2018-11-14 17:36:04,483 INFO L273 TraceCheckUtils]: 15: Hoare triple {2256#(and (= main_~sum~0 6) (<= 1 main_~n~0) (= main_~i~0 4))} assume true; {2256#(and (= main_~sum~0 6) (<= 1 main_~n~0) (= main_~i~0 4))} is VALID [2018-11-14 17:36:04,483 INFO L273 TraceCheckUtils]: 16: Hoare triple {2256#(and (= main_~sum~0 6) (<= 1 main_~n~0) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2263#(and (= main_~sum~0 (+ main_~i~0 6)) (<= 1 main_~n~0) (= main_~i~0 4))} is VALID [2018-11-14 17:36:04,484 INFO L273 TraceCheckUtils]: 17: Hoare triple {2263#(and (= main_~sum~0 (+ main_~i~0 6)) (<= 1 main_~n~0) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2267#(and (<= 1 main_~n~0) (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-14 17:36:04,484 INFO L273 TraceCheckUtils]: 18: Hoare triple {2267#(and (<= 1 main_~n~0) (= main_~sum~0 10) (= main_~i~0 5))} assume true; {2267#(and (<= 1 main_~n~0) (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-14 17:36:04,485 INFO L273 TraceCheckUtils]: 19: Hoare triple {2267#(and (<= 1 main_~n~0) (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2274#(and (<= 1 main_~n~0) (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-14 17:36:04,486 INFO L273 TraceCheckUtils]: 20: Hoare triple {2274#(and (<= 1 main_~n~0) (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2278#(and (= main_~sum~0 15) (= main_~i~0 6) (<= 1 main_~n~0))} is VALID [2018-11-14 17:36:04,487 INFO L273 TraceCheckUtils]: 21: Hoare triple {2278#(and (= main_~sum~0 15) (= main_~i~0 6) (<= 1 main_~n~0))} assume true; {2278#(and (= main_~sum~0 15) (= main_~i~0 6) (<= 1 main_~n~0))} is VALID [2018-11-14 17:36:04,490 INFO L273 TraceCheckUtils]: 22: Hoare triple {2278#(and (= main_~sum~0 15) (= main_~i~0 6) (<= 1 main_~n~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2285#(and (= main_~i~0 6) (<= 1 main_~n~0) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-14 17:36:04,491 INFO L273 TraceCheckUtils]: 23: Hoare triple {2285#(and (= main_~i~0 6) (<= 1 main_~n~0) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2289#(and (<= 1 main_~n~0) (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-14 17:36:04,491 INFO L273 TraceCheckUtils]: 24: Hoare triple {2289#(and (<= 1 main_~n~0) (= main_~sum~0 21) (= main_~i~0 7))} assume true; {2289#(and (<= 1 main_~n~0) (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-14 17:36:04,492 INFO L273 TraceCheckUtils]: 25: Hoare triple {2289#(and (<= 1 main_~n~0) (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2296#(and (= (+ main_~i~0 21) main_~sum~0) (<= 1 main_~n~0) (= main_~i~0 7))} is VALID [2018-11-14 17:36:04,493 INFO L273 TraceCheckUtils]: 26: Hoare triple {2296#(and (= (+ main_~i~0 21) main_~sum~0) (<= 1 main_~n~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2300#(and (= main_~sum~0 28) (= main_~i~0 8) (<= 1 main_~n~0))} is VALID [2018-11-14 17:36:04,496 INFO L273 TraceCheckUtils]: 27: Hoare triple {2300#(and (= main_~sum~0 28) (= main_~i~0 8) (<= 1 main_~n~0))} assume true; {2300#(and (= main_~sum~0 28) (= main_~i~0 8) (<= 1 main_~n~0))} is VALID [2018-11-14 17:36:04,499 INFO L273 TraceCheckUtils]: 28: Hoare triple {2300#(and (= main_~sum~0 28) (= main_~i~0 8) (<= 1 main_~n~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2307#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)) (<= 1 main_~n~0))} is VALID [2018-11-14 17:36:04,502 INFO L273 TraceCheckUtils]: 29: Hoare triple {2307#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)) (<= 1 main_~n~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2311#(and (= main_~i~0 9) (<= 1 main_~n~0) (= main_~sum~0 36))} is VALID [2018-11-14 17:36:04,502 INFO L273 TraceCheckUtils]: 30: Hoare triple {2311#(and (= main_~i~0 9) (<= 1 main_~n~0) (= main_~sum~0 36))} assume true; {2311#(and (= main_~i~0 9) (<= 1 main_~n~0) (= main_~sum~0 36))} is VALID [2018-11-14 17:36:04,505 INFO L273 TraceCheckUtils]: 31: Hoare triple {2311#(and (= main_~i~0 9) (<= 1 main_~n~0) (= main_~sum~0 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2318#(and (= main_~i~0 9) (<= main_~i~0 main_~n~0) (= (+ main_~i~0 36) main_~sum~0))} is VALID [2018-11-14 17:36:04,505 INFO L273 TraceCheckUtils]: 32: Hoare triple {2318#(and (= main_~i~0 9) (<= main_~i~0 main_~n~0) (= (+ main_~i~0 36) main_~sum~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2322#(and (= main_~sum~0 45) (<= 9 main_~n~0) (= main_~i~0 10))} is VALID [2018-11-14 17:36:04,507 INFO L273 TraceCheckUtils]: 33: Hoare triple {2322#(and (= main_~sum~0 45) (<= 9 main_~n~0) (= main_~i~0 10))} assume true; {2322#(and (= main_~sum~0 45) (<= 9 main_~n~0) (= main_~i~0 10))} is VALID [2018-11-14 17:36:04,507 INFO L273 TraceCheckUtils]: 34: Hoare triple {2322#(and (= main_~sum~0 45) (<= 9 main_~n~0) (= main_~i~0 10))} assume !(~i~0 <= ~n~0); {2329#(and (= main_~sum~0 45) (< main_~n~0 10) (<= 9 main_~n~0))} is VALID [2018-11-14 17:36:04,508 INFO L256 TraceCheckUtils]: 35: Hoare triple {2329#(and (= main_~sum~0 45) (< main_~n~0 10) (<= 9 main_~n~0))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (~n~0 + 1) then 1 else 0)); {2333#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:36:04,515 INFO L273 TraceCheckUtils]: 36: Hoare triple {2333#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2337#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:36:04,516 INFO L273 TraceCheckUtils]: 37: Hoare triple {2337#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {2204#false} is VALID [2018-11-14 17:36:04,516 INFO L273 TraceCheckUtils]: 38: Hoare triple {2204#false} assume !false; {2204#false} is VALID [2018-11-14 17:36:04,520 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:04,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:04,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-11-14 17:36:04,550 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 39 [2018-11-14 17:36:04,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:04,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 17:36:04,614 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-14 17:36:04,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 17:36:04,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 17:36:04,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-11-14 17:36:04,615 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 24 states. [2018-11-14 17:36:06,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:06,169 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-11-14 17:36:06,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-14 17:36:06,169 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 39 [2018-11-14 17:36:06,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:06,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 17:36:06,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 48 transitions. [2018-11-14 17:36:06,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 17:36:06,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 48 transitions. [2018-11-14 17:36:06,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 48 transitions. [2018-11-14 17:36:06,222 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:06,223 INFO L225 Difference]: With dead ends: 48 [2018-11-14 17:36:06,224 INFO L226 Difference]: Without dead ends: 43 [2018-11-14 17:36:06,225 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=597, Unknown=0, NotChecked=0, Total=650 [2018-11-14 17:36:06,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-14 17:36:06,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-14 17:36:06,258 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:06,258 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2018-11-14 17:36:06,258 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-14 17:36:06,258 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-14 17:36:06,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:06,260 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-11-14 17:36:06,261 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-11-14 17:36:06,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:06,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:06,261 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-14 17:36:06,261 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-14 17:36:06,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:06,262 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-11-14 17:36:06,262 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-11-14 17:36:06,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:06,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:06,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:06,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:06,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-14 17:36:06,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-11-14 17:36:06,264 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 39 [2018-11-14 17:36:06,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:06,264 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-11-14 17:36:06,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 17:36:06,264 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-11-14 17:36:06,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-14 17:36:06,265 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:06,265 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:06,265 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:06,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:06,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1490238089, now seen corresponding path program 10 times [2018-11-14 17:36:06,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:06,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:06,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:06,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:06,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:06,277 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:06,277 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:06,277 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-14 17:36:06,289 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:36:06,307 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:36:06,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:06,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:06,939 INFO L256 TraceCheckUtils]: 0: Hoare triple {2560#true} call ULTIMATE.init(); {2560#true} is VALID [2018-11-14 17:36:06,939 INFO L273 TraceCheckUtils]: 1: Hoare triple {2560#true} assume true; {2560#true} is VALID [2018-11-14 17:36:06,940 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2560#true} {2560#true} #38#return; {2560#true} is VALID [2018-11-14 17:36:06,940 INFO L256 TraceCheckUtils]: 3: Hoare triple {2560#true} call #t~ret3 := main(); {2560#true} is VALID [2018-11-14 17:36:06,940 INFO L273 TraceCheckUtils]: 4: Hoare triple {2560#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2560#true} is VALID [2018-11-14 17:36:06,941 INFO L273 TraceCheckUtils]: 5: Hoare triple {2560#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {2580#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-14 17:36:06,941 INFO L273 TraceCheckUtils]: 6: Hoare triple {2580#(and (= main_~sum~0 0) (= main_~i~0 1))} assume true; {2580#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-14 17:36:06,942 INFO L273 TraceCheckUtils]: 7: Hoare triple {2580#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2587#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-14 17:36:06,942 INFO L273 TraceCheckUtils]: 8: Hoare triple {2587#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2591#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2018-11-14 17:36:06,943 INFO L273 TraceCheckUtils]: 9: Hoare triple {2591#(and (= main_~i~0 2) (= main_~sum~0 1))} assume true; {2591#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2018-11-14 17:36:06,944 INFO L273 TraceCheckUtils]: 10: Hoare triple {2591#(and (= main_~i~0 2) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2598#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-14 17:36:06,945 INFO L273 TraceCheckUtils]: 11: Hoare triple {2598#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2602#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-14 17:36:06,945 INFO L273 TraceCheckUtils]: 12: Hoare triple {2602#(and (= main_~i~0 3) (= main_~sum~0 3))} assume true; {2602#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-14 17:36:06,946 INFO L273 TraceCheckUtils]: 13: Hoare triple {2602#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2609#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-14 17:36:06,947 INFO L273 TraceCheckUtils]: 14: Hoare triple {2609#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2613#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-14 17:36:06,948 INFO L273 TraceCheckUtils]: 15: Hoare triple {2613#(and (= main_~sum~0 6) (= main_~i~0 4))} assume true; {2613#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-14 17:36:06,949 INFO L273 TraceCheckUtils]: 16: Hoare triple {2613#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2620#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-14 17:36:06,950 INFO L273 TraceCheckUtils]: 17: Hoare triple {2620#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2624#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-14 17:36:06,950 INFO L273 TraceCheckUtils]: 18: Hoare triple {2624#(and (= main_~sum~0 10) (= main_~i~0 5))} assume true; {2624#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-14 17:36:06,951 INFO L273 TraceCheckUtils]: 19: Hoare triple {2624#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2631#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-14 17:36:06,952 INFO L273 TraceCheckUtils]: 20: Hoare triple {2631#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2635#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-14 17:36:06,953 INFO L273 TraceCheckUtils]: 21: Hoare triple {2635#(and (= main_~sum~0 15) (= main_~i~0 6))} assume true; {2635#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-14 17:36:06,954 INFO L273 TraceCheckUtils]: 22: Hoare triple {2635#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2642#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-14 17:36:06,954 INFO L273 TraceCheckUtils]: 23: Hoare triple {2642#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2646#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-14 17:36:06,955 INFO L273 TraceCheckUtils]: 24: Hoare triple {2646#(and (= main_~sum~0 21) (= main_~i~0 7))} assume true; {2646#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-14 17:36:06,956 INFO L273 TraceCheckUtils]: 25: Hoare triple {2646#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2653#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} is VALID [2018-11-14 17:36:06,957 INFO L273 TraceCheckUtils]: 26: Hoare triple {2653#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2657#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-14 17:36:06,958 INFO L273 TraceCheckUtils]: 27: Hoare triple {2657#(and (= main_~sum~0 28) (= main_~i~0 8))} assume true; {2657#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-14 17:36:06,958 INFO L273 TraceCheckUtils]: 28: Hoare triple {2657#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2664#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} is VALID [2018-11-14 17:36:06,959 INFO L273 TraceCheckUtils]: 29: Hoare triple {2664#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2668#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-14 17:36:06,960 INFO L273 TraceCheckUtils]: 30: Hoare triple {2668#(and (= main_~i~0 9) (= main_~sum~0 36))} assume true; {2668#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-14 17:36:06,961 INFO L273 TraceCheckUtils]: 31: Hoare triple {2668#(and (= main_~i~0 9) (= main_~sum~0 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2675#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} is VALID [2018-11-14 17:36:06,962 INFO L273 TraceCheckUtils]: 32: Hoare triple {2675#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2679#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-14 17:36:06,962 INFO L273 TraceCheckUtils]: 33: Hoare triple {2679#(and (= main_~sum~0 45) (= main_~i~0 10))} assume true; {2679#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-14 17:36:06,963 INFO L273 TraceCheckUtils]: 34: Hoare triple {2679#(and (= main_~sum~0 45) (= main_~i~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2686#(and (= main_~sum~0 (+ main_~i~0 45)) (<= main_~i~0 main_~n~0) (= main_~i~0 10))} is VALID [2018-11-14 17:36:06,964 INFO L273 TraceCheckUtils]: 35: Hoare triple {2686#(and (= main_~sum~0 (+ main_~i~0 45)) (<= main_~i~0 main_~n~0) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2690#(and (<= main_~i~0 11) (= main_~sum~0 55) (<= 10 main_~n~0))} is VALID [2018-11-14 17:36:06,965 INFO L273 TraceCheckUtils]: 36: Hoare triple {2690#(and (<= main_~i~0 11) (= main_~sum~0 55) (<= 10 main_~n~0))} assume true; {2690#(and (<= main_~i~0 11) (= main_~sum~0 55) (<= 10 main_~n~0))} is VALID [2018-11-14 17:36:06,968 INFO L273 TraceCheckUtils]: 37: Hoare triple {2690#(and (<= main_~i~0 11) (= main_~sum~0 55) (<= 10 main_~n~0))} assume !(~i~0 <= ~n~0); {2697#(and (= main_~sum~0 55) (<= main_~n~0 10) (<= 10 main_~n~0))} is VALID [2018-11-14 17:36:06,969 INFO L256 TraceCheckUtils]: 38: Hoare triple {2697#(and (= main_~sum~0 55) (<= main_~n~0 10) (<= 10 main_~n~0))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (~n~0 + 1) then 1 else 0)); {2701#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:36:06,970 INFO L273 TraceCheckUtils]: 39: Hoare triple {2701#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2705#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:36:06,970 INFO L273 TraceCheckUtils]: 40: Hoare triple {2705#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {2561#false} is VALID [2018-11-14 17:36:06,971 INFO L273 TraceCheckUtils]: 41: Hoare triple {2561#false} assume !false; {2561#false} is VALID [2018-11-14 17:36:06,974 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:06,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:06,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-11-14 17:36:06,995 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 42 [2018-11-14 17:36:06,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:06,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-14 17:36:07,034 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:07,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-14 17:36:07,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-14 17:36:07,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2018-11-14 17:36:07,036 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 26 states. [2018-11-14 17:36:09,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:09,146 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-11-14 17:36:09,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-14 17:36:09,146 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 42 [2018-11-14 17:36:09,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:09,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 17:36:09,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 51 transitions. [2018-11-14 17:36:09,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 17:36:09,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 51 transitions. [2018-11-14 17:36:09,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 51 transitions. [2018-11-14 17:36:09,206 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-14 17:36:09,208 INFO L225 Difference]: With dead ends: 51 [2018-11-14 17:36:09,208 INFO L226 Difference]: Without dead ends: 46 [2018-11-14 17:36:09,209 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 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-14 17:36:09,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-14 17:36:09,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-14 17:36:09,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:09,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2018-11-14 17:36:09,247 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-14 17:36:09,247 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-14 17:36:09,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:09,248 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-14 17:36:09,248 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-14 17:36:09,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:09,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:09,248 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-14 17:36:09,249 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-14 17:36:09,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:09,250 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-14 17:36:09,250 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-14 17:36:09,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:09,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:09,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:09,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:09,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-14 17:36:09,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-11-14 17:36:09,251 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 42 [2018-11-14 17:36:09,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:09,251 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-11-14 17:36:09,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-14 17:36:09,252 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-14 17:36:09,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-14 17:36:09,252 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:09,252 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:09,252 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:09,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:09,253 INFO L82 PathProgramCache]: Analyzing trace with hash 2121024643, now seen corresponding path program 11 times [2018-11-14 17:36:09,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:09,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:09,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:09,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:09,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:09,264 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:09,264 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:09,264 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-14 17:36:09,275 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:36:09,299 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-14 17:36:09,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:09,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:10,529 INFO L256 TraceCheckUtils]: 0: Hoare triple {2942#true} call ULTIMATE.init(); {2942#true} is VALID [2018-11-14 17:36:10,530 INFO L273 TraceCheckUtils]: 1: Hoare triple {2942#true} assume true; {2942#true} is VALID [2018-11-14 17:36:10,530 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2942#true} {2942#true} #38#return; {2942#true} is VALID [2018-11-14 17:36:10,531 INFO L256 TraceCheckUtils]: 3: Hoare triple {2942#true} call #t~ret3 := main(); {2942#true} is VALID [2018-11-14 17:36:10,531 INFO L273 TraceCheckUtils]: 4: Hoare triple {2942#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2942#true} is VALID [2018-11-14 17:36:10,532 INFO L273 TraceCheckUtils]: 5: Hoare triple {2942#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {2962#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-14 17:36:10,533 INFO L273 TraceCheckUtils]: 6: Hoare triple {2962#(and (= main_~sum~0 0) (= main_~i~0 1))} assume true; {2962#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-14 17:36:10,534 INFO L273 TraceCheckUtils]: 7: Hoare triple {2962#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2969#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-14 17:36:10,534 INFO L273 TraceCheckUtils]: 8: Hoare triple {2969#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2973#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} is VALID [2018-11-14 17:36:10,535 INFO L273 TraceCheckUtils]: 9: Hoare triple {2973#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} assume true; {2973#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} is VALID [2018-11-14 17:36:10,536 INFO L273 TraceCheckUtils]: 10: Hoare triple {2973#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2980#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-14 17:36:10,537 INFO L273 TraceCheckUtils]: 11: Hoare triple {2980#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2984#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-14 17:36:10,538 INFO L273 TraceCheckUtils]: 12: Hoare triple {2984#(and (= main_~i~0 3) (= main_~sum~0 3))} assume true; {2984#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-14 17:36:10,539 INFO L273 TraceCheckUtils]: 13: Hoare triple {2984#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {2991#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-14 17:36:10,540 INFO L273 TraceCheckUtils]: 14: Hoare triple {2991#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2995#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-14 17:36:10,541 INFO L273 TraceCheckUtils]: 15: Hoare triple {2995#(and (= main_~sum~0 6) (= main_~i~0 4))} assume true; {2995#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-14 17:36:10,542 INFO L273 TraceCheckUtils]: 16: Hoare triple {2995#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3002#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-14 17:36:10,550 INFO L273 TraceCheckUtils]: 17: Hoare triple {3002#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3006#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-14 17:36:10,551 INFO L273 TraceCheckUtils]: 18: Hoare triple {3006#(and (= main_~sum~0 10) (= main_~i~0 5))} assume true; {3006#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-14 17:36:10,552 INFO L273 TraceCheckUtils]: 19: Hoare triple {3006#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3013#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-14 17:36:10,552 INFO L273 TraceCheckUtils]: 20: Hoare triple {3013#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3017#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-14 17:36:10,553 INFO L273 TraceCheckUtils]: 21: Hoare triple {3017#(and (= main_~sum~0 15) (= main_~i~0 6))} assume true; {3017#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-14 17:36:10,553 INFO L273 TraceCheckUtils]: 22: Hoare triple {3017#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3024#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-14 17:36:10,554 INFO L273 TraceCheckUtils]: 23: Hoare triple {3024#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3028#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-14 17:36:10,555 INFO L273 TraceCheckUtils]: 24: Hoare triple {3028#(and (= main_~sum~0 21) (= main_~i~0 7))} assume true; {3028#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-14 17:36:10,556 INFO L273 TraceCheckUtils]: 25: Hoare triple {3028#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3035#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} is VALID [2018-11-14 17:36:10,557 INFO L273 TraceCheckUtils]: 26: Hoare triple {3035#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3039#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-14 17:36:10,557 INFO L273 TraceCheckUtils]: 27: Hoare triple {3039#(and (= main_~sum~0 28) (= main_~i~0 8))} assume true; {3039#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-14 17:36:10,558 INFO L273 TraceCheckUtils]: 28: Hoare triple {3039#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3046#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} is VALID [2018-11-14 17:36:10,559 INFO L273 TraceCheckUtils]: 29: Hoare triple {3046#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3050#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-14 17:36:10,560 INFO L273 TraceCheckUtils]: 30: Hoare triple {3050#(and (= main_~i~0 9) (= main_~sum~0 36))} assume true; {3050#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-14 17:36:10,561 INFO L273 TraceCheckUtils]: 31: Hoare triple {3050#(and (= main_~i~0 9) (= main_~sum~0 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3057#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} is VALID [2018-11-14 17:36:10,562 INFO L273 TraceCheckUtils]: 32: Hoare triple {3057#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3061#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-14 17:36:10,563 INFO L273 TraceCheckUtils]: 33: Hoare triple {3061#(and (= main_~sum~0 45) (= main_~i~0 10))} assume true; {3061#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-14 17:36:10,564 INFO L273 TraceCheckUtils]: 34: Hoare triple {3061#(and (= main_~sum~0 45) (= main_~i~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3068#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} is VALID [2018-11-14 17:36:10,565 INFO L273 TraceCheckUtils]: 35: Hoare triple {3068#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3072#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-14 17:36:10,581 INFO L273 TraceCheckUtils]: 36: Hoare triple {3072#(and (= main_~sum~0 55) (= main_~i~0 11))} assume true; {3072#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-14 17:36:10,582 INFO L273 TraceCheckUtils]: 37: Hoare triple {3072#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3079#(and (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} is VALID [2018-11-14 17:36:10,583 INFO L273 TraceCheckUtils]: 38: Hoare triple {3079#(and (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3083#(and (<= 11 main_~n~0) (<= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-14 17:36:10,584 INFO L273 TraceCheckUtils]: 39: Hoare triple {3083#(and (<= 11 main_~n~0) (<= main_~i~0 12) (= main_~sum~0 66))} assume true; {3083#(and (<= 11 main_~n~0) (<= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-14 17:36:10,584 INFO L273 TraceCheckUtils]: 40: Hoare triple {3083#(and (<= 11 main_~n~0) (<= main_~i~0 12) (= main_~sum~0 66))} assume !(~i~0 <= ~n~0); {3090#(and (<= 11 main_~n~0) (<= main_~n~0 11) (= main_~sum~0 66))} is VALID [2018-11-14 17:36:10,585 INFO L256 TraceCheckUtils]: 41: Hoare triple {3090#(and (<= 11 main_~n~0) (<= main_~n~0 11) (= main_~sum~0 66))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (~n~0 + 1) then 1 else 0)); {3094#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:36:10,586 INFO L273 TraceCheckUtils]: 42: Hoare triple {3094#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {3098#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:36:10,587 INFO L273 TraceCheckUtils]: 43: Hoare triple {3098#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {2943#false} is VALID [2018-11-14 17:36:10,587 INFO L273 TraceCheckUtils]: 44: Hoare triple {2943#false} assume !false; {2943#false} is VALID [2018-11-14 17:36:10,594 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:10,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:10,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-11-14 17:36:10,615 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 45 [2018-11-14 17:36:10,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:10,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-14 17:36:10,687 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-14 17:36:10,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-14 17:36:10,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-14 17:36:10,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-11-14 17:36:10,689 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 28 states. [2018-11-14 17:36:13,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:13,289 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-14 17:36:13,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-14 17:36:13,289 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 45 [2018-11-14 17:36:13,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:13,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 17:36:13,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 54 transitions. [2018-11-14 17:36:13,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 17:36:13,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 54 transitions. [2018-11-14 17:36:13,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 54 transitions. [2018-11-14 17:36:13,347 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:13,349 INFO L225 Difference]: With dead ends: 54 [2018-11-14 17:36:13,349 INFO L226 Difference]: Without dead ends: 49 [2018-11-14 17:36:13,350 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 18 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-14 17:36:13,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-14 17:36:13,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-14 17:36:13,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:13,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2018-11-14 17:36:13,388 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-14 17:36:13,388 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-14 17:36:13,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:13,390 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-11-14 17:36:13,390 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-11-14 17:36:13,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:13,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:13,391 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-14 17:36:13,391 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-14 17:36:13,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:13,392 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-11-14 17:36:13,392 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-11-14 17:36:13,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:13,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:13,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:13,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:13,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-14 17:36:13,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-11-14 17:36:13,393 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 45 [2018-11-14 17:36:13,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:13,393 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-11-14 17:36:13,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-14 17:36:13,394 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-11-14 17:36:13,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-14 17:36:13,394 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:13,394 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:13,395 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:13,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:13,395 INFO L82 PathProgramCache]: Analyzing trace with hash 613276151, now seen corresponding path program 12 times [2018-11-14 17:36:13,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:13,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:13,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:13,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:13,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:13,405 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:13,406 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:13,406 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-14 17:36:13,422 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:36:13,458 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-14 17:36:13,459 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:13,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:13,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:16,038 INFO L256 TraceCheckUtils]: 0: Hoare triple {3349#true} call ULTIMATE.init(); {3349#true} is VALID [2018-11-14 17:36:16,038 INFO L273 TraceCheckUtils]: 1: Hoare triple {3349#true} assume true; {3349#true} is VALID [2018-11-14 17:36:16,039 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3349#true} {3349#true} #38#return; {3349#true} is VALID [2018-11-14 17:36:16,039 INFO L256 TraceCheckUtils]: 3: Hoare triple {3349#true} call #t~ret3 := main(); {3349#true} is VALID [2018-11-14 17:36:16,039 INFO L273 TraceCheckUtils]: 4: Hoare triple {3349#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3349#true} is VALID [2018-11-14 17:36:16,043 INFO L273 TraceCheckUtils]: 5: Hoare triple {3349#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {3369#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-14 17:36:16,044 INFO L273 TraceCheckUtils]: 6: Hoare triple {3369#(and (= main_~sum~0 0) (= main_~i~0 1))} assume true; {3369#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-14 17:36:16,045 INFO L273 TraceCheckUtils]: 7: Hoare triple {3369#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3376#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-14 17:36:16,045 INFO L273 TraceCheckUtils]: 8: Hoare triple {3376#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3380#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} is VALID [2018-11-14 17:36:16,046 INFO L273 TraceCheckUtils]: 9: Hoare triple {3380#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} assume true; {3380#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} is VALID [2018-11-14 17:36:16,046 INFO L273 TraceCheckUtils]: 10: Hoare triple {3380#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3387#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-14 17:36:16,047 INFO L273 TraceCheckUtils]: 11: Hoare triple {3387#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3391#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-14 17:36:16,048 INFO L273 TraceCheckUtils]: 12: Hoare triple {3391#(and (= main_~i~0 3) (= main_~sum~0 3))} assume true; {3391#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-14 17:36:16,049 INFO L273 TraceCheckUtils]: 13: Hoare triple {3391#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3398#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-14 17:36:16,050 INFO L273 TraceCheckUtils]: 14: Hoare triple {3398#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3402#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-14 17:36:16,050 INFO L273 TraceCheckUtils]: 15: Hoare triple {3402#(and (= main_~sum~0 6) (= main_~i~0 4))} assume true; {3402#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-14 17:36:16,051 INFO L273 TraceCheckUtils]: 16: Hoare triple {3402#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3409#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-14 17:36:16,052 INFO L273 TraceCheckUtils]: 17: Hoare triple {3409#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3413#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-14 17:36:16,053 INFO L273 TraceCheckUtils]: 18: Hoare triple {3413#(and (= main_~sum~0 10) (= main_~i~0 5))} assume true; {3413#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-14 17:36:16,054 INFO L273 TraceCheckUtils]: 19: Hoare triple {3413#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3420#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-14 17:36:16,054 INFO L273 TraceCheckUtils]: 20: Hoare triple {3420#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3424#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-14 17:36:16,055 INFO L273 TraceCheckUtils]: 21: Hoare triple {3424#(and (= main_~sum~0 15) (= main_~i~0 6))} assume true; {3424#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-14 17:36:16,056 INFO L273 TraceCheckUtils]: 22: Hoare triple {3424#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3431#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-14 17:36:16,057 INFO L273 TraceCheckUtils]: 23: Hoare triple {3431#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3435#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-14 17:36:16,059 INFO L273 TraceCheckUtils]: 24: Hoare triple {3435#(and (= main_~sum~0 21) (= main_~i~0 7))} assume true; {3435#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-14 17:36:16,060 INFO L273 TraceCheckUtils]: 25: Hoare triple {3435#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3442#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} is VALID [2018-11-14 17:36:16,060 INFO L273 TraceCheckUtils]: 26: Hoare triple {3442#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3446#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-14 17:36:16,061 INFO L273 TraceCheckUtils]: 27: Hoare triple {3446#(and (= main_~sum~0 28) (= main_~i~0 8))} assume true; {3446#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-14 17:36:16,061 INFO L273 TraceCheckUtils]: 28: Hoare triple {3446#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3453#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} is VALID [2018-11-14 17:36:16,062 INFO L273 TraceCheckUtils]: 29: Hoare triple {3453#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3457#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-14 17:36:16,062 INFO L273 TraceCheckUtils]: 30: Hoare triple {3457#(and (= main_~i~0 9) (= main_~sum~0 36))} assume true; {3457#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-14 17:36:16,065 INFO L273 TraceCheckUtils]: 31: Hoare triple {3457#(and (= main_~i~0 9) (= main_~sum~0 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3464#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} is VALID [2018-11-14 17:36:16,065 INFO L273 TraceCheckUtils]: 32: Hoare triple {3464#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3468#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-14 17:36:16,066 INFO L273 TraceCheckUtils]: 33: Hoare triple {3468#(and (= main_~sum~0 45) (= main_~i~0 10))} assume true; {3468#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-14 17:36:16,066 INFO L273 TraceCheckUtils]: 34: Hoare triple {3468#(and (= main_~sum~0 45) (= main_~i~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3475#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} is VALID [2018-11-14 17:36:16,067 INFO L273 TraceCheckUtils]: 35: Hoare triple {3475#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3479#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-14 17:36:16,068 INFO L273 TraceCheckUtils]: 36: Hoare triple {3479#(and (= main_~sum~0 55) (= main_~i~0 11))} assume true; {3479#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-14 17:36:16,069 INFO L273 TraceCheckUtils]: 37: Hoare triple {3479#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3486#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} is VALID [2018-11-14 17:36:16,070 INFO L273 TraceCheckUtils]: 38: Hoare triple {3486#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3490#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-14 17:36:16,070 INFO L273 TraceCheckUtils]: 39: Hoare triple {3490#(and (= main_~i~0 12) (= main_~sum~0 66))} assume true; {3490#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-14 17:36:16,071 INFO L273 TraceCheckUtils]: 40: Hoare triple {3490#(and (= main_~i~0 12) (= main_~sum~0 66))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3497#(and (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} is VALID [2018-11-14 17:36:16,072 INFO L273 TraceCheckUtils]: 41: Hoare triple {3497#(and (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3501#(and (<= main_~i~0 13) (<= 12 main_~n~0) (= main_~sum~0 78))} is VALID [2018-11-14 17:36:16,073 INFO L273 TraceCheckUtils]: 42: Hoare triple {3501#(and (<= main_~i~0 13) (<= 12 main_~n~0) (= main_~sum~0 78))} assume true; {3501#(and (<= main_~i~0 13) (<= 12 main_~n~0) (= main_~sum~0 78))} is VALID [2018-11-14 17:36:16,074 INFO L273 TraceCheckUtils]: 43: Hoare triple {3501#(and (<= main_~i~0 13) (<= 12 main_~n~0) (= main_~sum~0 78))} assume !(~i~0 <= ~n~0); {3508#(and (<= 12 main_~n~0) (<= main_~n~0 12) (= main_~sum~0 78))} is VALID [2018-11-14 17:36:16,075 INFO L256 TraceCheckUtils]: 44: Hoare triple {3508#(and (<= 12 main_~n~0) (<= main_~n~0 12) (= main_~sum~0 78))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (~n~0 + 1) then 1 else 0)); {3512#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:36:16,076 INFO L273 TraceCheckUtils]: 45: Hoare triple {3512#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {3516#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:36:16,076 INFO L273 TraceCheckUtils]: 46: Hoare triple {3516#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {3350#false} is VALID [2018-11-14 17:36:16,077 INFO L273 TraceCheckUtils]: 47: Hoare triple {3350#false} assume !false; {3350#false} is VALID [2018-11-14 17:36:16,082 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:16,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:16,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-11-14 17:36:16,104 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 48 [2018-11-14 17:36:16,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:16,104 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-14 17:36:16,151 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:16,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-14 17:36:16,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-14 17:36:16,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2018-11-14 17:36:16,153 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 30 states. [2018-11-14 17:36:18,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:18,265 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-14 17:36:18,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-14 17:36:18,266 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 48 [2018-11-14 17:36:18,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:18,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 17:36:18,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 57 transitions. [2018-11-14 17:36:18,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 17:36:18,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 57 transitions. [2018-11-14 17:36:18,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 57 transitions. [2018-11-14 17:36:18,328 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-14 17:36:18,329 INFO L225 Difference]: With dead ends: 57 [2018-11-14 17:36:18,329 INFO L226 Difference]: Without dead ends: 52 [2018-11-14 17:36:18,330 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=66, Invalid=926, Unknown=0, NotChecked=0, Total=992 [2018-11-14 17:36:18,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-14 17:36:18,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-14 17:36:18,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:18,372 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2018-11-14 17:36:18,372 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-14 17:36:18,372 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-14 17:36:18,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:18,374 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-11-14 17:36:18,375 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-11-14 17:36:18,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:18,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:18,375 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-14 17:36:18,376 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-14 17:36:18,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:18,377 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-11-14 17:36:18,377 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-11-14 17:36:18,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:18,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:18,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:18,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:18,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-14 17:36:18,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-11-14 17:36:18,379 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 48 [2018-11-14 17:36:18,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:18,380 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-11-14 17:36:18,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-14 17:36:18,380 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-11-14 17:36:18,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-14 17:36:18,380 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:18,381 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:18,381 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:18,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:18,381 INFO L82 PathProgramCache]: Analyzing trace with hash 45932547, now seen corresponding path program 13 times [2018-11-14 17:36:18,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:18,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:18,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:18,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:18,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:18,392 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:18,393 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:18,393 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-14 17:36:18,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:36:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:18,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:19,738 INFO L256 TraceCheckUtils]: 0: Hoare triple {3781#true} call ULTIMATE.init(); {3781#true} is VALID [2018-11-14 17:36:19,738 INFO L273 TraceCheckUtils]: 1: Hoare triple {3781#true} assume true; {3781#true} is VALID [2018-11-14 17:36:19,738 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3781#true} {3781#true} #38#return; {3781#true} is VALID [2018-11-14 17:36:19,738 INFO L256 TraceCheckUtils]: 3: Hoare triple {3781#true} call #t~ret3 := main(); {3781#true} is VALID [2018-11-14 17:36:19,738 INFO L273 TraceCheckUtils]: 4: Hoare triple {3781#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3781#true} is VALID [2018-11-14 17:36:19,739 INFO L273 TraceCheckUtils]: 5: Hoare triple {3781#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {3801#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-14 17:36:19,739 INFO L273 TraceCheckUtils]: 6: Hoare triple {3801#(and (= main_~sum~0 0) (= main_~i~0 1))} assume true; {3801#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-14 17:36:19,740 INFO L273 TraceCheckUtils]: 7: Hoare triple {3801#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3808#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-14 17:36:19,740 INFO L273 TraceCheckUtils]: 8: Hoare triple {3808#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3812#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} is VALID [2018-11-14 17:36:19,741 INFO L273 TraceCheckUtils]: 9: Hoare triple {3812#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} assume true; {3812#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} is VALID [2018-11-14 17:36:19,741 INFO L273 TraceCheckUtils]: 10: Hoare triple {3812#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3819#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-14 17:36:19,742 INFO L273 TraceCheckUtils]: 11: Hoare triple {3819#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3823#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-14 17:36:19,743 INFO L273 TraceCheckUtils]: 12: Hoare triple {3823#(and (= main_~i~0 3) (= main_~sum~0 3))} assume true; {3823#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-14 17:36:19,744 INFO L273 TraceCheckUtils]: 13: Hoare triple {3823#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3830#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-14 17:36:19,744 INFO L273 TraceCheckUtils]: 14: Hoare triple {3830#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3834#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-14 17:36:19,745 INFO L273 TraceCheckUtils]: 15: Hoare triple {3834#(and (= main_~sum~0 6) (= main_~i~0 4))} assume true; {3834#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-14 17:36:19,746 INFO L273 TraceCheckUtils]: 16: Hoare triple {3834#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3841#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-14 17:36:19,747 INFO L273 TraceCheckUtils]: 17: Hoare triple {3841#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3845#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-14 17:36:19,748 INFO L273 TraceCheckUtils]: 18: Hoare triple {3845#(and (= main_~sum~0 10) (= main_~i~0 5))} assume true; {3845#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-14 17:36:19,749 INFO L273 TraceCheckUtils]: 19: Hoare triple {3845#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3852#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-14 17:36:19,749 INFO L273 TraceCheckUtils]: 20: Hoare triple {3852#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3856#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-14 17:36:19,750 INFO L273 TraceCheckUtils]: 21: Hoare triple {3856#(and (= main_~sum~0 15) (= main_~i~0 6))} assume true; {3856#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-14 17:36:19,751 INFO L273 TraceCheckUtils]: 22: Hoare triple {3856#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3863#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-14 17:36:19,752 INFO L273 TraceCheckUtils]: 23: Hoare triple {3863#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3867#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-14 17:36:19,752 INFO L273 TraceCheckUtils]: 24: Hoare triple {3867#(and (= main_~sum~0 21) (= main_~i~0 7))} assume true; {3867#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-14 17:36:19,753 INFO L273 TraceCheckUtils]: 25: Hoare triple {3867#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3874#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} is VALID [2018-11-14 17:36:19,754 INFO L273 TraceCheckUtils]: 26: Hoare triple {3874#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3878#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-14 17:36:19,755 INFO L273 TraceCheckUtils]: 27: Hoare triple {3878#(and (= main_~sum~0 28) (= main_~i~0 8))} assume true; {3878#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-14 17:36:19,756 INFO L273 TraceCheckUtils]: 28: Hoare triple {3878#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3885#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} is VALID [2018-11-14 17:36:19,757 INFO L273 TraceCheckUtils]: 29: Hoare triple {3885#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3889#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-14 17:36:19,757 INFO L273 TraceCheckUtils]: 30: Hoare triple {3889#(and (= main_~i~0 9) (= main_~sum~0 36))} assume true; {3889#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-14 17:36:19,758 INFO L273 TraceCheckUtils]: 31: Hoare triple {3889#(and (= main_~i~0 9) (= main_~sum~0 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3896#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} is VALID [2018-11-14 17:36:19,759 INFO L273 TraceCheckUtils]: 32: Hoare triple {3896#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3900#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-14 17:36:19,760 INFO L273 TraceCheckUtils]: 33: Hoare triple {3900#(and (= main_~sum~0 45) (= main_~i~0 10))} assume true; {3900#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-14 17:36:19,761 INFO L273 TraceCheckUtils]: 34: Hoare triple {3900#(and (= main_~sum~0 45) (= main_~i~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3907#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} is VALID [2018-11-14 17:36:19,762 INFO L273 TraceCheckUtils]: 35: Hoare triple {3907#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3911#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-14 17:36:19,763 INFO L273 TraceCheckUtils]: 36: Hoare triple {3911#(and (= main_~sum~0 55) (= main_~i~0 11))} assume true; {3911#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-14 17:36:19,764 INFO L273 TraceCheckUtils]: 37: Hoare triple {3911#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3918#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} is VALID [2018-11-14 17:36:19,765 INFO L273 TraceCheckUtils]: 38: Hoare triple {3918#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3922#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-14 17:36:19,765 INFO L273 TraceCheckUtils]: 39: Hoare triple {3922#(and (= main_~i~0 12) (= main_~sum~0 66))} assume true; {3922#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-14 17:36:19,766 INFO L273 TraceCheckUtils]: 40: Hoare triple {3922#(and (= main_~i~0 12) (= main_~sum~0 66))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3929#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} is VALID [2018-11-14 17:36:19,767 INFO L273 TraceCheckUtils]: 41: Hoare triple {3929#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3933#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-14 17:36:19,768 INFO L273 TraceCheckUtils]: 42: Hoare triple {3933#(and (= main_~i~0 13) (= main_~sum~0 78))} assume true; {3933#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-14 17:36:19,768 INFO L273 TraceCheckUtils]: 43: Hoare triple {3933#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {3940#(and (<= main_~i~0 main_~n~0) (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2018-11-14 17:36:19,769 INFO L273 TraceCheckUtils]: 44: Hoare triple {3940#(and (<= main_~i~0 main_~n~0) (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3944#(and (<= main_~i~0 14) (= main_~sum~0 91) (<= 13 main_~n~0))} is VALID [2018-11-14 17:36:19,770 INFO L273 TraceCheckUtils]: 45: Hoare triple {3944#(and (<= main_~i~0 14) (= main_~sum~0 91) (<= 13 main_~n~0))} assume true; {3944#(and (<= main_~i~0 14) (= main_~sum~0 91) (<= 13 main_~n~0))} is VALID [2018-11-14 17:36:19,771 INFO L273 TraceCheckUtils]: 46: Hoare triple {3944#(and (<= main_~i~0 14) (= main_~sum~0 91) (<= 13 main_~n~0))} assume !(~i~0 <= ~n~0); {3951#(and (<= main_~n~0 13) (= main_~sum~0 91) (<= 13 main_~n~0))} is VALID [2018-11-14 17:36:19,772 INFO L256 TraceCheckUtils]: 47: Hoare triple {3951#(and (<= main_~n~0 13) (= main_~sum~0 91) (<= 13 main_~n~0))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (~n~0 + 1) then 1 else 0)); {3955#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:36:19,773 INFO L273 TraceCheckUtils]: 48: Hoare triple {3955#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {3959#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:36:19,774 INFO L273 TraceCheckUtils]: 49: Hoare triple {3959#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {3782#false} is VALID [2018-11-14 17:36:19,774 INFO L273 TraceCheckUtils]: 50: Hoare triple {3782#false} assume !false; {3782#false} is VALID [2018-11-14 17:36:19,780 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:19,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:19,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-11-14 17:36:19,801 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 51 [2018-11-14 17:36:19,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:19,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-14 17:36:19,855 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-14 17:36:19,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-14 17:36:19,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-14 17:36:19,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-11-14 17:36:19,856 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 32 states. [2018-11-14 17:36:22,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:22,543 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-11-14 17:36:22,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-14 17:36:22,543 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 51 [2018-11-14 17:36:22,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:22,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 17:36:22,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 60 transitions. [2018-11-14 17:36:22,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 17:36:22,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 60 transitions. [2018-11-14 17:36:22,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 60 transitions. [2018-11-14 17:36:22,610 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:22,612 INFO L225 Difference]: With dead ends: 60 [2018-11-14 17:36:22,612 INFO L226 Difference]: Without dead ends: 55 [2018-11-14 17:36:22,613 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=70, Invalid=1052, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 17:36:22,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-14 17:36:22,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-14 17:36:22,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:22,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 55 states. [2018-11-14 17:36:22,693 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2018-11-14 17:36:22,693 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2018-11-14 17:36:22,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:22,694 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-11-14 17:36:22,694 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-11-14 17:36:22,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:22,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:22,695 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2018-11-14 17:36:22,695 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2018-11-14 17:36:22,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:22,697 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-11-14 17:36:22,697 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-11-14 17:36:22,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:22,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:22,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:22,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:22,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-14 17:36:22,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-11-14 17:36:22,699 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 51 [2018-11-14 17:36:22,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:22,699 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-11-14 17:36:22,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-14 17:36:22,699 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-11-14 17:36:22,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-14 17:36:22,700 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:22,700 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:22,701 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:22,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:22,701 INFO L82 PathProgramCache]: Analyzing trace with hash -991064457, now seen corresponding path program 14 times [2018-11-14 17:36:22,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:22,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:22,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:22,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:36:22,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:22,712 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:22,713 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:22,713 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-14 17:36:22,732 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:36:22,757 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:36:22,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:22,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:23,907 INFO L256 TraceCheckUtils]: 0: Hoare triple {4238#true} call ULTIMATE.init(); {4238#true} is VALID [2018-11-14 17:36:23,908 INFO L273 TraceCheckUtils]: 1: Hoare triple {4238#true} assume true; {4238#true} is VALID [2018-11-14 17:36:23,908 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4238#true} {4238#true} #38#return; {4238#true} is VALID [2018-11-14 17:36:23,908 INFO L256 TraceCheckUtils]: 3: Hoare triple {4238#true} call #t~ret3 := main(); {4238#true} is VALID [2018-11-14 17:36:23,908 INFO L273 TraceCheckUtils]: 4: Hoare triple {4238#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {4238#true} is VALID [2018-11-14 17:36:23,909 INFO L273 TraceCheckUtils]: 5: Hoare triple {4238#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {4258#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-14 17:36:23,909 INFO L273 TraceCheckUtils]: 6: Hoare triple {4258#(and (= main_~sum~0 0) (= main_~i~0 1))} assume true; {4258#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-14 17:36:23,910 INFO L273 TraceCheckUtils]: 7: Hoare triple {4258#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4265#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-14 17:36:23,910 INFO L273 TraceCheckUtils]: 8: Hoare triple {4265#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4269#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} is VALID [2018-11-14 17:36:23,911 INFO L273 TraceCheckUtils]: 9: Hoare triple {4269#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} assume true; {4269#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} is VALID [2018-11-14 17:36:23,911 INFO L273 TraceCheckUtils]: 10: Hoare triple {4269#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4276#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-14 17:36:23,912 INFO L273 TraceCheckUtils]: 11: Hoare triple {4276#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4280#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-14 17:36:23,912 INFO L273 TraceCheckUtils]: 12: Hoare triple {4280#(and (= main_~i~0 3) (= main_~sum~0 3))} assume true; {4280#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-14 17:36:23,913 INFO L273 TraceCheckUtils]: 13: Hoare triple {4280#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4287#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-14 17:36:23,914 INFO L273 TraceCheckUtils]: 14: Hoare triple {4287#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4291#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-14 17:36:23,915 INFO L273 TraceCheckUtils]: 15: Hoare triple {4291#(and (= main_~sum~0 6) (= main_~i~0 4))} assume true; {4291#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-14 17:36:23,915 INFO L273 TraceCheckUtils]: 16: Hoare triple {4291#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4298#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-14 17:36:23,916 INFO L273 TraceCheckUtils]: 17: Hoare triple {4298#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4302#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-14 17:36:23,917 INFO L273 TraceCheckUtils]: 18: Hoare triple {4302#(and (= main_~sum~0 10) (= main_~i~0 5))} assume true; {4302#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-14 17:36:23,918 INFO L273 TraceCheckUtils]: 19: Hoare triple {4302#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4309#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-14 17:36:23,923 INFO L273 TraceCheckUtils]: 20: Hoare triple {4309#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4313#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-14 17:36:23,924 INFO L273 TraceCheckUtils]: 21: Hoare triple {4313#(and (= main_~sum~0 15) (= main_~i~0 6))} assume true; {4313#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-14 17:36:23,924 INFO L273 TraceCheckUtils]: 22: Hoare triple {4313#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4320#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-14 17:36:23,925 INFO L273 TraceCheckUtils]: 23: Hoare triple {4320#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4324#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-14 17:36:23,925 INFO L273 TraceCheckUtils]: 24: Hoare triple {4324#(and (= main_~sum~0 21) (= main_~i~0 7))} assume true; {4324#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-14 17:36:23,925 INFO L273 TraceCheckUtils]: 25: Hoare triple {4324#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4331#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} is VALID [2018-11-14 17:36:23,926 INFO L273 TraceCheckUtils]: 26: Hoare triple {4331#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4335#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-14 17:36:23,927 INFO L273 TraceCheckUtils]: 27: Hoare triple {4335#(and (= main_~sum~0 28) (= main_~i~0 8))} assume true; {4335#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-14 17:36:23,927 INFO L273 TraceCheckUtils]: 28: Hoare triple {4335#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4342#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} is VALID [2018-11-14 17:36:23,928 INFO L273 TraceCheckUtils]: 29: Hoare triple {4342#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4346#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-14 17:36:23,929 INFO L273 TraceCheckUtils]: 30: Hoare triple {4346#(and (= main_~i~0 9) (= main_~sum~0 36))} assume true; {4346#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-14 17:36:23,930 INFO L273 TraceCheckUtils]: 31: Hoare triple {4346#(and (= main_~i~0 9) (= main_~sum~0 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4353#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} is VALID [2018-11-14 17:36:23,931 INFO L273 TraceCheckUtils]: 32: Hoare triple {4353#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4357#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-14 17:36:23,931 INFO L273 TraceCheckUtils]: 33: Hoare triple {4357#(and (= main_~sum~0 45) (= main_~i~0 10))} assume true; {4357#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-14 17:36:23,932 INFO L273 TraceCheckUtils]: 34: Hoare triple {4357#(and (= main_~sum~0 45) (= main_~i~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4364#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} is VALID [2018-11-14 17:36:23,933 INFO L273 TraceCheckUtils]: 35: Hoare triple {4364#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4368#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-14 17:36:23,934 INFO L273 TraceCheckUtils]: 36: Hoare triple {4368#(and (= main_~sum~0 55) (= main_~i~0 11))} assume true; {4368#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-14 17:36:23,934 INFO L273 TraceCheckUtils]: 37: Hoare triple {4368#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4375#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} is VALID [2018-11-14 17:36:23,935 INFO L273 TraceCheckUtils]: 38: Hoare triple {4375#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4379#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-14 17:36:23,936 INFO L273 TraceCheckUtils]: 39: Hoare triple {4379#(and (= main_~i~0 12) (= main_~sum~0 66))} assume true; {4379#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-14 17:36:23,937 INFO L273 TraceCheckUtils]: 40: Hoare triple {4379#(and (= main_~i~0 12) (= main_~sum~0 66))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4386#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} is VALID [2018-11-14 17:36:23,938 INFO L273 TraceCheckUtils]: 41: Hoare triple {4386#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4390#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-14 17:36:23,938 INFO L273 TraceCheckUtils]: 42: Hoare triple {4390#(and (= main_~i~0 13) (= main_~sum~0 78))} assume true; {4390#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-14 17:36:23,939 INFO L273 TraceCheckUtils]: 43: Hoare triple {4390#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4397#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2018-11-14 17:36:23,940 INFO L273 TraceCheckUtils]: 44: Hoare triple {4397#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4401#(and (= main_~i~0 14) (= main_~sum~0 91))} is VALID [2018-11-14 17:36:23,940 INFO L273 TraceCheckUtils]: 45: Hoare triple {4401#(and (= main_~i~0 14) (= main_~sum~0 91))} assume true; {4401#(and (= main_~i~0 14) (= main_~sum~0 91))} is VALID [2018-11-14 17:36:23,941 INFO L273 TraceCheckUtils]: 46: Hoare triple {4401#(and (= main_~i~0 14) (= main_~sum~0 91))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4408#(and (= main_~i~0 14) (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 91)))} is VALID [2018-11-14 17:36:23,942 INFO L273 TraceCheckUtils]: 47: Hoare triple {4408#(and (= main_~i~0 14) (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 91)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4412#(and (= main_~sum~0 105) (<= main_~i~0 15) (<= 14 main_~n~0))} is VALID [2018-11-14 17:36:23,943 INFO L273 TraceCheckUtils]: 48: Hoare triple {4412#(and (= main_~sum~0 105) (<= main_~i~0 15) (<= 14 main_~n~0))} assume true; {4412#(and (= main_~sum~0 105) (<= main_~i~0 15) (<= 14 main_~n~0))} is VALID [2018-11-14 17:36:23,944 INFO L273 TraceCheckUtils]: 49: Hoare triple {4412#(and (= main_~sum~0 105) (<= main_~i~0 15) (<= 14 main_~n~0))} assume !(~i~0 <= ~n~0); {4419#(and (= main_~sum~0 105) (<= 14 main_~n~0) (<= main_~n~0 14))} is VALID [2018-11-14 17:36:23,945 INFO L256 TraceCheckUtils]: 50: Hoare triple {4419#(and (= main_~sum~0 105) (<= 14 main_~n~0) (<= main_~n~0 14))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (~n~0 + 1) then 1 else 0)); {4423#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:36:23,946 INFO L273 TraceCheckUtils]: 51: Hoare triple {4423#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {4427#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:36:23,947 INFO L273 TraceCheckUtils]: 52: Hoare triple {4427#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {4239#false} is VALID [2018-11-14 17:36:23,947 INFO L273 TraceCheckUtils]: 53: Hoare triple {4239#false} assume !false; {4239#false} is VALID [2018-11-14 17:36:23,953 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:23,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:23,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-11-14 17:36:23,978 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 54 [2018-11-14 17:36:23,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:23,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-14 17:36:24,033 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:24,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-14 17:36:24,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-14 17:36:24,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 17:36:24,035 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 34 states. [2018-11-14 17:36:26,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:26,889 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-11-14 17:36:26,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-14 17:36:26,889 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 54 [2018-11-14 17:36:26,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:26,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 17:36:26,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 63 transitions. [2018-11-14 17:36:26,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 17:36:26,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 63 transitions. [2018-11-14 17:36:26,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 63 transitions. [2018-11-14 17:36:27,350 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-14 17:36:27,352 INFO L225 Difference]: With dead ends: 63 [2018-11-14 17:36:27,352 INFO L226 Difference]: Without dead ends: 58 [2018-11-14 17:36:27,353 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=74, Invalid=1186, Unknown=0, NotChecked=0, Total=1260 [2018-11-14 17:36:27,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-14 17:36:27,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-14 17:36:27,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:27,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2018-11-14 17:36:27,957 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-14 17:36:27,957 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-14 17:36:27,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:27,959 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-11-14 17:36:27,959 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-11-14 17:36:27,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:27,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:27,960 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-14 17:36:27,960 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-14 17:36:27,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:27,961 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-11-14 17:36:27,961 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-11-14 17:36:27,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:27,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:27,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:27,962 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:27,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-14 17:36:27,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-11-14 17:36:27,963 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 54 [2018-11-14 17:36:27,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:27,963 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-11-14 17:36:27,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-14 17:36:27,963 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-11-14 17:36:27,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-14 17:36:27,963 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:27,964 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:27,964 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:27,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:27,964 INFO L82 PathProgramCache]: Analyzing trace with hash -469050493, now seen corresponding path program 15 times [2018-11-14 17:36:27,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:27,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:27,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:27,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:27,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:27,986 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:27,986 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:27,987 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-14 17:36:27,996 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:36:28,045 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-14 17:36:28,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:28,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:29,108 INFO L256 TraceCheckUtils]: 0: Hoare triple {4720#true} call ULTIMATE.init(); {4720#true} is VALID [2018-11-14 17:36:29,109 INFO L273 TraceCheckUtils]: 1: Hoare triple {4720#true} assume true; {4720#true} is VALID [2018-11-14 17:36:29,109 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4720#true} {4720#true} #38#return; {4720#true} is VALID [2018-11-14 17:36:29,109 INFO L256 TraceCheckUtils]: 3: Hoare triple {4720#true} call #t~ret3 := main(); {4720#true} is VALID [2018-11-14 17:36:29,110 INFO L273 TraceCheckUtils]: 4: Hoare triple {4720#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {4720#true} is VALID [2018-11-14 17:36:29,110 INFO L273 TraceCheckUtils]: 5: Hoare triple {4720#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {4740#(and (= main_~sum~0 0) (= main_~i~0 1) (<= 1 main_~n~0))} is VALID [2018-11-14 17:36:29,126 INFO L273 TraceCheckUtils]: 6: Hoare triple {4740#(and (= main_~sum~0 0) (= main_~i~0 1) (<= 1 main_~n~0))} assume true; {4740#(and (= main_~sum~0 0) (= main_~i~0 1) (<= 1 main_~n~0))} is VALID [2018-11-14 17:36:29,127 INFO L273 TraceCheckUtils]: 7: Hoare triple {4740#(and (= main_~sum~0 0) (= main_~i~0 1) (<= 1 main_~n~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4747#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1) (<= 1 main_~n~0))} is VALID [2018-11-14 17:36:29,128 INFO L273 TraceCheckUtils]: 8: Hoare triple {4747#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1) (<= 1 main_~n~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4751#(and (= main_~i~0 2) (= main_~sum~0 1) (<= 1 main_~n~0))} is VALID [2018-11-14 17:36:29,128 INFO L273 TraceCheckUtils]: 9: Hoare triple {4751#(and (= main_~i~0 2) (= main_~sum~0 1) (<= 1 main_~n~0))} assume true; {4751#(and (= main_~i~0 2) (= main_~sum~0 1) (<= 1 main_~n~0))} is VALID [2018-11-14 17:36:29,129 INFO L273 TraceCheckUtils]: 10: Hoare triple {4751#(and (= main_~i~0 2) (= main_~sum~0 1) (<= 1 main_~n~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4758#(and (= main_~i~0 2) (<= 1 main_~n~0) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-14 17:36:29,129 INFO L273 TraceCheckUtils]: 11: Hoare triple {4758#(and (= main_~i~0 2) (<= 1 main_~n~0) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4762#(and (= main_~i~0 3) (<= 1 main_~n~0) (= main_~sum~0 3))} is VALID [2018-11-14 17:36:29,130 INFO L273 TraceCheckUtils]: 12: Hoare triple {4762#(and (= main_~i~0 3) (<= 1 main_~n~0) (= main_~sum~0 3))} assume true; {4762#(and (= main_~i~0 3) (<= 1 main_~n~0) (= main_~sum~0 3))} is VALID [2018-11-14 17:36:29,130 INFO L273 TraceCheckUtils]: 13: Hoare triple {4762#(and (= main_~i~0 3) (<= 1 main_~n~0) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4769#(and (= main_~i~0 3) (<= 1 main_~n~0) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-14 17:36:29,131 INFO L273 TraceCheckUtils]: 14: Hoare triple {4769#(and (= main_~i~0 3) (<= 1 main_~n~0) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4773#(and (= main_~sum~0 6) (<= 1 main_~n~0) (= main_~i~0 4))} is VALID [2018-11-14 17:36:29,132 INFO L273 TraceCheckUtils]: 15: Hoare triple {4773#(and (= main_~sum~0 6) (<= 1 main_~n~0) (= main_~i~0 4))} assume true; {4773#(and (= main_~sum~0 6) (<= 1 main_~n~0) (= main_~i~0 4))} is VALID [2018-11-14 17:36:29,133 INFO L273 TraceCheckUtils]: 16: Hoare triple {4773#(and (= main_~sum~0 6) (<= 1 main_~n~0) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4780#(and (= main_~sum~0 (+ main_~i~0 6)) (<= 1 main_~n~0) (= main_~i~0 4))} is VALID [2018-11-14 17:36:29,134 INFO L273 TraceCheckUtils]: 17: Hoare triple {4780#(and (= main_~sum~0 (+ main_~i~0 6)) (<= 1 main_~n~0) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4784#(and (<= 1 main_~n~0) (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-14 17:36:29,134 INFO L273 TraceCheckUtils]: 18: Hoare triple {4784#(and (<= 1 main_~n~0) (= main_~sum~0 10) (= main_~i~0 5))} assume true; {4784#(and (<= 1 main_~n~0) (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-14 17:36:29,135 INFO L273 TraceCheckUtils]: 19: Hoare triple {4784#(and (<= 1 main_~n~0) (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4791#(and (<= 1 main_~n~0) (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-14 17:36:29,136 INFO L273 TraceCheckUtils]: 20: Hoare triple {4791#(and (<= 1 main_~n~0) (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4795#(and (= main_~sum~0 15) (= main_~i~0 6) (<= 1 main_~n~0))} is VALID [2018-11-14 17:36:29,137 INFO L273 TraceCheckUtils]: 21: Hoare triple {4795#(and (= main_~sum~0 15) (= main_~i~0 6) (<= 1 main_~n~0))} assume true; {4795#(and (= main_~sum~0 15) (= main_~i~0 6) (<= 1 main_~n~0))} is VALID [2018-11-14 17:36:29,138 INFO L273 TraceCheckUtils]: 22: Hoare triple {4795#(and (= main_~sum~0 15) (= main_~i~0 6) (<= 1 main_~n~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4802#(and (= main_~i~0 6) (<= 1 main_~n~0) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-14 17:36:29,139 INFO L273 TraceCheckUtils]: 23: Hoare triple {4802#(and (= main_~i~0 6) (<= 1 main_~n~0) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4806#(and (<= 1 main_~n~0) (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-14 17:36:29,139 INFO L273 TraceCheckUtils]: 24: Hoare triple {4806#(and (<= 1 main_~n~0) (= main_~sum~0 21) (= main_~i~0 7))} assume true; {4806#(and (<= 1 main_~n~0) (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-14 17:36:29,140 INFO L273 TraceCheckUtils]: 25: Hoare triple {4806#(and (<= 1 main_~n~0) (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4813#(and (= (+ main_~i~0 21) main_~sum~0) (<= 1 main_~n~0) (= main_~i~0 7))} is VALID [2018-11-14 17:36:29,141 INFO L273 TraceCheckUtils]: 26: Hoare triple {4813#(and (= (+ main_~i~0 21) main_~sum~0) (<= 1 main_~n~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4817#(and (= main_~sum~0 28) (= main_~i~0 8) (<= 1 main_~n~0))} is VALID [2018-11-14 17:36:29,142 INFO L273 TraceCheckUtils]: 27: Hoare triple {4817#(and (= main_~sum~0 28) (= main_~i~0 8) (<= 1 main_~n~0))} assume true; {4817#(and (= main_~sum~0 28) (= main_~i~0 8) (<= 1 main_~n~0))} is VALID [2018-11-14 17:36:29,142 INFO L273 TraceCheckUtils]: 28: Hoare triple {4817#(and (= main_~sum~0 28) (= main_~i~0 8) (<= 1 main_~n~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4824#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)) (<= 1 main_~n~0))} is VALID [2018-11-14 17:36:29,143 INFO L273 TraceCheckUtils]: 29: Hoare triple {4824#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)) (<= 1 main_~n~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4828#(and (= main_~i~0 9) (<= 1 main_~n~0) (= main_~sum~0 36))} is VALID [2018-11-14 17:36:29,144 INFO L273 TraceCheckUtils]: 30: Hoare triple {4828#(and (= main_~i~0 9) (<= 1 main_~n~0) (= main_~sum~0 36))} assume true; {4828#(and (= main_~i~0 9) (<= 1 main_~n~0) (= main_~sum~0 36))} is VALID [2018-11-14 17:36:29,145 INFO L273 TraceCheckUtils]: 31: Hoare triple {4828#(and (= main_~i~0 9) (<= 1 main_~n~0) (= main_~sum~0 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4835#(and (= main_~i~0 9) (<= 1 main_~n~0) (= (+ main_~i~0 36) main_~sum~0))} is VALID [2018-11-14 17:36:29,146 INFO L273 TraceCheckUtils]: 32: Hoare triple {4835#(and (= main_~i~0 9) (<= 1 main_~n~0) (= (+ main_~i~0 36) main_~sum~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4839#(and (= main_~sum~0 45) (= main_~i~0 10) (<= 1 main_~n~0))} is VALID [2018-11-14 17:36:29,147 INFO L273 TraceCheckUtils]: 33: Hoare triple {4839#(and (= main_~sum~0 45) (= main_~i~0 10) (<= 1 main_~n~0))} assume true; {4839#(and (= main_~sum~0 45) (= main_~i~0 10) (<= 1 main_~n~0))} is VALID [2018-11-14 17:36:29,147 INFO L273 TraceCheckUtils]: 34: Hoare triple {4839#(and (= main_~sum~0 45) (= main_~i~0 10) (<= 1 main_~n~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4846#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10) (<= 1 main_~n~0))} is VALID [2018-11-14 17:36:29,148 INFO L273 TraceCheckUtils]: 35: Hoare triple {4846#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10) (<= 1 main_~n~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4850#(and (= main_~sum~0 55) (= main_~i~0 11) (<= 1 main_~n~0))} is VALID [2018-11-14 17:36:29,149 INFO L273 TraceCheckUtils]: 36: Hoare triple {4850#(and (= main_~sum~0 55) (= main_~i~0 11) (<= 1 main_~n~0))} assume true; {4850#(and (= main_~sum~0 55) (= main_~i~0 11) (<= 1 main_~n~0))} is VALID [2018-11-14 17:36:29,150 INFO L273 TraceCheckUtils]: 37: Hoare triple {4850#(and (= main_~sum~0 55) (= main_~i~0 11) (<= 1 main_~n~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4857#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11) (<= 1 main_~n~0))} is VALID [2018-11-14 17:36:29,151 INFO L273 TraceCheckUtils]: 38: Hoare triple {4857#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11) (<= 1 main_~n~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4861#(and (<= 1 main_~n~0) (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-14 17:36:29,151 INFO L273 TraceCheckUtils]: 39: Hoare triple {4861#(and (<= 1 main_~n~0) (= main_~i~0 12) (= main_~sum~0 66))} assume true; {4861#(and (<= 1 main_~n~0) (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-14 17:36:29,152 INFO L273 TraceCheckUtils]: 40: Hoare triple {4861#(and (<= 1 main_~n~0) (= main_~i~0 12) (= main_~sum~0 66))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4868#(and (= main_~sum~0 (+ main_~i~0 66)) (<= 1 main_~n~0) (= main_~i~0 12))} is VALID [2018-11-14 17:36:29,153 INFO L273 TraceCheckUtils]: 41: Hoare triple {4868#(and (= main_~sum~0 (+ main_~i~0 66)) (<= 1 main_~n~0) (= main_~i~0 12))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4872#(and (<= 1 main_~n~0) (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-14 17:36:29,154 INFO L273 TraceCheckUtils]: 42: Hoare triple {4872#(and (<= 1 main_~n~0) (= main_~i~0 13) (= main_~sum~0 78))} assume true; {4872#(and (<= 1 main_~n~0) (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-14 17:36:29,155 INFO L273 TraceCheckUtils]: 43: Hoare triple {4872#(and (<= 1 main_~n~0) (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4879#(and (<= 1 main_~n~0) (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2018-11-14 17:36:29,156 INFO L273 TraceCheckUtils]: 44: Hoare triple {4879#(and (<= 1 main_~n~0) (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4883#(and (= main_~i~0 14) (= main_~sum~0 91) (<= 1 main_~n~0))} is VALID [2018-11-14 17:36:29,156 INFO L273 TraceCheckUtils]: 45: Hoare triple {4883#(and (= main_~i~0 14) (= main_~sum~0 91) (<= 1 main_~n~0))} assume true; {4883#(and (= main_~i~0 14) (= main_~sum~0 91) (<= 1 main_~n~0))} is VALID [2018-11-14 17:36:29,157 INFO L273 TraceCheckUtils]: 46: Hoare triple {4883#(and (= main_~i~0 14) (= main_~sum~0 91) (<= 1 main_~n~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4890#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)) (<= 1 main_~n~0))} is VALID [2018-11-14 17:36:29,158 INFO L273 TraceCheckUtils]: 47: Hoare triple {4890#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)) (<= 1 main_~n~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4894#(and (= main_~sum~0 105) (<= 1 main_~n~0) (= main_~i~0 15))} is VALID [2018-11-14 17:36:29,159 INFO L273 TraceCheckUtils]: 48: Hoare triple {4894#(and (= main_~sum~0 105) (<= 1 main_~n~0) (= main_~i~0 15))} assume true; {4894#(and (= main_~sum~0 105) (<= 1 main_~n~0) (= main_~i~0 15))} is VALID [2018-11-14 17:36:29,160 INFO L273 TraceCheckUtils]: 49: Hoare triple {4894#(and (= main_~sum~0 105) (<= 1 main_~n~0) (= main_~i~0 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {4901#(and (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} is VALID [2018-11-14 17:36:29,161 INFO L273 TraceCheckUtils]: 50: Hoare triple {4901#(and (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4905#(and (<= 15 main_~n~0) (= main_~sum~0 120) (= main_~i~0 16))} is VALID [2018-11-14 17:36:29,161 INFO L273 TraceCheckUtils]: 51: Hoare triple {4905#(and (<= 15 main_~n~0) (= main_~sum~0 120) (= main_~i~0 16))} assume true; {4905#(and (<= 15 main_~n~0) (= main_~sum~0 120) (= main_~i~0 16))} is VALID [2018-11-14 17:36:29,162 INFO L273 TraceCheckUtils]: 52: Hoare triple {4905#(and (<= 15 main_~n~0) (= main_~sum~0 120) (= main_~i~0 16))} assume !(~i~0 <= ~n~0); {4912#(and (<= 15 main_~n~0) (= main_~sum~0 120) (< main_~n~0 16))} is VALID [2018-11-14 17:36:29,163 INFO L256 TraceCheckUtils]: 53: Hoare triple {4912#(and (<= 15 main_~n~0) (= main_~sum~0 120) (< main_~n~0 16))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (~n~0 + 1) then 1 else 0)); {4916#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:36:29,164 INFO L273 TraceCheckUtils]: 54: Hoare triple {4916#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {4920#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:36:29,165 INFO L273 TraceCheckUtils]: 55: Hoare triple {4920#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {4721#false} is VALID [2018-11-14 17:36:29,165 INFO L273 TraceCheckUtils]: 56: Hoare triple {4721#false} assume !false; {4721#false} is VALID [2018-11-14 17:36:29,172 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:29,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:29,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-11-14 17:36:29,194 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 57 [2018-11-14 17:36:29,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:29,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-14 17:36:29,256 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-14 17:36:29,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-14 17:36:29,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-14 17:36:29,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-11-14 17:36:29,258 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 36 states. [2018-11-14 17:36:32,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:32,467 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-11-14 17:36:32,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-14 17:36:32,467 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 57 [2018-11-14 17:36:32,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:32,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 17:36:32,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 66 transitions. [2018-11-14 17:36:32,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 17:36:32,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 66 transitions. [2018-11-14 17:36:32,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 66 transitions. [2018-11-14 17:36:33,000 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:33,002 INFO L225 Difference]: With dead ends: 66 [2018-11-14 17:36:33,002 INFO L226 Difference]: Without dead ends: 61 [2018-11-14 17:36:33,003 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=77, Invalid=1329, Unknown=0, NotChecked=0, Total=1406 [2018-11-14 17:36:33,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-14 17:36:33,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-14 17:36:33,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:33,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 61 states. [2018-11-14 17:36:33,056 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2018-11-14 17:36:33,056 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2018-11-14 17:36:33,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:33,058 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-11-14 17:36:33,058 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-11-14 17:36:33,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:33,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:33,059 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2018-11-14 17:36:33,059 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2018-11-14 17:36:33,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:33,060 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-11-14 17:36:33,061 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-11-14 17:36:33,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:33,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:33,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:33,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:33,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-14 17:36:33,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-11-14 17:36:33,063 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 57 [2018-11-14 17:36:33,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:33,063 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-11-14 17:36:33,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-14 17:36:33,063 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-11-14 17:36:33,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-14 17:36:33,064 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:33,064 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:33,064 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:33,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:33,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1227627785, now seen corresponding path program 16 times [2018-11-14 17:36:33,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:33,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:33,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:33,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:33,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:33,074 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:33,075 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:33,075 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-14 17:36:33,090 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:36:33,116 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:36:33,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:33,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:34,240 INFO L256 TraceCheckUtils]: 0: Hoare triple {5227#true} call ULTIMATE.init(); {5227#true} is VALID [2018-11-14 17:36:34,240 INFO L273 TraceCheckUtils]: 1: Hoare triple {5227#true} assume true; {5227#true} is VALID [2018-11-14 17:36:34,240 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5227#true} {5227#true} #38#return; {5227#true} is VALID [2018-11-14 17:36:34,241 INFO L256 TraceCheckUtils]: 3: Hoare triple {5227#true} call #t~ret3 := main(); {5227#true} is VALID [2018-11-14 17:36:34,241 INFO L273 TraceCheckUtils]: 4: Hoare triple {5227#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {5227#true} is VALID [2018-11-14 17:36:34,241 INFO L273 TraceCheckUtils]: 5: Hoare triple {5227#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {5247#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-14 17:36:34,242 INFO L273 TraceCheckUtils]: 6: Hoare triple {5247#(and (= main_~sum~0 0) (= main_~i~0 1))} assume true; {5247#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-14 17:36:34,242 INFO L273 TraceCheckUtils]: 7: Hoare triple {5247#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5254#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-14 17:36:34,243 INFO L273 TraceCheckUtils]: 8: Hoare triple {5254#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5258#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2018-11-14 17:36:34,243 INFO L273 TraceCheckUtils]: 9: Hoare triple {5258#(and (= main_~i~0 2) (= main_~sum~0 1))} assume true; {5258#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2018-11-14 17:36:34,244 INFO L273 TraceCheckUtils]: 10: Hoare triple {5258#(and (= main_~i~0 2) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5265#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-14 17:36:34,244 INFO L273 TraceCheckUtils]: 11: Hoare triple {5265#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5269#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-14 17:36:34,245 INFO L273 TraceCheckUtils]: 12: Hoare triple {5269#(and (= main_~i~0 3) (= main_~sum~0 3))} assume true; {5269#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-14 17:36:34,246 INFO L273 TraceCheckUtils]: 13: Hoare triple {5269#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5276#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-14 17:36:34,247 INFO L273 TraceCheckUtils]: 14: Hoare triple {5276#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5280#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-14 17:36:34,248 INFO L273 TraceCheckUtils]: 15: Hoare triple {5280#(and (= main_~sum~0 6) (= main_~i~0 4))} assume true; {5280#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-14 17:36:34,249 INFO L273 TraceCheckUtils]: 16: Hoare triple {5280#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5287#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-14 17:36:34,249 INFO L273 TraceCheckUtils]: 17: Hoare triple {5287#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5291#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-14 17:36:34,250 INFO L273 TraceCheckUtils]: 18: Hoare triple {5291#(and (= main_~sum~0 10) (= main_~i~0 5))} assume true; {5291#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-14 17:36:34,251 INFO L273 TraceCheckUtils]: 19: Hoare triple {5291#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5298#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-14 17:36:34,252 INFO L273 TraceCheckUtils]: 20: Hoare triple {5298#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5302#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-14 17:36:34,253 INFO L273 TraceCheckUtils]: 21: Hoare triple {5302#(and (= main_~sum~0 15) (= main_~i~0 6))} assume true; {5302#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-14 17:36:34,254 INFO L273 TraceCheckUtils]: 22: Hoare triple {5302#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5309#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-14 17:36:34,255 INFO L273 TraceCheckUtils]: 23: Hoare triple {5309#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5313#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-14 17:36:34,255 INFO L273 TraceCheckUtils]: 24: Hoare triple {5313#(and (= main_~sum~0 21) (= main_~i~0 7))} assume true; {5313#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-14 17:36:34,256 INFO L273 TraceCheckUtils]: 25: Hoare triple {5313#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5320#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} is VALID [2018-11-14 17:36:34,257 INFO L273 TraceCheckUtils]: 26: Hoare triple {5320#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5324#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-14 17:36:34,258 INFO L273 TraceCheckUtils]: 27: Hoare triple {5324#(and (= main_~sum~0 28) (= main_~i~0 8))} assume true; {5324#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-14 17:36:34,259 INFO L273 TraceCheckUtils]: 28: Hoare triple {5324#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5331#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} is VALID [2018-11-14 17:36:34,260 INFO L273 TraceCheckUtils]: 29: Hoare triple {5331#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5335#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-14 17:36:34,261 INFO L273 TraceCheckUtils]: 30: Hoare triple {5335#(and (= main_~i~0 9) (= main_~sum~0 36))} assume true; {5335#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-14 17:36:34,262 INFO L273 TraceCheckUtils]: 31: Hoare triple {5335#(and (= main_~i~0 9) (= main_~sum~0 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5342#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} is VALID [2018-11-14 17:36:34,262 INFO L273 TraceCheckUtils]: 32: Hoare triple {5342#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5346#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-14 17:36:34,263 INFO L273 TraceCheckUtils]: 33: Hoare triple {5346#(and (= main_~sum~0 45) (= main_~i~0 10))} assume true; {5346#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-14 17:36:34,264 INFO L273 TraceCheckUtils]: 34: Hoare triple {5346#(and (= main_~sum~0 45) (= main_~i~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5353#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} is VALID [2018-11-14 17:36:34,265 INFO L273 TraceCheckUtils]: 35: Hoare triple {5353#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5357#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-14 17:36:34,266 INFO L273 TraceCheckUtils]: 36: Hoare triple {5357#(and (= main_~sum~0 55) (= main_~i~0 11))} assume true; {5357#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-14 17:36:34,267 INFO L273 TraceCheckUtils]: 37: Hoare triple {5357#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5364#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} is VALID [2018-11-14 17:36:34,268 INFO L273 TraceCheckUtils]: 38: Hoare triple {5364#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5368#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-14 17:36:34,268 INFO L273 TraceCheckUtils]: 39: Hoare triple {5368#(and (= main_~i~0 12) (= main_~sum~0 66))} assume true; {5368#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-14 17:36:34,269 INFO L273 TraceCheckUtils]: 40: Hoare triple {5368#(and (= main_~i~0 12) (= main_~sum~0 66))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5375#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} is VALID [2018-11-14 17:36:34,270 INFO L273 TraceCheckUtils]: 41: Hoare triple {5375#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5379#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-14 17:36:34,271 INFO L273 TraceCheckUtils]: 42: Hoare triple {5379#(and (= main_~i~0 13) (= main_~sum~0 78))} assume true; {5379#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-14 17:36:34,272 INFO L273 TraceCheckUtils]: 43: Hoare triple {5379#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5386#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2018-11-14 17:36:34,273 INFO L273 TraceCheckUtils]: 44: Hoare triple {5386#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5390#(and (= main_~i~0 14) (= main_~sum~0 91))} is VALID [2018-11-14 17:36:34,273 INFO L273 TraceCheckUtils]: 45: Hoare triple {5390#(and (= main_~i~0 14) (= main_~sum~0 91))} assume true; {5390#(and (= main_~i~0 14) (= main_~sum~0 91))} is VALID [2018-11-14 17:36:34,274 INFO L273 TraceCheckUtils]: 46: Hoare triple {5390#(and (= main_~i~0 14) (= main_~sum~0 91))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5397#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} is VALID [2018-11-14 17:36:34,275 INFO L273 TraceCheckUtils]: 47: Hoare triple {5397#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5401#(and (= main_~sum~0 105) (= main_~i~0 15))} is VALID [2018-11-14 17:36:34,276 INFO L273 TraceCheckUtils]: 48: Hoare triple {5401#(and (= main_~sum~0 105) (= main_~i~0 15))} assume true; {5401#(and (= main_~sum~0 105) (= main_~i~0 15))} is VALID [2018-11-14 17:36:34,277 INFO L273 TraceCheckUtils]: 49: Hoare triple {5401#(and (= main_~sum~0 105) (= main_~i~0 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5408#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} is VALID [2018-11-14 17:36:34,278 INFO L273 TraceCheckUtils]: 50: Hoare triple {5408#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5412#(and (= main_~sum~0 120) (= main_~i~0 16))} is VALID [2018-11-14 17:36:34,278 INFO L273 TraceCheckUtils]: 51: Hoare triple {5412#(and (= main_~sum~0 120) (= main_~i~0 16))} assume true; {5412#(and (= main_~sum~0 120) (= main_~i~0 16))} is VALID [2018-11-14 17:36:34,279 INFO L273 TraceCheckUtils]: 52: Hoare triple {5412#(and (= main_~sum~0 120) (= main_~i~0 16))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5419#(and (<= main_~i~0 main_~n~0) (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} is VALID [2018-11-14 17:36:34,280 INFO L273 TraceCheckUtils]: 53: Hoare triple {5419#(and (<= main_~i~0 main_~n~0) (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5423#(and (<= main_~i~0 17) (= main_~sum~0 136) (<= 16 main_~n~0))} is VALID [2018-11-14 17:36:34,281 INFO L273 TraceCheckUtils]: 54: Hoare triple {5423#(and (<= main_~i~0 17) (= main_~sum~0 136) (<= 16 main_~n~0))} assume true; {5423#(and (<= main_~i~0 17) (= main_~sum~0 136) (<= 16 main_~n~0))} is VALID [2018-11-14 17:36:34,282 INFO L273 TraceCheckUtils]: 55: Hoare triple {5423#(and (<= main_~i~0 17) (= main_~sum~0 136) (<= 16 main_~n~0))} assume !(~i~0 <= ~n~0); {5430#(and (<= main_~n~0 16) (= main_~sum~0 136) (<= 16 main_~n~0))} is VALID [2018-11-14 17:36:34,284 INFO L256 TraceCheckUtils]: 56: Hoare triple {5430#(and (<= main_~n~0 16) (= main_~sum~0 136) (<= 16 main_~n~0))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (~n~0 + 1) then 1 else 0)); {5434#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:36:34,285 INFO L273 TraceCheckUtils]: 57: Hoare triple {5434#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {5438#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:36:34,285 INFO L273 TraceCheckUtils]: 58: Hoare triple {5438#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {5228#false} is VALID [2018-11-14 17:36:34,285 INFO L273 TraceCheckUtils]: 59: Hoare triple {5228#false} assume !false; {5228#false} is VALID [2018-11-14 17:36:34,294 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:34,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:34,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-11-14 17:36:34,323 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 60 [2018-11-14 17:36:34,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:34,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-14 17:36:34,385 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:34,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-14 17:36:34,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-14 17:36:34,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2018-11-14 17:36:34,386 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 38 states. [2018-11-14 17:36:37,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:37,922 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-11-14 17:36:37,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-14 17:36:37,922 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 60 [2018-11-14 17:36:37,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:37,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 17:36:37,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 69 transitions. [2018-11-14 17:36:37,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 17:36:37,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 69 transitions. [2018-11-14 17:36:37,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 69 transitions. [2018-11-14 17:36:37,996 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-14 17:36:37,997 INFO L225 Difference]: With dead ends: 69 [2018-11-14 17:36:37,997 INFO L226 Difference]: Without dead ends: 64 [2018-11-14 17:36:37,998 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=82, Invalid=1478, Unknown=0, NotChecked=0, Total=1560 [2018-11-14 17:36:37,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-14 17:36:38,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-14 17:36:38,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:38,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 64 states. [2018-11-14 17:36:38,045 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-14 17:36:38,046 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-14 17:36:38,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:38,047 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-11-14 17:36:38,047 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-11-14 17:36:38,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:38,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:38,048 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-14 17:36:38,048 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-14 17:36:38,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:38,049 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-11-14 17:36:38,049 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-11-14 17:36:38,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:38,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:38,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:38,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:38,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-14 17:36:38,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-11-14 17:36:38,051 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 60 [2018-11-14 17:36:38,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:38,052 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-11-14 17:36:38,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-14 17:36:38,052 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-11-14 17:36:38,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-14 17:36:38,053 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:38,053 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:38,053 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:38,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:38,053 INFO L82 PathProgramCache]: Analyzing trace with hash 114177795, now seen corresponding path program 17 times [2018-11-14 17:36:38,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:38,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:38,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:38,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:38,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:38,064 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:38,065 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:38,065 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-14 17:36:38,085 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:36:38,122 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-14 17:36:38,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:38,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:39,803 INFO L256 TraceCheckUtils]: 0: Hoare triple {5759#true} call ULTIMATE.init(); {5759#true} is VALID [2018-11-14 17:36:39,804 INFO L273 TraceCheckUtils]: 1: Hoare triple {5759#true} assume true; {5759#true} is VALID [2018-11-14 17:36:39,804 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5759#true} {5759#true} #38#return; {5759#true} is VALID [2018-11-14 17:36:39,804 INFO L256 TraceCheckUtils]: 3: Hoare triple {5759#true} call #t~ret3 := main(); {5759#true} is VALID [2018-11-14 17:36:39,805 INFO L273 TraceCheckUtils]: 4: Hoare triple {5759#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {5759#true} is VALID [2018-11-14 17:36:39,805 INFO L273 TraceCheckUtils]: 5: Hoare triple {5759#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {5779#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-14 17:36:39,806 INFO L273 TraceCheckUtils]: 6: Hoare triple {5779#(and (= main_~sum~0 0) (= main_~i~0 1))} assume true; {5779#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-14 17:36:39,807 INFO L273 TraceCheckUtils]: 7: Hoare triple {5779#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5786#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-14 17:36:39,808 INFO L273 TraceCheckUtils]: 8: Hoare triple {5786#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5790#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} is VALID [2018-11-14 17:36:39,808 INFO L273 TraceCheckUtils]: 9: Hoare triple {5790#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} assume true; {5790#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} is VALID [2018-11-14 17:36:39,809 INFO L273 TraceCheckUtils]: 10: Hoare triple {5790#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5797#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-14 17:36:39,810 INFO L273 TraceCheckUtils]: 11: Hoare triple {5797#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5801#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-14 17:36:39,810 INFO L273 TraceCheckUtils]: 12: Hoare triple {5801#(and (= main_~i~0 3) (= main_~sum~0 3))} assume true; {5801#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-14 17:36:39,811 INFO L273 TraceCheckUtils]: 13: Hoare triple {5801#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5808#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-14 17:36:39,812 INFO L273 TraceCheckUtils]: 14: Hoare triple {5808#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5812#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-14 17:36:39,813 INFO L273 TraceCheckUtils]: 15: Hoare triple {5812#(and (= main_~sum~0 6) (= main_~i~0 4))} assume true; {5812#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-14 17:36:39,814 INFO L273 TraceCheckUtils]: 16: Hoare triple {5812#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5819#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-14 17:36:39,815 INFO L273 TraceCheckUtils]: 17: Hoare triple {5819#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5823#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-14 17:36:39,815 INFO L273 TraceCheckUtils]: 18: Hoare triple {5823#(and (= main_~sum~0 10) (= main_~i~0 5))} assume true; {5823#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-14 17:36:39,816 INFO L273 TraceCheckUtils]: 19: Hoare triple {5823#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5830#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-14 17:36:39,817 INFO L273 TraceCheckUtils]: 20: Hoare triple {5830#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5834#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-14 17:36:39,818 INFO L273 TraceCheckUtils]: 21: Hoare triple {5834#(and (= main_~sum~0 15) (= main_~i~0 6))} assume true; {5834#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-14 17:36:39,819 INFO L273 TraceCheckUtils]: 22: Hoare triple {5834#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5841#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-14 17:36:39,819 INFO L273 TraceCheckUtils]: 23: Hoare triple {5841#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5845#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-14 17:36:39,820 INFO L273 TraceCheckUtils]: 24: Hoare triple {5845#(and (= main_~sum~0 21) (= main_~i~0 7))} assume true; {5845#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-14 17:36:39,821 INFO L273 TraceCheckUtils]: 25: Hoare triple {5845#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5852#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} is VALID [2018-11-14 17:36:39,822 INFO L273 TraceCheckUtils]: 26: Hoare triple {5852#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5856#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-14 17:36:39,822 INFO L273 TraceCheckUtils]: 27: Hoare triple {5856#(and (= main_~sum~0 28) (= main_~i~0 8))} assume true; {5856#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-14 17:36:39,823 INFO L273 TraceCheckUtils]: 28: Hoare triple {5856#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5863#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} is VALID [2018-11-14 17:36:39,824 INFO L273 TraceCheckUtils]: 29: Hoare triple {5863#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5867#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-14 17:36:39,825 INFO L273 TraceCheckUtils]: 30: Hoare triple {5867#(and (= main_~i~0 9) (= main_~sum~0 36))} assume true; {5867#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-14 17:36:39,825 INFO L273 TraceCheckUtils]: 31: Hoare triple {5867#(and (= main_~i~0 9) (= main_~sum~0 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5874#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} is VALID [2018-11-14 17:36:39,826 INFO L273 TraceCheckUtils]: 32: Hoare triple {5874#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5878#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-14 17:36:39,827 INFO L273 TraceCheckUtils]: 33: Hoare triple {5878#(and (= main_~sum~0 45) (= main_~i~0 10))} assume true; {5878#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-14 17:36:39,828 INFO L273 TraceCheckUtils]: 34: Hoare triple {5878#(and (= main_~sum~0 45) (= main_~i~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5885#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} is VALID [2018-11-14 17:36:39,829 INFO L273 TraceCheckUtils]: 35: Hoare triple {5885#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5889#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-14 17:36:39,829 INFO L273 TraceCheckUtils]: 36: Hoare triple {5889#(and (= main_~sum~0 55) (= main_~i~0 11))} assume true; {5889#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-14 17:36:39,830 INFO L273 TraceCheckUtils]: 37: Hoare triple {5889#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5896#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} is VALID [2018-11-14 17:36:39,831 INFO L273 TraceCheckUtils]: 38: Hoare triple {5896#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5900#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-14 17:36:39,832 INFO L273 TraceCheckUtils]: 39: Hoare triple {5900#(and (= main_~i~0 12) (= main_~sum~0 66))} assume true; {5900#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-14 17:36:39,852 INFO L273 TraceCheckUtils]: 40: Hoare triple {5900#(and (= main_~i~0 12) (= main_~sum~0 66))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5907#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} is VALID [2018-11-14 17:36:39,856 INFO L273 TraceCheckUtils]: 41: Hoare triple {5907#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5911#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-14 17:36:39,857 INFO L273 TraceCheckUtils]: 42: Hoare triple {5911#(and (= main_~i~0 13) (= main_~sum~0 78))} assume true; {5911#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-14 17:36:39,857 INFO L273 TraceCheckUtils]: 43: Hoare triple {5911#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5918#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2018-11-14 17:36:39,858 INFO L273 TraceCheckUtils]: 44: Hoare triple {5918#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5922#(and (= main_~i~0 14) (= main_~sum~0 91))} is VALID [2018-11-14 17:36:39,858 INFO L273 TraceCheckUtils]: 45: Hoare triple {5922#(and (= main_~i~0 14) (= main_~sum~0 91))} assume true; {5922#(and (= main_~i~0 14) (= main_~sum~0 91))} is VALID [2018-11-14 17:36:39,859 INFO L273 TraceCheckUtils]: 46: Hoare triple {5922#(and (= main_~i~0 14) (= main_~sum~0 91))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5929#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} is VALID [2018-11-14 17:36:39,859 INFO L273 TraceCheckUtils]: 47: Hoare triple {5929#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5933#(and (= main_~sum~0 105) (= main_~i~0 15))} is VALID [2018-11-14 17:36:39,860 INFO L273 TraceCheckUtils]: 48: Hoare triple {5933#(and (= main_~sum~0 105) (= main_~i~0 15))} assume true; {5933#(and (= main_~sum~0 105) (= main_~i~0 15))} is VALID [2018-11-14 17:36:39,861 INFO L273 TraceCheckUtils]: 49: Hoare triple {5933#(and (= main_~sum~0 105) (= main_~i~0 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5940#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} is VALID [2018-11-14 17:36:39,862 INFO L273 TraceCheckUtils]: 50: Hoare triple {5940#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5944#(and (= main_~sum~0 120) (= main_~i~0 16))} is VALID [2018-11-14 17:36:39,862 INFO L273 TraceCheckUtils]: 51: Hoare triple {5944#(and (= main_~sum~0 120) (= main_~i~0 16))} assume true; {5944#(and (= main_~sum~0 120) (= main_~i~0 16))} is VALID [2018-11-14 17:36:39,863 INFO L273 TraceCheckUtils]: 52: Hoare triple {5944#(and (= main_~sum~0 120) (= main_~i~0 16))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5951#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} is VALID [2018-11-14 17:36:39,864 INFO L273 TraceCheckUtils]: 53: Hoare triple {5951#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5955#(and (= main_~i~0 17) (= main_~sum~0 136))} is VALID [2018-11-14 17:36:39,865 INFO L273 TraceCheckUtils]: 54: Hoare triple {5955#(and (= main_~i~0 17) (= main_~sum~0 136))} assume true; {5955#(and (= main_~i~0 17) (= main_~sum~0 136))} is VALID [2018-11-14 17:36:39,865 INFO L273 TraceCheckUtils]: 55: Hoare triple {5955#(and (= main_~i~0 17) (= main_~sum~0 136))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {5962#(and (= main_~i~0 17) (<= main_~i~0 main_~n~0) (= (+ main_~i~0 136) main_~sum~0))} is VALID [2018-11-14 17:36:39,866 INFO L273 TraceCheckUtils]: 56: Hoare triple {5962#(and (= main_~i~0 17) (<= main_~i~0 main_~n~0) (= (+ main_~i~0 136) main_~sum~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5966#(and (<= main_~i~0 18) (= main_~sum~0 153) (<= 17 main_~n~0))} is VALID [2018-11-14 17:36:39,867 INFO L273 TraceCheckUtils]: 57: Hoare triple {5966#(and (<= main_~i~0 18) (= main_~sum~0 153) (<= 17 main_~n~0))} assume true; {5966#(and (<= main_~i~0 18) (= main_~sum~0 153) (<= 17 main_~n~0))} is VALID [2018-11-14 17:36:39,868 INFO L273 TraceCheckUtils]: 58: Hoare triple {5966#(and (<= main_~i~0 18) (= main_~sum~0 153) (<= 17 main_~n~0))} assume !(~i~0 <= ~n~0); {5973#(and (= main_~sum~0 153) (<= 17 main_~n~0) (<= main_~n~0 17))} is VALID [2018-11-14 17:36:39,869 INFO L256 TraceCheckUtils]: 59: Hoare triple {5973#(and (= main_~sum~0 153) (<= 17 main_~n~0) (<= main_~n~0 17))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (~n~0 + 1) then 1 else 0)); {5977#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:36:39,870 INFO L273 TraceCheckUtils]: 60: Hoare triple {5977#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {5981#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:36:39,871 INFO L273 TraceCheckUtils]: 61: Hoare triple {5981#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {5760#false} is VALID [2018-11-14 17:36:39,871 INFO L273 TraceCheckUtils]: 62: Hoare triple {5760#false} assume !false; {5760#false} is VALID [2018-11-14 17:36:39,878 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:39,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:39,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-11-14 17:36:39,899 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 63 [2018-11-14 17:36:39,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:39,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-14 17:36:39,966 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-14 17:36:39,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-14 17:36:39,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-14 17:36:39,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2018-11-14 17:36:39,968 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 40 states. [2018-11-14 17:36:43,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:43,937 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-11-14 17:36:43,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-14 17:36:43,937 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 63 [2018-11-14 17:36:43,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:43,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-14 17:36:43,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 72 transitions. [2018-11-14 17:36:43,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-14 17:36:43,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 72 transitions. [2018-11-14 17:36:43,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 72 transitions. [2018-11-14 17:36:44,074 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:44,076 INFO L225 Difference]: With dead ends: 72 [2018-11-14 17:36:44,077 INFO L226 Difference]: Without dead ends: 67 [2018-11-14 17:36:44,078 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=86, Invalid=1636, Unknown=0, NotChecked=0, Total=1722 [2018-11-14 17:36:44,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-14 17:36:44,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-14 17:36:44,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:44,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 67 states. [2018-11-14 17:36:44,149 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2018-11-14 17:36:44,149 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2018-11-14 17:36:44,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:44,151 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-11-14 17:36:44,151 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-11-14 17:36:44,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:44,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:44,152 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2018-11-14 17:36:44,152 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2018-11-14 17:36:44,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:44,153 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-11-14 17:36:44,153 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-11-14 17:36:44,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:44,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:44,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:44,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:44,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-14 17:36:44,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-11-14 17:36:44,155 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 63 [2018-11-14 17:36:44,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:44,156 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-11-14 17:36:44,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-14 17:36:44,156 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-11-14 17:36:44,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-14 17:36:44,157 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:44,157 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:44,157 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:44,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:44,157 INFO L82 PathProgramCache]: Analyzing trace with hash 583587703, now seen corresponding path program 18 times [2018-11-14 17:36:44,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:44,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:44,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:44,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:44,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:44,167 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:44,167 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:44,168 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-14 17:36:44,188 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:36:44,230 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-14 17:36:44,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:44,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:44,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:45,432 INFO L256 TraceCheckUtils]: 0: Hoare triple {6316#true} call ULTIMATE.init(); {6316#true} is VALID [2018-11-14 17:36:45,433 INFO L273 TraceCheckUtils]: 1: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:36:45,433 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6316#true} {6316#true} #38#return; {6316#true} is VALID [2018-11-14 17:36:45,433 INFO L256 TraceCheckUtils]: 3: Hoare triple {6316#true} call #t~ret3 := main(); {6316#true} is VALID [2018-11-14 17:36:45,433 INFO L273 TraceCheckUtils]: 4: Hoare triple {6316#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {6316#true} is VALID [2018-11-14 17:36:45,433 INFO L273 TraceCheckUtils]: 5: Hoare triple {6316#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {6336#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-14 17:36:45,434 INFO L273 TraceCheckUtils]: 6: Hoare triple {6336#(and (= main_~sum~0 0) (= main_~i~0 1))} assume true; {6336#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-14 17:36:45,435 INFO L273 TraceCheckUtils]: 7: Hoare triple {6336#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6343#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-14 17:36:45,436 INFO L273 TraceCheckUtils]: 8: Hoare triple {6343#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6347#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2018-11-14 17:36:45,436 INFO L273 TraceCheckUtils]: 9: Hoare triple {6347#(and (= main_~i~0 2) (= main_~sum~0 1))} assume true; {6347#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2018-11-14 17:36:45,437 INFO L273 TraceCheckUtils]: 10: Hoare triple {6347#(and (= main_~i~0 2) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6354#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-14 17:36:45,438 INFO L273 TraceCheckUtils]: 11: Hoare triple {6354#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6358#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-14 17:36:45,439 INFO L273 TraceCheckUtils]: 12: Hoare triple {6358#(and (= main_~i~0 3) (= main_~sum~0 3))} assume true; {6358#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-14 17:36:45,440 INFO L273 TraceCheckUtils]: 13: Hoare triple {6358#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6365#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-14 17:36:45,440 INFO L273 TraceCheckUtils]: 14: Hoare triple {6365#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6369#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-14 17:36:45,441 INFO L273 TraceCheckUtils]: 15: Hoare triple {6369#(and (= main_~sum~0 6) (= main_~i~0 4))} assume true; {6369#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-14 17:36:45,442 INFO L273 TraceCheckUtils]: 16: Hoare triple {6369#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6376#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-14 17:36:45,443 INFO L273 TraceCheckUtils]: 17: Hoare triple {6376#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6380#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-14 17:36:45,443 INFO L273 TraceCheckUtils]: 18: Hoare triple {6380#(and (= main_~sum~0 10) (= main_~i~0 5))} assume true; {6380#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-14 17:36:45,444 INFO L273 TraceCheckUtils]: 19: Hoare triple {6380#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6387#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-14 17:36:45,445 INFO L273 TraceCheckUtils]: 20: Hoare triple {6387#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6391#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-14 17:36:45,446 INFO L273 TraceCheckUtils]: 21: Hoare triple {6391#(and (= main_~sum~0 15) (= main_~i~0 6))} assume true; {6391#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-14 17:36:45,447 INFO L273 TraceCheckUtils]: 22: Hoare triple {6391#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6398#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-14 17:36:45,447 INFO L273 TraceCheckUtils]: 23: Hoare triple {6398#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6402#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-14 17:36:45,448 INFO L273 TraceCheckUtils]: 24: Hoare triple {6402#(and (= main_~sum~0 21) (= main_~i~0 7))} assume true; {6402#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-14 17:36:45,449 INFO L273 TraceCheckUtils]: 25: Hoare triple {6402#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6409#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} is VALID [2018-11-14 17:36:45,450 INFO L273 TraceCheckUtils]: 26: Hoare triple {6409#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6413#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-14 17:36:45,450 INFO L273 TraceCheckUtils]: 27: Hoare triple {6413#(and (= main_~sum~0 28) (= main_~i~0 8))} assume true; {6413#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-14 17:36:45,451 INFO L273 TraceCheckUtils]: 28: Hoare triple {6413#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6420#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} is VALID [2018-11-14 17:36:45,452 INFO L273 TraceCheckUtils]: 29: Hoare triple {6420#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6424#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-14 17:36:45,453 INFO L273 TraceCheckUtils]: 30: Hoare triple {6424#(and (= main_~i~0 9) (= main_~sum~0 36))} assume true; {6424#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-14 17:36:45,454 INFO L273 TraceCheckUtils]: 31: Hoare triple {6424#(and (= main_~i~0 9) (= main_~sum~0 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6431#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} is VALID [2018-11-14 17:36:45,455 INFO L273 TraceCheckUtils]: 32: Hoare triple {6431#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6435#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-14 17:36:45,456 INFO L273 TraceCheckUtils]: 33: Hoare triple {6435#(and (= main_~sum~0 45) (= main_~i~0 10))} assume true; {6435#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-14 17:36:45,457 INFO L273 TraceCheckUtils]: 34: Hoare triple {6435#(and (= main_~sum~0 45) (= main_~i~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6442#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} is VALID [2018-11-14 17:36:45,457 INFO L273 TraceCheckUtils]: 35: Hoare triple {6442#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6446#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-14 17:36:45,458 INFO L273 TraceCheckUtils]: 36: Hoare triple {6446#(and (= main_~sum~0 55) (= main_~i~0 11))} assume true; {6446#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-14 17:36:45,459 INFO L273 TraceCheckUtils]: 37: Hoare triple {6446#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6453#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} is VALID [2018-11-14 17:36:45,460 INFO L273 TraceCheckUtils]: 38: Hoare triple {6453#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6457#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-14 17:36:45,461 INFO L273 TraceCheckUtils]: 39: Hoare triple {6457#(and (= main_~i~0 12) (= main_~sum~0 66))} assume true; {6457#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-14 17:36:45,461 INFO L273 TraceCheckUtils]: 40: Hoare triple {6457#(and (= main_~i~0 12) (= main_~sum~0 66))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6464#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} is VALID [2018-11-14 17:36:45,462 INFO L273 TraceCheckUtils]: 41: Hoare triple {6464#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6468#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-14 17:36:45,463 INFO L273 TraceCheckUtils]: 42: Hoare triple {6468#(and (= main_~i~0 13) (= main_~sum~0 78))} assume true; {6468#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-14 17:36:45,464 INFO L273 TraceCheckUtils]: 43: Hoare triple {6468#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6475#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2018-11-14 17:36:45,464 INFO L273 TraceCheckUtils]: 44: Hoare triple {6475#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6479#(and (= main_~i~0 14) (= main_~sum~0 91))} is VALID [2018-11-14 17:36:45,465 INFO L273 TraceCheckUtils]: 45: Hoare triple {6479#(and (= main_~i~0 14) (= main_~sum~0 91))} assume true; {6479#(and (= main_~i~0 14) (= main_~sum~0 91))} is VALID [2018-11-14 17:36:45,466 INFO L273 TraceCheckUtils]: 46: Hoare triple {6479#(and (= main_~i~0 14) (= main_~sum~0 91))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6486#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} is VALID [2018-11-14 17:36:45,467 INFO L273 TraceCheckUtils]: 47: Hoare triple {6486#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6490#(and (= main_~sum~0 105) (= main_~i~0 15))} is VALID [2018-11-14 17:36:45,467 INFO L273 TraceCheckUtils]: 48: Hoare triple {6490#(and (= main_~sum~0 105) (= main_~i~0 15))} assume true; {6490#(and (= main_~sum~0 105) (= main_~i~0 15))} is VALID [2018-11-14 17:36:45,468 INFO L273 TraceCheckUtils]: 49: Hoare triple {6490#(and (= main_~sum~0 105) (= main_~i~0 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6497#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} is VALID [2018-11-14 17:36:45,469 INFO L273 TraceCheckUtils]: 50: Hoare triple {6497#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6501#(and (= main_~sum~0 120) (= main_~i~0 16))} is VALID [2018-11-14 17:36:45,469 INFO L273 TraceCheckUtils]: 51: Hoare triple {6501#(and (= main_~sum~0 120) (= main_~i~0 16))} assume true; {6501#(and (= main_~sum~0 120) (= main_~i~0 16))} is VALID [2018-11-14 17:36:45,470 INFO L273 TraceCheckUtils]: 52: Hoare triple {6501#(and (= main_~sum~0 120) (= main_~i~0 16))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6508#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} is VALID [2018-11-14 17:36:45,471 INFO L273 TraceCheckUtils]: 53: Hoare triple {6508#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6512#(and (= main_~i~0 17) (= main_~sum~0 136))} is VALID [2018-11-14 17:36:45,472 INFO L273 TraceCheckUtils]: 54: Hoare triple {6512#(and (= main_~i~0 17) (= main_~sum~0 136))} assume true; {6512#(and (= main_~i~0 17) (= main_~sum~0 136))} is VALID [2018-11-14 17:36:45,473 INFO L273 TraceCheckUtils]: 55: Hoare triple {6512#(and (= main_~i~0 17) (= main_~sum~0 136))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6519#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} is VALID [2018-11-14 17:36:45,473 INFO L273 TraceCheckUtils]: 56: Hoare triple {6519#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6523#(and (= main_~i~0 18) (= main_~sum~0 153))} is VALID [2018-11-14 17:36:45,474 INFO L273 TraceCheckUtils]: 57: Hoare triple {6523#(and (= main_~i~0 18) (= main_~sum~0 153))} assume true; {6523#(and (= main_~i~0 18) (= main_~sum~0 153))} is VALID [2018-11-14 17:36:45,475 INFO L273 TraceCheckUtils]: 58: Hoare triple {6523#(and (= main_~i~0 18) (= main_~sum~0 153))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6530#(and (= main_~i~0 18) (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 153)))} is VALID [2018-11-14 17:36:45,476 INFO L273 TraceCheckUtils]: 59: Hoare triple {6530#(and (= main_~i~0 18) (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 153)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6534#(and (<= main_~i~0 19) (<= 18 main_~n~0) (= main_~sum~0 171))} is VALID [2018-11-14 17:36:45,477 INFO L273 TraceCheckUtils]: 60: Hoare triple {6534#(and (<= main_~i~0 19) (<= 18 main_~n~0) (= main_~sum~0 171))} assume true; {6534#(and (<= main_~i~0 19) (<= 18 main_~n~0) (= main_~sum~0 171))} is VALID [2018-11-14 17:36:45,478 INFO L273 TraceCheckUtils]: 61: Hoare triple {6534#(and (<= main_~i~0 19) (<= 18 main_~n~0) (= main_~sum~0 171))} assume !(~i~0 <= ~n~0); {6541#(and (<= 18 main_~n~0) (= main_~sum~0 171) (<= main_~n~0 18))} is VALID [2018-11-14 17:36:45,479 INFO L256 TraceCheckUtils]: 62: Hoare triple {6541#(and (<= 18 main_~n~0) (= main_~sum~0 171) (<= main_~n~0 18))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (~n~0 + 1) then 1 else 0)); {6545#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:36:45,480 INFO L273 TraceCheckUtils]: 63: Hoare triple {6545#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {6549#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:36:45,480 INFO L273 TraceCheckUtils]: 64: Hoare triple {6549#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {6317#false} is VALID [2018-11-14 17:36:45,481 INFO L273 TraceCheckUtils]: 65: Hoare triple {6317#false} assume !false; {6317#false} is VALID [2018-11-14 17:36:45,488 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:45,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:45,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-11-14 17:36:45,509 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 66 [2018-11-14 17:36:45,510 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:45,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-14 17:36:45,577 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:45,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-14 17:36:45,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-14 17:36:45,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1640, Unknown=0, NotChecked=0, Total=1722 [2018-11-14 17:36:45,579 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 42 states. [2018-11-14 17:36:49,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:49,781 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-11-14 17:36:49,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-14 17:36:49,781 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 66 [2018-11-14 17:36:49,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:49,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 17:36:49,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 75 transitions. [2018-11-14 17:36:49,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 17:36:49,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 75 transitions. [2018-11-14 17:36:49,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 75 transitions. [2018-11-14 17:36:49,879 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-14 17:36:49,880 INFO L225 Difference]: With dead ends: 75 [2018-11-14 17:36:49,880 INFO L226 Difference]: Without dead ends: 70 [2018-11-14 17:36:49,882 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=90, Invalid=1802, Unknown=0, NotChecked=0, Total=1892 [2018-11-14 17:36:49,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-14 17:36:49,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-11-14 17:36:49,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:49,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 70 states. [2018-11-14 17:36:49,937 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2018-11-14 17:36:49,937 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2018-11-14 17:36:49,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:49,938 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-11-14 17:36:49,938 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-11-14 17:36:49,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:49,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:49,939 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2018-11-14 17:36:49,939 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2018-11-14 17:36:49,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:49,940 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-11-14 17:36:49,940 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-11-14 17:36:49,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:49,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:49,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:49,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:49,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-14 17:36:49,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-11-14 17:36:49,942 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 66 [2018-11-14 17:36:49,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:49,943 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-11-14 17:36:49,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-14 17:36:49,943 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-11-14 17:36:49,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-14 17:36:49,943 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:49,944 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:49,944 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:49,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:49,944 INFO L82 PathProgramCache]: Analyzing trace with hash 360641155, now seen corresponding path program 19 times [2018-11-14 17:36:49,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:49,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:49,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:49,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:49,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:49,955 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:49,955 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:49,955 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-14 17:36:49,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:36:50,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:50,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:51,907 INFO L256 TraceCheckUtils]: 0: Hoare triple {6898#true} call ULTIMATE.init(); {6898#true} is VALID [2018-11-14 17:36:51,908 INFO L273 TraceCheckUtils]: 1: Hoare triple {6898#true} assume true; {6898#true} is VALID [2018-11-14 17:36:51,908 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6898#true} {6898#true} #38#return; {6898#true} is VALID [2018-11-14 17:36:51,908 INFO L256 TraceCheckUtils]: 3: Hoare triple {6898#true} call #t~ret3 := main(); {6898#true} is VALID [2018-11-14 17:36:51,908 INFO L273 TraceCheckUtils]: 4: Hoare triple {6898#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {6898#true} is VALID [2018-11-14 17:36:51,909 INFO L273 TraceCheckUtils]: 5: Hoare triple {6898#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {6918#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-14 17:36:51,909 INFO L273 TraceCheckUtils]: 6: Hoare triple {6918#(and (= main_~sum~0 0) (= main_~i~0 1))} assume true; {6918#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-14 17:36:51,910 INFO L273 TraceCheckUtils]: 7: Hoare triple {6918#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6925#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-14 17:36:51,910 INFO L273 TraceCheckUtils]: 8: Hoare triple {6925#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6929#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2018-11-14 17:36:51,910 INFO L273 TraceCheckUtils]: 9: Hoare triple {6929#(and (= main_~i~0 2) (= main_~sum~0 1))} assume true; {6929#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2018-11-14 17:36:51,911 INFO L273 TraceCheckUtils]: 10: Hoare triple {6929#(and (= main_~i~0 2) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6936#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-14 17:36:51,912 INFO L273 TraceCheckUtils]: 11: Hoare triple {6936#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6940#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-14 17:36:51,913 INFO L273 TraceCheckUtils]: 12: Hoare triple {6940#(and (= main_~i~0 3) (= main_~sum~0 3))} assume true; {6940#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-14 17:36:51,913 INFO L273 TraceCheckUtils]: 13: Hoare triple {6940#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6947#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-14 17:36:51,914 INFO L273 TraceCheckUtils]: 14: Hoare triple {6947#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6951#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-14 17:36:51,915 INFO L273 TraceCheckUtils]: 15: Hoare triple {6951#(and (= main_~sum~0 6) (= main_~i~0 4))} assume true; {6951#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-14 17:36:51,916 INFO L273 TraceCheckUtils]: 16: Hoare triple {6951#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6958#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-14 17:36:51,917 INFO L273 TraceCheckUtils]: 17: Hoare triple {6958#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6962#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-14 17:36:51,917 INFO L273 TraceCheckUtils]: 18: Hoare triple {6962#(and (= main_~sum~0 10) (= main_~i~0 5))} assume true; {6962#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-14 17:36:51,918 INFO L273 TraceCheckUtils]: 19: Hoare triple {6962#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6969#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-14 17:36:51,919 INFO L273 TraceCheckUtils]: 20: Hoare triple {6969#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6973#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-14 17:36:51,920 INFO L273 TraceCheckUtils]: 21: Hoare triple {6973#(and (= main_~sum~0 15) (= main_~i~0 6))} assume true; {6973#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-14 17:36:51,920 INFO L273 TraceCheckUtils]: 22: Hoare triple {6973#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6980#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-14 17:36:51,921 INFO L273 TraceCheckUtils]: 23: Hoare triple {6980#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6984#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-14 17:36:51,922 INFO L273 TraceCheckUtils]: 24: Hoare triple {6984#(and (= main_~sum~0 21) (= main_~i~0 7))} assume true; {6984#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-14 17:36:51,940 INFO L273 TraceCheckUtils]: 25: Hoare triple {6984#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {6991#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} is VALID [2018-11-14 17:36:51,954 INFO L273 TraceCheckUtils]: 26: Hoare triple {6991#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6995#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-14 17:36:51,967 INFO L273 TraceCheckUtils]: 27: Hoare triple {6995#(and (= main_~sum~0 28) (= main_~i~0 8))} assume true; {6995#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-14 17:36:51,981 INFO L273 TraceCheckUtils]: 28: Hoare triple {6995#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7002#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} is VALID [2018-11-14 17:36:51,996 INFO L273 TraceCheckUtils]: 29: Hoare triple {7002#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7006#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-14 17:36:51,997 INFO L273 TraceCheckUtils]: 30: Hoare triple {7006#(and (= main_~i~0 9) (= main_~sum~0 36))} assume true; {7006#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-14 17:36:51,997 INFO L273 TraceCheckUtils]: 31: Hoare triple {7006#(and (= main_~i~0 9) (= main_~sum~0 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7013#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} is VALID [2018-11-14 17:36:52,017 INFO L273 TraceCheckUtils]: 32: Hoare triple {7013#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7017#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-14 17:36:52,026 INFO L273 TraceCheckUtils]: 33: Hoare triple {7017#(and (= main_~sum~0 45) (= main_~i~0 10))} assume true; {7017#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-14 17:36:52,034 INFO L273 TraceCheckUtils]: 34: Hoare triple {7017#(and (= main_~sum~0 45) (= main_~i~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7024#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} is VALID [2018-11-14 17:36:52,034 INFO L273 TraceCheckUtils]: 35: Hoare triple {7024#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7028#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-14 17:36:52,039 INFO L273 TraceCheckUtils]: 36: Hoare triple {7028#(and (= main_~sum~0 55) (= main_~i~0 11))} assume true; {7028#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-14 17:36:52,039 INFO L273 TraceCheckUtils]: 37: Hoare triple {7028#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7035#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} is VALID [2018-11-14 17:36:52,040 INFO L273 TraceCheckUtils]: 38: Hoare triple {7035#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7039#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-14 17:36:52,040 INFO L273 TraceCheckUtils]: 39: Hoare triple {7039#(and (= main_~i~0 12) (= main_~sum~0 66))} assume true; {7039#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-14 17:36:52,041 INFO L273 TraceCheckUtils]: 40: Hoare triple {7039#(and (= main_~i~0 12) (= main_~sum~0 66))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7046#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} is VALID [2018-11-14 17:36:52,041 INFO L273 TraceCheckUtils]: 41: Hoare triple {7046#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7050#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-14 17:36:52,042 INFO L273 TraceCheckUtils]: 42: Hoare triple {7050#(and (= main_~i~0 13) (= main_~sum~0 78))} assume true; {7050#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-14 17:36:52,042 INFO L273 TraceCheckUtils]: 43: Hoare triple {7050#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7057#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2018-11-14 17:36:52,043 INFO L273 TraceCheckUtils]: 44: Hoare triple {7057#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7061#(and (= main_~i~0 14) (= main_~sum~0 91))} is VALID [2018-11-14 17:36:52,043 INFO L273 TraceCheckUtils]: 45: Hoare triple {7061#(and (= main_~i~0 14) (= main_~sum~0 91))} assume true; {7061#(and (= main_~i~0 14) (= main_~sum~0 91))} is VALID [2018-11-14 17:36:52,044 INFO L273 TraceCheckUtils]: 46: Hoare triple {7061#(and (= main_~i~0 14) (= main_~sum~0 91))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7068#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} is VALID [2018-11-14 17:36:52,045 INFO L273 TraceCheckUtils]: 47: Hoare triple {7068#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7072#(and (= main_~sum~0 105) (= main_~i~0 15))} is VALID [2018-11-14 17:36:52,046 INFO L273 TraceCheckUtils]: 48: Hoare triple {7072#(and (= main_~sum~0 105) (= main_~i~0 15))} assume true; {7072#(and (= main_~sum~0 105) (= main_~i~0 15))} is VALID [2018-11-14 17:36:52,046 INFO L273 TraceCheckUtils]: 49: Hoare triple {7072#(and (= main_~sum~0 105) (= main_~i~0 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7079#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} is VALID [2018-11-14 17:36:52,047 INFO L273 TraceCheckUtils]: 50: Hoare triple {7079#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7083#(and (= main_~sum~0 120) (= main_~i~0 16))} is VALID [2018-11-14 17:36:52,048 INFO L273 TraceCheckUtils]: 51: Hoare triple {7083#(and (= main_~sum~0 120) (= main_~i~0 16))} assume true; {7083#(and (= main_~sum~0 120) (= main_~i~0 16))} is VALID [2018-11-14 17:36:52,049 INFO L273 TraceCheckUtils]: 52: Hoare triple {7083#(and (= main_~sum~0 120) (= main_~i~0 16))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7090#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} is VALID [2018-11-14 17:36:52,050 INFO L273 TraceCheckUtils]: 53: Hoare triple {7090#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7094#(and (= main_~i~0 17) (= main_~sum~0 136))} is VALID [2018-11-14 17:36:52,050 INFO L273 TraceCheckUtils]: 54: Hoare triple {7094#(and (= main_~i~0 17) (= main_~sum~0 136))} assume true; {7094#(and (= main_~i~0 17) (= main_~sum~0 136))} is VALID [2018-11-14 17:36:52,051 INFO L273 TraceCheckUtils]: 55: Hoare triple {7094#(and (= main_~i~0 17) (= main_~sum~0 136))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7101#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} is VALID [2018-11-14 17:36:52,052 INFO L273 TraceCheckUtils]: 56: Hoare triple {7101#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7105#(and (= main_~i~0 18) (= main_~sum~0 153))} is VALID [2018-11-14 17:36:52,052 INFO L273 TraceCheckUtils]: 57: Hoare triple {7105#(and (= main_~i~0 18) (= main_~sum~0 153))} assume true; {7105#(and (= main_~i~0 18) (= main_~sum~0 153))} is VALID [2018-11-14 17:36:52,053 INFO L273 TraceCheckUtils]: 58: Hoare triple {7105#(and (= main_~i~0 18) (= main_~sum~0 153))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7112#(and (= main_~i~0 18) (= main_~sum~0 (+ main_~i~0 153)))} is VALID [2018-11-14 17:36:52,054 INFO L273 TraceCheckUtils]: 59: Hoare triple {7112#(and (= main_~i~0 18) (= main_~sum~0 (+ main_~i~0 153)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7116#(and (= main_~i~0 19) (= main_~sum~0 171))} is VALID [2018-11-14 17:36:52,055 INFO L273 TraceCheckUtils]: 60: Hoare triple {7116#(and (= main_~i~0 19) (= main_~sum~0 171))} assume true; {7116#(and (= main_~i~0 19) (= main_~sum~0 171))} is VALID [2018-11-14 17:36:52,056 INFO L273 TraceCheckUtils]: 61: Hoare triple {7116#(and (= main_~i~0 19) (= main_~sum~0 171))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7123#(and (= (+ main_~i~0 171) main_~sum~0) (<= main_~i~0 main_~n~0) (= main_~i~0 19))} is VALID [2018-11-14 17:36:52,057 INFO L273 TraceCheckUtils]: 62: Hoare triple {7123#(and (= (+ main_~i~0 171) main_~sum~0) (<= main_~i~0 main_~n~0) (= main_~i~0 19))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7127#(and (<= 19 main_~n~0) (<= main_~i~0 20) (= main_~sum~0 190))} is VALID [2018-11-14 17:36:52,057 INFO L273 TraceCheckUtils]: 63: Hoare triple {7127#(and (<= 19 main_~n~0) (<= main_~i~0 20) (= main_~sum~0 190))} assume true; {7127#(and (<= 19 main_~n~0) (<= main_~i~0 20) (= main_~sum~0 190))} is VALID [2018-11-14 17:36:52,058 INFO L273 TraceCheckUtils]: 64: Hoare triple {7127#(and (<= 19 main_~n~0) (<= main_~i~0 20) (= main_~sum~0 190))} assume !(~i~0 <= ~n~0); {7134#(and (<= main_~n~0 19) (<= 19 main_~n~0) (= main_~sum~0 190))} is VALID [2018-11-14 17:36:52,059 INFO L256 TraceCheckUtils]: 65: Hoare triple {7134#(and (<= main_~n~0 19) (<= 19 main_~n~0) (= main_~sum~0 190))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (~n~0 + 1) then 1 else 0)); {7138#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:36:52,060 INFO L273 TraceCheckUtils]: 66: Hoare triple {7138#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {7142#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:36:52,061 INFO L273 TraceCheckUtils]: 67: Hoare triple {7142#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {6899#false} is VALID [2018-11-14 17:36:52,061 INFO L273 TraceCheckUtils]: 68: Hoare triple {6899#false} assume !false; {6899#false} is VALID [2018-11-14 17:36:52,071 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:52,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:52,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-11-14 17:36:52,092 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 69 [2018-11-14 17:36:52,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:52,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states. [2018-11-14 17:36:52,164 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-14 17:36:52,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-14 17:36:52,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-14 17:36:52,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2018-11-14 17:36:52,166 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 44 states. [2018-11-14 17:36:56,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:56,813 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-11-14 17:36:56,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-14 17:36:56,813 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 69 [2018-11-14 17:36:56,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:56,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 17:36:56,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 78 transitions. [2018-11-14 17:36:56,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 17:36:56,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 78 transitions. [2018-11-14 17:36:56,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 78 transitions. [2018-11-14 17:36:56,893 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:56,894 INFO L225 Difference]: With dead ends: 78 [2018-11-14 17:36:56,895 INFO L226 Difference]: Without dead ends: 73 [2018-11-14 17:36:56,896 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=94, Invalid=1976, Unknown=0, NotChecked=0, Total=2070 [2018-11-14 17:36:56,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-14 17:36:57,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-11-14 17:36:57,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:57,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 73 states. [2018-11-14 17:36:57,157 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 73 states. [2018-11-14 17:36:57,157 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 73 states. [2018-11-14 17:36:57,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:57,159 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-11-14 17:36:57,159 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-11-14 17:36:57,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:57,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:57,160 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 73 states. [2018-11-14 17:36:57,160 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 73 states. [2018-11-14 17:36:57,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:57,161 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-11-14 17:36:57,161 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-11-14 17:36:57,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:57,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:57,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:57,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:57,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-14 17:36:57,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-11-14 17:36:57,163 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 69 [2018-11-14 17:36:57,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:57,164 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-11-14 17:36:57,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-14 17:36:57,164 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-11-14 17:36:57,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-14 17:36:57,165 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:57,165 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:57,165 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:57,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:57,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1420530697, now seen corresponding path program 20 times [2018-11-14 17:36:57,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:57,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:57,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:57,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:36:57,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:57,175 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:57,175 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:57,175 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-14 17:36:57,193 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:36:57,224 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:36:57,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:57,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:59,140 INFO L256 TraceCheckUtils]: 0: Hoare triple {7505#true} call ULTIMATE.init(); {7505#true} is VALID [2018-11-14 17:36:59,141 INFO L273 TraceCheckUtils]: 1: Hoare triple {7505#true} assume true; {7505#true} is VALID [2018-11-14 17:36:59,141 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7505#true} {7505#true} #38#return; {7505#true} is VALID [2018-11-14 17:36:59,141 INFO L256 TraceCheckUtils]: 3: Hoare triple {7505#true} call #t~ret3 := main(); {7505#true} is VALID [2018-11-14 17:36:59,141 INFO L273 TraceCheckUtils]: 4: Hoare triple {7505#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {7505#true} is VALID [2018-11-14 17:36:59,141 INFO L273 TraceCheckUtils]: 5: Hoare triple {7505#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {7525#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-14 17:36:59,142 INFO L273 TraceCheckUtils]: 6: Hoare triple {7525#(and (= main_~sum~0 0) (= main_~i~0 1))} assume true; {7525#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-14 17:36:59,142 INFO L273 TraceCheckUtils]: 7: Hoare triple {7525#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7532#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-14 17:36:59,143 INFO L273 TraceCheckUtils]: 8: Hoare triple {7532#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7536#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2018-11-14 17:36:59,144 INFO L273 TraceCheckUtils]: 9: Hoare triple {7536#(and (= main_~i~0 2) (= main_~sum~0 1))} assume true; {7536#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2018-11-14 17:36:59,145 INFO L273 TraceCheckUtils]: 10: Hoare triple {7536#(and (= main_~i~0 2) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7543#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-14 17:36:59,146 INFO L273 TraceCheckUtils]: 11: Hoare triple {7543#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7547#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-14 17:36:59,147 INFO L273 TraceCheckUtils]: 12: Hoare triple {7547#(and (= main_~i~0 3) (= main_~sum~0 3))} assume true; {7547#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-14 17:36:59,147 INFO L273 TraceCheckUtils]: 13: Hoare triple {7547#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7554#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-14 17:36:59,148 INFO L273 TraceCheckUtils]: 14: Hoare triple {7554#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7558#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-14 17:36:59,149 INFO L273 TraceCheckUtils]: 15: Hoare triple {7558#(and (= main_~sum~0 6) (= main_~i~0 4))} assume true; {7558#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-14 17:36:59,150 INFO L273 TraceCheckUtils]: 16: Hoare triple {7558#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7565#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-14 17:36:59,151 INFO L273 TraceCheckUtils]: 17: Hoare triple {7565#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7569#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-14 17:36:59,152 INFO L273 TraceCheckUtils]: 18: Hoare triple {7569#(and (= main_~sum~0 10) (= main_~i~0 5))} assume true; {7569#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-14 17:36:59,153 INFO L273 TraceCheckUtils]: 19: Hoare triple {7569#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7576#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-14 17:36:59,154 INFO L273 TraceCheckUtils]: 20: Hoare triple {7576#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7580#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-14 17:36:59,154 INFO L273 TraceCheckUtils]: 21: Hoare triple {7580#(and (= main_~sum~0 15) (= main_~i~0 6))} assume true; {7580#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-14 17:36:59,155 INFO L273 TraceCheckUtils]: 22: Hoare triple {7580#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7587#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-14 17:36:59,156 INFO L273 TraceCheckUtils]: 23: Hoare triple {7587#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7591#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-14 17:36:59,157 INFO L273 TraceCheckUtils]: 24: Hoare triple {7591#(and (= main_~sum~0 21) (= main_~i~0 7))} assume true; {7591#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-14 17:36:59,158 INFO L273 TraceCheckUtils]: 25: Hoare triple {7591#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7598#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} is VALID [2018-11-14 17:36:59,159 INFO L273 TraceCheckUtils]: 26: Hoare triple {7598#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7602#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-14 17:36:59,159 INFO L273 TraceCheckUtils]: 27: Hoare triple {7602#(and (= main_~sum~0 28) (= main_~i~0 8))} assume true; {7602#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-14 17:36:59,160 INFO L273 TraceCheckUtils]: 28: Hoare triple {7602#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7609#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} is VALID [2018-11-14 17:36:59,161 INFO L273 TraceCheckUtils]: 29: Hoare triple {7609#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7613#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-14 17:36:59,162 INFO L273 TraceCheckUtils]: 30: Hoare triple {7613#(and (= main_~i~0 9) (= main_~sum~0 36))} assume true; {7613#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-14 17:36:59,163 INFO L273 TraceCheckUtils]: 31: Hoare triple {7613#(and (= main_~i~0 9) (= main_~sum~0 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7620#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} is VALID [2018-11-14 17:36:59,164 INFO L273 TraceCheckUtils]: 32: Hoare triple {7620#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7624#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-14 17:36:59,164 INFO L273 TraceCheckUtils]: 33: Hoare triple {7624#(and (= main_~sum~0 45) (= main_~i~0 10))} assume true; {7624#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-14 17:36:59,165 INFO L273 TraceCheckUtils]: 34: Hoare triple {7624#(and (= main_~sum~0 45) (= main_~i~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7631#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} is VALID [2018-11-14 17:36:59,166 INFO L273 TraceCheckUtils]: 35: Hoare triple {7631#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7635#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-14 17:36:59,167 INFO L273 TraceCheckUtils]: 36: Hoare triple {7635#(and (= main_~sum~0 55) (= main_~i~0 11))} assume true; {7635#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-14 17:36:59,168 INFO L273 TraceCheckUtils]: 37: Hoare triple {7635#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7642#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} is VALID [2018-11-14 17:36:59,169 INFO L273 TraceCheckUtils]: 38: Hoare triple {7642#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7646#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-14 17:36:59,170 INFO L273 TraceCheckUtils]: 39: Hoare triple {7646#(and (= main_~i~0 12) (= main_~sum~0 66))} assume true; {7646#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-14 17:36:59,170 INFO L273 TraceCheckUtils]: 40: Hoare triple {7646#(and (= main_~i~0 12) (= main_~sum~0 66))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7653#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} is VALID [2018-11-14 17:36:59,171 INFO L273 TraceCheckUtils]: 41: Hoare triple {7653#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7657#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-14 17:36:59,172 INFO L273 TraceCheckUtils]: 42: Hoare triple {7657#(and (= main_~i~0 13) (= main_~sum~0 78))} assume true; {7657#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-14 17:36:59,173 INFO L273 TraceCheckUtils]: 43: Hoare triple {7657#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7664#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2018-11-14 17:36:59,174 INFO L273 TraceCheckUtils]: 44: Hoare triple {7664#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7668#(and (= main_~i~0 14) (= main_~sum~0 91))} is VALID [2018-11-14 17:36:59,174 INFO L273 TraceCheckUtils]: 45: Hoare triple {7668#(and (= main_~i~0 14) (= main_~sum~0 91))} assume true; {7668#(and (= main_~i~0 14) (= main_~sum~0 91))} is VALID [2018-11-14 17:36:59,175 INFO L273 TraceCheckUtils]: 46: Hoare triple {7668#(and (= main_~i~0 14) (= main_~sum~0 91))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7675#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} is VALID [2018-11-14 17:36:59,176 INFO L273 TraceCheckUtils]: 47: Hoare triple {7675#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7679#(and (= main_~sum~0 105) (= main_~i~0 15))} is VALID [2018-11-14 17:36:59,177 INFO L273 TraceCheckUtils]: 48: Hoare triple {7679#(and (= main_~sum~0 105) (= main_~i~0 15))} assume true; {7679#(and (= main_~sum~0 105) (= main_~i~0 15))} is VALID [2018-11-14 17:36:59,178 INFO L273 TraceCheckUtils]: 49: Hoare triple {7679#(and (= main_~sum~0 105) (= main_~i~0 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7686#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} is VALID [2018-11-14 17:36:59,178 INFO L273 TraceCheckUtils]: 50: Hoare triple {7686#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7690#(and (= main_~sum~0 120) (= main_~i~0 16))} is VALID [2018-11-14 17:36:59,179 INFO L273 TraceCheckUtils]: 51: Hoare triple {7690#(and (= main_~sum~0 120) (= main_~i~0 16))} assume true; {7690#(and (= main_~sum~0 120) (= main_~i~0 16))} is VALID [2018-11-14 17:36:59,180 INFO L273 TraceCheckUtils]: 52: Hoare triple {7690#(and (= main_~sum~0 120) (= main_~i~0 16))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7697#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} is VALID [2018-11-14 17:36:59,181 INFO L273 TraceCheckUtils]: 53: Hoare triple {7697#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7701#(and (= main_~i~0 17) (= main_~sum~0 136))} is VALID [2018-11-14 17:36:59,182 INFO L273 TraceCheckUtils]: 54: Hoare triple {7701#(and (= main_~i~0 17) (= main_~sum~0 136))} assume true; {7701#(and (= main_~i~0 17) (= main_~sum~0 136))} is VALID [2018-11-14 17:36:59,183 INFO L273 TraceCheckUtils]: 55: Hoare triple {7701#(and (= main_~i~0 17) (= main_~sum~0 136))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7708#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} is VALID [2018-11-14 17:36:59,183 INFO L273 TraceCheckUtils]: 56: Hoare triple {7708#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7712#(and (= main_~i~0 18) (= main_~sum~0 153))} is VALID [2018-11-14 17:36:59,184 INFO L273 TraceCheckUtils]: 57: Hoare triple {7712#(and (= main_~i~0 18) (= main_~sum~0 153))} assume true; {7712#(and (= main_~i~0 18) (= main_~sum~0 153))} is VALID [2018-11-14 17:36:59,185 INFO L273 TraceCheckUtils]: 58: Hoare triple {7712#(and (= main_~i~0 18) (= main_~sum~0 153))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7719#(and (= main_~i~0 18) (= main_~sum~0 (+ main_~i~0 153)))} is VALID [2018-11-14 17:36:59,186 INFO L273 TraceCheckUtils]: 59: Hoare triple {7719#(and (= main_~i~0 18) (= main_~sum~0 (+ main_~i~0 153)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7723#(and (= main_~i~0 19) (= main_~sum~0 171))} is VALID [2018-11-14 17:36:59,187 INFO L273 TraceCheckUtils]: 60: Hoare triple {7723#(and (= main_~i~0 19) (= main_~sum~0 171))} assume true; {7723#(and (= main_~i~0 19) (= main_~sum~0 171))} is VALID [2018-11-14 17:36:59,188 INFO L273 TraceCheckUtils]: 61: Hoare triple {7723#(and (= main_~i~0 19) (= main_~sum~0 171))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7730#(and (= (+ main_~i~0 171) main_~sum~0) (= main_~i~0 19))} is VALID [2018-11-14 17:36:59,188 INFO L273 TraceCheckUtils]: 62: Hoare triple {7730#(and (= (+ main_~i~0 171) main_~sum~0) (= main_~i~0 19))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7734#(and (= main_~i~0 20) (= main_~sum~0 190))} is VALID [2018-11-14 17:36:59,189 INFO L273 TraceCheckUtils]: 63: Hoare triple {7734#(and (= main_~i~0 20) (= main_~sum~0 190))} assume true; {7734#(and (= main_~i~0 20) (= main_~sum~0 190))} is VALID [2018-11-14 17:36:59,190 INFO L273 TraceCheckUtils]: 64: Hoare triple {7734#(and (= main_~i~0 20) (= main_~sum~0 190))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {7741#(and (= main_~i~0 20) (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 190)))} is VALID [2018-11-14 17:36:59,191 INFO L273 TraceCheckUtils]: 65: Hoare triple {7741#(and (= main_~i~0 20) (<= main_~i~0 main_~n~0) (= main_~sum~0 (+ main_~i~0 190)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7745#(and (<= 20 main_~n~0) (<= main_~i~0 21) (= main_~sum~0 210))} is VALID [2018-11-14 17:36:59,192 INFO L273 TraceCheckUtils]: 66: Hoare triple {7745#(and (<= 20 main_~n~0) (<= main_~i~0 21) (= main_~sum~0 210))} assume true; {7745#(and (<= 20 main_~n~0) (<= main_~i~0 21) (= main_~sum~0 210))} is VALID [2018-11-14 17:36:59,193 INFO L273 TraceCheckUtils]: 67: Hoare triple {7745#(and (<= 20 main_~n~0) (<= main_~i~0 21) (= main_~sum~0 210))} assume !(~i~0 <= ~n~0); {7752#(and (<= main_~n~0 20) (<= 20 main_~n~0) (= main_~sum~0 210))} is VALID [2018-11-14 17:36:59,194 INFO L256 TraceCheckUtils]: 68: Hoare triple {7752#(and (<= main_~n~0 20) (<= 20 main_~n~0) (= main_~sum~0 210))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (~n~0 + 1) then 1 else 0)); {7756#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:36:59,195 INFO L273 TraceCheckUtils]: 69: Hoare triple {7756#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {7760#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:36:59,196 INFO L273 TraceCheckUtils]: 70: Hoare triple {7760#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {7506#false} is VALID [2018-11-14 17:36:59,196 INFO L273 TraceCheckUtils]: 71: Hoare triple {7506#false} assume !false; {7506#false} is VALID [2018-11-14 17:36:59,207 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:59,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:59,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-11-14 17:36:59,228 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 72 [2018-11-14 17:36:59,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:59,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states. [2018-11-14 17:36:59,309 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:59,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-14 17:36:59,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-14 17:36:59,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1980, Unknown=0, NotChecked=0, Total=2070 [2018-11-14 17:36:59,311 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 46 states. [2018-11-14 17:37:04,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:04,884 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-11-14 17:37:04,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-14 17:37:04,884 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 72 [2018-11-14 17:37:04,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:37:04,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-14 17:37:04,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 81 transitions. [2018-11-14 17:37:04,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-14 17:37:04,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 81 transitions. [2018-11-14 17:37:04,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 81 transitions. [2018-11-14 17:37:04,977 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-14 17:37:04,979 INFO L225 Difference]: With dead ends: 81 [2018-11-14 17:37:04,979 INFO L226 Difference]: Without dead ends: 76 [2018-11-14 17:37:04,981 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=98, Invalid=2158, Unknown=0, NotChecked=0, Total=2256 [2018-11-14 17:37:04,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-14 17:37:05,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-11-14 17:37:05,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:37:05,038 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 76 states. [2018-11-14 17:37:05,039 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2018-11-14 17:37:05,039 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2018-11-14 17:37:05,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:05,041 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-11-14 17:37:05,041 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-11-14 17:37:05,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:05,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:05,042 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2018-11-14 17:37:05,042 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2018-11-14 17:37:05,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:05,043 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-11-14 17:37:05,043 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-11-14 17:37:05,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:05,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:05,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:37:05,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:37:05,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-14 17:37:05,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-11-14 17:37:05,045 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 72 [2018-11-14 17:37:05,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:37:05,046 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-11-14 17:37:05,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-14 17:37:05,046 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-11-14 17:37:05,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-14 17:37:05,046 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:37:05,046 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:37:05,047 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:37:05,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:37:05,047 INFO L82 PathProgramCache]: Analyzing trace with hash 9768451, now seen corresponding path program 21 times [2018-11-14 17:37:05,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:37:05,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:37:05,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:05,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:37:05,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:05,057 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:37:05,057 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:37:05,058 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-14 17:37:05,079 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:37:05,166 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-14 17:37:05,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:37:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:05,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:37:07,164 INFO L256 TraceCheckUtils]: 0: Hoare triple {8137#true} call ULTIMATE.init(); {8137#true} is VALID [2018-11-14 17:37:07,164 INFO L273 TraceCheckUtils]: 1: Hoare triple {8137#true} assume true; {8137#true} is VALID [2018-11-14 17:37:07,165 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {8137#true} {8137#true} #38#return; {8137#true} is VALID [2018-11-14 17:37:07,165 INFO L256 TraceCheckUtils]: 3: Hoare triple {8137#true} call #t~ret3 := main(); {8137#true} is VALID [2018-11-14 17:37:07,165 INFO L273 TraceCheckUtils]: 4: Hoare triple {8137#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {8137#true} is VALID [2018-11-14 17:37:07,166 INFO L273 TraceCheckUtils]: 5: Hoare triple {8137#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {8157#(and (= main_~sum~0 0) (= main_~i~0 1) (<= 1 main_~n~0))} is VALID [2018-11-14 17:37:07,166 INFO L273 TraceCheckUtils]: 6: Hoare triple {8157#(and (= main_~sum~0 0) (= main_~i~0 1) (<= 1 main_~n~0))} assume true; {8157#(and (= main_~sum~0 0) (= main_~i~0 1) (<= 1 main_~n~0))} is VALID [2018-11-14 17:37:07,168 INFO L273 TraceCheckUtils]: 7: Hoare triple {8157#(and (= main_~sum~0 0) (= main_~i~0 1) (<= 1 main_~n~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8164#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1) (<= 1 main_~n~0))} is VALID [2018-11-14 17:37:07,168 INFO L273 TraceCheckUtils]: 8: Hoare triple {8164#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1) (<= 1 main_~n~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8168#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1) (<= 1 main_~n~0))} is VALID [2018-11-14 17:37:07,169 INFO L273 TraceCheckUtils]: 9: Hoare triple {8168#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1) (<= 1 main_~n~0))} assume true; {8168#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1) (<= 1 main_~n~0))} is VALID [2018-11-14 17:37:07,169 INFO L273 TraceCheckUtils]: 10: Hoare triple {8168#(and (= main_~i~0 (+ main_~sum~0 1)) (= main_~sum~0 1) (<= 1 main_~n~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8175#(and (= main_~i~0 2) (<= 1 main_~n~0) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-14 17:37:07,170 INFO L273 TraceCheckUtils]: 11: Hoare triple {8175#(and (= main_~i~0 2) (<= 1 main_~n~0) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8179#(and (= main_~i~0 3) (<= 1 main_~n~0) (= main_~sum~0 3))} is VALID [2018-11-14 17:37:07,170 INFO L273 TraceCheckUtils]: 12: Hoare triple {8179#(and (= main_~i~0 3) (<= 1 main_~n~0) (= main_~sum~0 3))} assume true; {8179#(and (= main_~i~0 3) (<= 1 main_~n~0) (= main_~sum~0 3))} is VALID [2018-11-14 17:37:07,171 INFO L273 TraceCheckUtils]: 13: Hoare triple {8179#(and (= main_~i~0 3) (<= 1 main_~n~0) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8186#(and (= main_~i~0 3) (<= 1 main_~n~0) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-14 17:37:07,172 INFO L273 TraceCheckUtils]: 14: Hoare triple {8186#(and (= main_~i~0 3) (<= 1 main_~n~0) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8190#(and (= main_~sum~0 6) (<= 1 main_~n~0) (= main_~i~0 4))} is VALID [2018-11-14 17:37:07,172 INFO L273 TraceCheckUtils]: 15: Hoare triple {8190#(and (= main_~sum~0 6) (<= 1 main_~n~0) (= main_~i~0 4))} assume true; {8190#(and (= main_~sum~0 6) (<= 1 main_~n~0) (= main_~i~0 4))} is VALID [2018-11-14 17:37:07,173 INFO L273 TraceCheckUtils]: 16: Hoare triple {8190#(and (= main_~sum~0 6) (<= 1 main_~n~0) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8197#(and (= main_~sum~0 (+ main_~i~0 6)) (<= 1 main_~n~0) (= main_~i~0 4))} is VALID [2018-11-14 17:37:07,174 INFO L273 TraceCheckUtils]: 17: Hoare triple {8197#(and (= main_~sum~0 (+ main_~i~0 6)) (<= 1 main_~n~0) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8201#(and (<= 1 main_~n~0) (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-14 17:37:07,175 INFO L273 TraceCheckUtils]: 18: Hoare triple {8201#(and (<= 1 main_~n~0) (= main_~sum~0 10) (= main_~i~0 5))} assume true; {8201#(and (<= 1 main_~n~0) (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-14 17:37:07,176 INFO L273 TraceCheckUtils]: 19: Hoare triple {8201#(and (<= 1 main_~n~0) (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8208#(and (<= 1 main_~n~0) (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-14 17:37:07,176 INFO L273 TraceCheckUtils]: 20: Hoare triple {8208#(and (<= 1 main_~n~0) (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8212#(and (= main_~sum~0 15) (= main_~i~0 6) (<= 1 main_~n~0))} is VALID [2018-11-14 17:37:07,177 INFO L273 TraceCheckUtils]: 21: Hoare triple {8212#(and (= main_~sum~0 15) (= main_~i~0 6) (<= 1 main_~n~0))} assume true; {8212#(and (= main_~sum~0 15) (= main_~i~0 6) (<= 1 main_~n~0))} is VALID [2018-11-14 17:37:07,178 INFO L273 TraceCheckUtils]: 22: Hoare triple {8212#(and (= main_~sum~0 15) (= main_~i~0 6) (<= 1 main_~n~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8219#(and (= main_~i~0 6) (<= 1 main_~n~0) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-14 17:37:07,179 INFO L273 TraceCheckUtils]: 23: Hoare triple {8219#(and (= main_~i~0 6) (<= 1 main_~n~0) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8223#(and (<= 1 main_~n~0) (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-14 17:37:07,180 INFO L273 TraceCheckUtils]: 24: Hoare triple {8223#(and (<= 1 main_~n~0) (= main_~sum~0 21) (= main_~i~0 7))} assume true; {8223#(and (<= 1 main_~n~0) (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-14 17:37:07,180 INFO L273 TraceCheckUtils]: 25: Hoare triple {8223#(and (<= 1 main_~n~0) (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8230#(and (= (+ main_~i~0 21) main_~sum~0) (<= 1 main_~n~0) (= main_~i~0 7))} is VALID [2018-11-14 17:37:07,181 INFO L273 TraceCheckUtils]: 26: Hoare triple {8230#(and (= (+ main_~i~0 21) main_~sum~0) (<= 1 main_~n~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8234#(and (= main_~sum~0 28) (= main_~i~0 8) (<= 1 main_~n~0))} is VALID [2018-11-14 17:37:07,182 INFO L273 TraceCheckUtils]: 27: Hoare triple {8234#(and (= main_~sum~0 28) (= main_~i~0 8) (<= 1 main_~n~0))} assume true; {8234#(and (= main_~sum~0 28) (= main_~i~0 8) (<= 1 main_~n~0))} is VALID [2018-11-14 17:37:07,183 INFO L273 TraceCheckUtils]: 28: Hoare triple {8234#(and (= main_~sum~0 28) (= main_~i~0 8) (<= 1 main_~n~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8241#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)) (<= 1 main_~n~0))} is VALID [2018-11-14 17:37:07,184 INFO L273 TraceCheckUtils]: 29: Hoare triple {8241#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)) (<= 1 main_~n~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8245#(and (= main_~i~0 9) (<= 1 main_~n~0) (= main_~sum~0 36))} is VALID [2018-11-14 17:37:07,184 INFO L273 TraceCheckUtils]: 30: Hoare triple {8245#(and (= main_~i~0 9) (<= 1 main_~n~0) (= main_~sum~0 36))} assume true; {8245#(and (= main_~i~0 9) (<= 1 main_~n~0) (= main_~sum~0 36))} is VALID [2018-11-14 17:37:07,185 INFO L273 TraceCheckUtils]: 31: Hoare triple {8245#(and (= main_~i~0 9) (<= 1 main_~n~0) (= main_~sum~0 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8252#(and (= main_~i~0 9) (<= 1 main_~n~0) (= (+ main_~i~0 36) main_~sum~0))} is VALID [2018-11-14 17:37:07,186 INFO L273 TraceCheckUtils]: 32: Hoare triple {8252#(and (= main_~i~0 9) (<= 1 main_~n~0) (= (+ main_~i~0 36) main_~sum~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8256#(and (= main_~sum~0 45) (= main_~i~0 10) (<= 1 main_~n~0))} is VALID [2018-11-14 17:37:07,187 INFO L273 TraceCheckUtils]: 33: Hoare triple {8256#(and (= main_~sum~0 45) (= main_~i~0 10) (<= 1 main_~n~0))} assume true; {8256#(and (= main_~sum~0 45) (= main_~i~0 10) (<= 1 main_~n~0))} is VALID [2018-11-14 17:37:07,188 INFO L273 TraceCheckUtils]: 34: Hoare triple {8256#(and (= main_~sum~0 45) (= main_~i~0 10) (<= 1 main_~n~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8263#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10) (<= 1 main_~n~0))} is VALID [2018-11-14 17:37:07,188 INFO L273 TraceCheckUtils]: 35: Hoare triple {8263#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10) (<= 1 main_~n~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8267#(and (= main_~sum~0 55) (= main_~i~0 11) (<= 1 main_~n~0))} is VALID [2018-11-14 17:37:07,189 INFO L273 TraceCheckUtils]: 36: Hoare triple {8267#(and (= main_~sum~0 55) (= main_~i~0 11) (<= 1 main_~n~0))} assume true; {8267#(and (= main_~sum~0 55) (= main_~i~0 11) (<= 1 main_~n~0))} is VALID [2018-11-14 17:37:07,190 INFO L273 TraceCheckUtils]: 37: Hoare triple {8267#(and (= main_~sum~0 55) (= main_~i~0 11) (<= 1 main_~n~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8274#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11) (<= 1 main_~n~0))} is VALID [2018-11-14 17:37:07,191 INFO L273 TraceCheckUtils]: 38: Hoare triple {8274#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11) (<= 1 main_~n~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8278#(and (<= 1 main_~n~0) (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-14 17:37:07,192 INFO L273 TraceCheckUtils]: 39: Hoare triple {8278#(and (<= 1 main_~n~0) (= main_~i~0 12) (= main_~sum~0 66))} assume true; {8278#(and (<= 1 main_~n~0) (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-14 17:37:07,193 INFO L273 TraceCheckUtils]: 40: Hoare triple {8278#(and (<= 1 main_~n~0) (= main_~i~0 12) (= main_~sum~0 66))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8285#(and (= main_~sum~0 (+ main_~i~0 66)) (<= 1 main_~n~0) (= main_~i~0 12))} is VALID [2018-11-14 17:37:07,193 INFO L273 TraceCheckUtils]: 41: Hoare triple {8285#(and (= main_~sum~0 (+ main_~i~0 66)) (<= 1 main_~n~0) (= main_~i~0 12))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8289#(and (<= 1 main_~n~0) (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-14 17:37:07,194 INFO L273 TraceCheckUtils]: 42: Hoare triple {8289#(and (<= 1 main_~n~0) (= main_~i~0 13) (= main_~sum~0 78))} assume true; {8289#(and (<= 1 main_~n~0) (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-14 17:37:07,195 INFO L273 TraceCheckUtils]: 43: Hoare triple {8289#(and (<= 1 main_~n~0) (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8296#(and (<= 1 main_~n~0) (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2018-11-14 17:37:07,196 INFO L273 TraceCheckUtils]: 44: Hoare triple {8296#(and (<= 1 main_~n~0) (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8300#(and (= main_~i~0 14) (= main_~sum~0 91) (<= 1 main_~n~0))} is VALID [2018-11-14 17:37:07,196 INFO L273 TraceCheckUtils]: 45: Hoare triple {8300#(and (= main_~i~0 14) (= main_~sum~0 91) (<= 1 main_~n~0))} assume true; {8300#(and (= main_~i~0 14) (= main_~sum~0 91) (<= 1 main_~n~0))} is VALID [2018-11-14 17:37:07,197 INFO L273 TraceCheckUtils]: 46: Hoare triple {8300#(and (= main_~i~0 14) (= main_~sum~0 91) (<= 1 main_~n~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8307#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)) (<= 1 main_~n~0))} is VALID [2018-11-14 17:37:07,198 INFO L273 TraceCheckUtils]: 47: Hoare triple {8307#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)) (<= 1 main_~n~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8311#(and (= main_~sum~0 105) (<= 1 main_~n~0) (= main_~i~0 15))} is VALID [2018-11-14 17:37:07,199 INFO L273 TraceCheckUtils]: 48: Hoare triple {8311#(and (= main_~sum~0 105) (<= 1 main_~n~0) (= main_~i~0 15))} assume true; {8311#(and (= main_~sum~0 105) (<= 1 main_~n~0) (= main_~i~0 15))} is VALID [2018-11-14 17:37:07,200 INFO L273 TraceCheckUtils]: 49: Hoare triple {8311#(and (= main_~sum~0 105) (<= 1 main_~n~0) (= main_~i~0 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8318#(and (= main_~sum~0 (+ main_~i~0 105)) (<= 1 main_~n~0) (= main_~i~0 15))} is VALID [2018-11-14 17:37:07,206 INFO L273 TraceCheckUtils]: 50: Hoare triple {8318#(and (= main_~sum~0 (+ main_~i~0 105)) (<= 1 main_~n~0) (= main_~i~0 15))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8322#(and (= main_~sum~0 120) (<= 1 main_~n~0) (= main_~i~0 16))} is VALID [2018-11-14 17:37:07,207 INFO L273 TraceCheckUtils]: 51: Hoare triple {8322#(and (= main_~sum~0 120) (<= 1 main_~n~0) (= main_~i~0 16))} assume true; {8322#(and (= main_~sum~0 120) (<= 1 main_~n~0) (= main_~i~0 16))} is VALID [2018-11-14 17:37:07,207 INFO L273 TraceCheckUtils]: 52: Hoare triple {8322#(and (= main_~sum~0 120) (<= 1 main_~n~0) (= main_~i~0 16))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8329#(and (<= 1 main_~n~0) (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} is VALID [2018-11-14 17:37:07,208 INFO L273 TraceCheckUtils]: 53: Hoare triple {8329#(and (<= 1 main_~n~0) (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8333#(and (= main_~i~0 17) (<= 1 main_~n~0) (= main_~sum~0 136))} is VALID [2018-11-14 17:37:07,208 INFO L273 TraceCheckUtils]: 54: Hoare triple {8333#(and (= main_~i~0 17) (<= 1 main_~n~0) (= main_~sum~0 136))} assume true; {8333#(and (= main_~i~0 17) (<= 1 main_~n~0) (= main_~sum~0 136))} is VALID [2018-11-14 17:37:07,209 INFO L273 TraceCheckUtils]: 55: Hoare triple {8333#(and (= main_~i~0 17) (<= 1 main_~n~0) (= main_~sum~0 136))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8340#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0) (<= 1 main_~n~0))} is VALID [2018-11-14 17:37:07,209 INFO L273 TraceCheckUtils]: 56: Hoare triple {8340#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0) (<= 1 main_~n~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8344#(and (= main_~i~0 18) (= main_~sum~0 153) (<= 1 main_~n~0))} is VALID [2018-11-14 17:37:07,210 INFO L273 TraceCheckUtils]: 57: Hoare triple {8344#(and (= main_~i~0 18) (= main_~sum~0 153) (<= 1 main_~n~0))} assume true; {8344#(and (= main_~i~0 18) (= main_~sum~0 153) (<= 1 main_~n~0))} is VALID [2018-11-14 17:37:07,211 INFO L273 TraceCheckUtils]: 58: Hoare triple {8344#(and (= main_~i~0 18) (= main_~sum~0 153) (<= 1 main_~n~0))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8351#(and (= main_~i~0 18) (= main_~sum~0 (+ main_~i~0 153)) (<= 1 main_~n~0))} is VALID [2018-11-14 17:37:07,212 INFO L273 TraceCheckUtils]: 59: Hoare triple {8351#(and (= main_~i~0 18) (= main_~sum~0 (+ main_~i~0 153)) (<= 1 main_~n~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8355#(and (<= 1 main_~n~0) (= main_~i~0 19) (= main_~sum~0 171))} is VALID [2018-11-14 17:37:07,212 INFO L273 TraceCheckUtils]: 60: Hoare triple {8355#(and (<= 1 main_~n~0) (= main_~i~0 19) (= main_~sum~0 171))} assume true; {8355#(and (<= 1 main_~n~0) (= main_~i~0 19) (= main_~sum~0 171))} is VALID [2018-11-14 17:37:07,213 INFO L273 TraceCheckUtils]: 61: Hoare triple {8355#(and (<= 1 main_~n~0) (= main_~i~0 19) (= main_~sum~0 171))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8362#(and (= (+ main_~i~0 171) main_~sum~0) (<= 1 main_~n~0) (= main_~i~0 19))} is VALID [2018-11-14 17:37:07,214 INFO L273 TraceCheckUtils]: 62: Hoare triple {8362#(and (= (+ main_~i~0 171) main_~sum~0) (<= 1 main_~n~0) (= main_~i~0 19))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8366#(and (= main_~i~0 20) (<= 1 main_~n~0) (= main_~sum~0 190))} is VALID [2018-11-14 17:37:07,215 INFO L273 TraceCheckUtils]: 63: Hoare triple {8366#(and (= main_~i~0 20) (<= 1 main_~n~0) (= main_~sum~0 190))} assume true; {8366#(and (= main_~i~0 20) (<= 1 main_~n~0) (= main_~sum~0 190))} is VALID [2018-11-14 17:37:07,215 INFO L273 TraceCheckUtils]: 64: Hoare triple {8366#(and (= main_~i~0 20) (<= 1 main_~n~0) (= main_~sum~0 190))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8373#(and (= main_~i~0 20) (<= 1 main_~n~0) (= main_~sum~0 (+ main_~i~0 190)))} is VALID [2018-11-14 17:37:07,216 INFO L273 TraceCheckUtils]: 65: Hoare triple {8373#(and (= main_~i~0 20) (<= 1 main_~n~0) (= main_~sum~0 (+ main_~i~0 190)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8377#(and (<= 1 main_~n~0) (= main_~i~0 21) (= main_~sum~0 210))} is VALID [2018-11-14 17:37:07,217 INFO L273 TraceCheckUtils]: 66: Hoare triple {8377#(and (<= 1 main_~n~0) (= main_~i~0 21) (= main_~sum~0 210))} assume true; {8377#(and (<= 1 main_~n~0) (= main_~i~0 21) (= main_~sum~0 210))} is VALID [2018-11-14 17:37:07,218 INFO L273 TraceCheckUtils]: 67: Hoare triple {8377#(and (<= 1 main_~n~0) (= main_~i~0 21) (= main_~sum~0 210))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8384#(and (= main_~sum~0 (+ main_~i~0 210)) (<= main_~i~0 main_~n~0) (= main_~i~0 21))} is VALID [2018-11-14 17:37:07,219 INFO L273 TraceCheckUtils]: 68: Hoare triple {8384#(and (= main_~sum~0 (+ main_~i~0 210)) (<= main_~i~0 main_~n~0) (= main_~i~0 21))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8388#(and (<= 21 main_~n~0) (= main_~sum~0 231) (= main_~i~0 22))} is VALID [2018-11-14 17:37:07,220 INFO L273 TraceCheckUtils]: 69: Hoare triple {8388#(and (<= 21 main_~n~0) (= main_~sum~0 231) (= main_~i~0 22))} assume true; {8388#(and (<= 21 main_~n~0) (= main_~sum~0 231) (= main_~i~0 22))} is VALID [2018-11-14 17:37:07,220 INFO L273 TraceCheckUtils]: 70: Hoare triple {8388#(and (<= 21 main_~n~0) (= main_~sum~0 231) (= main_~i~0 22))} assume !(~i~0 <= ~n~0); {8395#(and (<= 21 main_~n~0) (= main_~sum~0 231) (< main_~n~0 22))} is VALID [2018-11-14 17:37:07,222 INFO L256 TraceCheckUtils]: 71: Hoare triple {8395#(and (<= 21 main_~n~0) (= main_~sum~0 231) (< main_~n~0 22))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (~n~0 + 1) then 1 else 0)); {8399#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:37:07,222 INFO L273 TraceCheckUtils]: 72: Hoare triple {8399#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {8403#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:37:07,223 INFO L273 TraceCheckUtils]: 73: Hoare triple {8403#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {8138#false} is VALID [2018-11-14 17:37:07,223 INFO L273 TraceCheckUtils]: 74: Hoare triple {8138#false} assume !false; {8138#false} is VALID [2018-11-14 17:37:07,237 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:07,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:37:07,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-11-14 17:37:07,259 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 75 [2018-11-14 17:37:07,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:37:07,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-14 17:37:07,340 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-14 17:37:07,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-14 17:37:07,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-14 17:37:07,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-11-14 17:37:07,341 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 48 states. [2018-11-14 17:37:13,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:13,036 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-11-14 17:37:13,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-14 17:37:13,037 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 75 [2018-11-14 17:37:13,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:37:13,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 17:37:13,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 84 transitions. [2018-11-14 17:37:13,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 17:37:13,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 84 transitions. [2018-11-14 17:37:13,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 84 transitions. [2018-11-14 17:37:13,129 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:13,131 INFO L225 Difference]: With dead ends: 84 [2018-11-14 17:37:13,131 INFO L226 Difference]: Without dead ends: 79 [2018-11-14 17:37:13,132 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=101, Invalid=2349, Unknown=0, NotChecked=0, Total=2450 [2018-11-14 17:37:13,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-14 17:37:13,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-11-14 17:37:13,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:37:13,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 79 states. [2018-11-14 17:37:13,197 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2018-11-14 17:37:13,197 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2018-11-14 17:37:13,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:13,199 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-11-14 17:37:13,199 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-11-14 17:37:13,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:13,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:13,200 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2018-11-14 17:37:13,200 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2018-11-14 17:37:13,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:13,202 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-11-14 17:37:13,202 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-11-14 17:37:13,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:13,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:13,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:37:13,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:37:13,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-14 17:37:13,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-11-14 17:37:13,204 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 75 [2018-11-14 17:37:13,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:37:13,204 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-11-14 17:37:13,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-14 17:37:13,204 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-11-14 17:37:13,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-14 17:37:13,205 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:37:13,205 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:37:13,206 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:37:13,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:37:13,206 INFO L82 PathProgramCache]: Analyzing trace with hash -318857097, now seen corresponding path program 22 times [2018-11-14 17:37:13,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:37:13,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:37:13,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:13,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:37:13,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:13,215 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:37:13,215 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:37:13,215 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-14 17:37:13,231 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:37:13,266 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:37:13,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:37:13,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:13,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:37:14,866 INFO L256 TraceCheckUtils]: 0: Hoare triple {8794#true} call ULTIMATE.init(); {8794#true} is VALID [2018-11-14 17:37:14,866 INFO L273 TraceCheckUtils]: 1: Hoare triple {8794#true} assume true; {8794#true} is VALID [2018-11-14 17:37:14,866 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {8794#true} {8794#true} #38#return; {8794#true} is VALID [2018-11-14 17:37:14,867 INFO L256 TraceCheckUtils]: 3: Hoare triple {8794#true} call #t~ret3 := main(); {8794#true} is VALID [2018-11-14 17:37:14,867 INFO L273 TraceCheckUtils]: 4: Hoare triple {8794#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {8794#true} is VALID [2018-11-14 17:37:14,868 INFO L273 TraceCheckUtils]: 5: Hoare triple {8794#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {8814#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-14 17:37:14,868 INFO L273 TraceCheckUtils]: 6: Hoare triple {8814#(and (= main_~sum~0 0) (= main_~i~0 1))} assume true; {8814#(and (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2018-11-14 17:37:14,869 INFO L273 TraceCheckUtils]: 7: Hoare triple {8814#(and (= main_~sum~0 0) (= main_~i~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8821#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} is VALID [2018-11-14 17:37:14,870 INFO L273 TraceCheckUtils]: 8: Hoare triple {8821#(and (= main_~sum~0 main_~i~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8825#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2018-11-14 17:37:14,870 INFO L273 TraceCheckUtils]: 9: Hoare triple {8825#(and (= main_~i~0 2) (= main_~sum~0 1))} assume true; {8825#(and (= main_~i~0 2) (= main_~sum~0 1))} is VALID [2018-11-14 17:37:14,871 INFO L273 TraceCheckUtils]: 10: Hoare triple {8825#(and (= main_~i~0 2) (= main_~sum~0 1))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8832#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} is VALID [2018-11-14 17:37:14,872 INFO L273 TraceCheckUtils]: 11: Hoare triple {8832#(and (= main_~i~0 2) (= main_~sum~0 (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8836#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-14 17:37:14,873 INFO L273 TraceCheckUtils]: 12: Hoare triple {8836#(and (= main_~i~0 3) (= main_~sum~0 3))} assume true; {8836#(and (= main_~i~0 3) (= main_~sum~0 3))} is VALID [2018-11-14 17:37:14,874 INFO L273 TraceCheckUtils]: 13: Hoare triple {8836#(and (= main_~i~0 3) (= main_~sum~0 3))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8843#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} is VALID [2018-11-14 17:37:14,875 INFO L273 TraceCheckUtils]: 14: Hoare triple {8843#(and (= main_~i~0 3) (= main_~sum~0 (+ main_~i~0 3)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8847#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-14 17:37:14,875 INFO L273 TraceCheckUtils]: 15: Hoare triple {8847#(and (= main_~sum~0 6) (= main_~i~0 4))} assume true; {8847#(and (= main_~sum~0 6) (= main_~i~0 4))} is VALID [2018-11-14 17:37:14,876 INFO L273 TraceCheckUtils]: 16: Hoare triple {8847#(and (= main_~sum~0 6) (= main_~i~0 4))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8854#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} is VALID [2018-11-14 17:37:14,877 INFO L273 TraceCheckUtils]: 17: Hoare triple {8854#(and (= main_~sum~0 (+ main_~i~0 6)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8858#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-14 17:37:14,878 INFO L273 TraceCheckUtils]: 18: Hoare triple {8858#(and (= main_~sum~0 10) (= main_~i~0 5))} assume true; {8858#(and (= main_~sum~0 10) (= main_~i~0 5))} is VALID [2018-11-14 17:37:14,878 INFO L273 TraceCheckUtils]: 19: Hoare triple {8858#(and (= main_~sum~0 10) (= main_~i~0 5))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8865#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} is VALID [2018-11-14 17:37:14,879 INFO L273 TraceCheckUtils]: 20: Hoare triple {8865#(and (= main_~sum~0 (+ main_~i~0 10)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8869#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-14 17:37:14,880 INFO L273 TraceCheckUtils]: 21: Hoare triple {8869#(and (= main_~sum~0 15) (= main_~i~0 6))} assume true; {8869#(and (= main_~sum~0 15) (= main_~i~0 6))} is VALID [2018-11-14 17:37:14,881 INFO L273 TraceCheckUtils]: 22: Hoare triple {8869#(and (= main_~sum~0 15) (= main_~i~0 6))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8876#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} is VALID [2018-11-14 17:37:14,881 INFO L273 TraceCheckUtils]: 23: Hoare triple {8876#(and (= main_~i~0 6) (= main_~sum~0 (+ main_~i~0 15)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8880#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-14 17:37:14,882 INFO L273 TraceCheckUtils]: 24: Hoare triple {8880#(and (= main_~sum~0 21) (= main_~i~0 7))} assume true; {8880#(and (= main_~sum~0 21) (= main_~i~0 7))} is VALID [2018-11-14 17:37:14,883 INFO L273 TraceCheckUtils]: 25: Hoare triple {8880#(and (= main_~sum~0 21) (= main_~i~0 7))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8887#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} is VALID [2018-11-14 17:37:14,884 INFO L273 TraceCheckUtils]: 26: Hoare triple {8887#(and (= (+ main_~i~0 21) main_~sum~0) (= main_~i~0 7))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8891#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-14 17:37:14,884 INFO L273 TraceCheckUtils]: 27: Hoare triple {8891#(and (= main_~sum~0 28) (= main_~i~0 8))} assume true; {8891#(and (= main_~sum~0 28) (= main_~i~0 8))} is VALID [2018-11-14 17:37:14,885 INFO L273 TraceCheckUtils]: 28: Hoare triple {8891#(and (= main_~sum~0 28) (= main_~i~0 8))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8898#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} is VALID [2018-11-14 17:37:14,886 INFO L273 TraceCheckUtils]: 29: Hoare triple {8898#(and (= main_~i~0 8) (= main_~sum~0 (+ main_~i~0 28)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8902#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-14 17:37:14,887 INFO L273 TraceCheckUtils]: 30: Hoare triple {8902#(and (= main_~i~0 9) (= main_~sum~0 36))} assume true; {8902#(and (= main_~i~0 9) (= main_~sum~0 36))} is VALID [2018-11-14 17:37:14,888 INFO L273 TraceCheckUtils]: 31: Hoare triple {8902#(and (= main_~i~0 9) (= main_~sum~0 36))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8909#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} is VALID [2018-11-14 17:37:14,888 INFO L273 TraceCheckUtils]: 32: Hoare triple {8909#(and (= main_~i~0 9) (= (+ main_~i~0 36) main_~sum~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8913#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-14 17:37:14,889 INFO L273 TraceCheckUtils]: 33: Hoare triple {8913#(and (= main_~sum~0 45) (= main_~i~0 10))} assume true; {8913#(and (= main_~sum~0 45) (= main_~i~0 10))} is VALID [2018-11-14 17:37:14,890 INFO L273 TraceCheckUtils]: 34: Hoare triple {8913#(and (= main_~sum~0 45) (= main_~i~0 10))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8920#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} is VALID [2018-11-14 17:37:14,891 INFO L273 TraceCheckUtils]: 35: Hoare triple {8920#(and (= main_~sum~0 (+ main_~i~0 45)) (= main_~i~0 10))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8924#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-14 17:37:14,891 INFO L273 TraceCheckUtils]: 36: Hoare triple {8924#(and (= main_~sum~0 55) (= main_~i~0 11))} assume true; {8924#(and (= main_~sum~0 55) (= main_~i~0 11))} is VALID [2018-11-14 17:37:14,892 INFO L273 TraceCheckUtils]: 37: Hoare triple {8924#(and (= main_~sum~0 55) (= main_~i~0 11))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8931#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} is VALID [2018-11-14 17:37:14,893 INFO L273 TraceCheckUtils]: 38: Hoare triple {8931#(and (= main_~sum~0 (+ main_~i~0 55)) (= main_~i~0 11))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8935#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-14 17:37:14,894 INFO L273 TraceCheckUtils]: 39: Hoare triple {8935#(and (= main_~i~0 12) (= main_~sum~0 66))} assume true; {8935#(and (= main_~i~0 12) (= main_~sum~0 66))} is VALID [2018-11-14 17:37:14,894 INFO L273 TraceCheckUtils]: 40: Hoare triple {8935#(and (= main_~i~0 12) (= main_~sum~0 66))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8942#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} is VALID [2018-11-14 17:37:14,895 INFO L273 TraceCheckUtils]: 41: Hoare triple {8942#(and (= main_~sum~0 (+ main_~i~0 66)) (= main_~i~0 12))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8946#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-14 17:37:14,896 INFO L273 TraceCheckUtils]: 42: Hoare triple {8946#(and (= main_~i~0 13) (= main_~sum~0 78))} assume true; {8946#(and (= main_~i~0 13) (= main_~sum~0 78))} is VALID [2018-11-14 17:37:14,897 INFO L273 TraceCheckUtils]: 43: Hoare triple {8946#(and (= main_~i~0 13) (= main_~sum~0 78))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8953#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} is VALID [2018-11-14 17:37:14,897 INFO L273 TraceCheckUtils]: 44: Hoare triple {8953#(and (= (+ main_~i~0 78) main_~sum~0) (= main_~i~0 13))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8957#(and (= main_~i~0 14) (= main_~sum~0 91))} is VALID [2018-11-14 17:37:14,898 INFO L273 TraceCheckUtils]: 45: Hoare triple {8957#(and (= main_~i~0 14) (= main_~sum~0 91))} assume true; {8957#(and (= main_~i~0 14) (= main_~sum~0 91))} is VALID [2018-11-14 17:37:14,899 INFO L273 TraceCheckUtils]: 46: Hoare triple {8957#(and (= main_~i~0 14) (= main_~sum~0 91))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8964#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} is VALID [2018-11-14 17:37:14,900 INFO L273 TraceCheckUtils]: 47: Hoare triple {8964#(and (= main_~i~0 14) (= main_~sum~0 (+ main_~i~0 91)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8968#(and (= main_~sum~0 105) (= main_~i~0 15))} is VALID [2018-11-14 17:37:14,900 INFO L273 TraceCheckUtils]: 48: Hoare triple {8968#(and (= main_~sum~0 105) (= main_~i~0 15))} assume true; {8968#(and (= main_~sum~0 105) (= main_~i~0 15))} is VALID [2018-11-14 17:37:14,901 INFO L273 TraceCheckUtils]: 49: Hoare triple {8968#(and (= main_~sum~0 105) (= main_~i~0 15))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8975#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} is VALID [2018-11-14 17:37:14,902 INFO L273 TraceCheckUtils]: 50: Hoare triple {8975#(and (= main_~sum~0 (+ main_~i~0 105)) (= main_~i~0 15))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8979#(and (= main_~sum~0 120) (= main_~i~0 16))} is VALID [2018-11-14 17:37:14,903 INFO L273 TraceCheckUtils]: 51: Hoare triple {8979#(and (= main_~sum~0 120) (= main_~i~0 16))} assume true; {8979#(and (= main_~sum~0 120) (= main_~i~0 16))} is VALID [2018-11-14 17:37:14,903 INFO L273 TraceCheckUtils]: 52: Hoare triple {8979#(and (= main_~sum~0 120) (= main_~i~0 16))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8986#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} is VALID [2018-11-14 17:37:14,904 INFO L273 TraceCheckUtils]: 53: Hoare triple {8986#(and (= (+ main_~i~0 120) main_~sum~0) (= main_~i~0 16))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8990#(and (= main_~i~0 17) (= main_~sum~0 136))} is VALID [2018-11-14 17:37:14,905 INFO L273 TraceCheckUtils]: 54: Hoare triple {8990#(and (= main_~i~0 17) (= main_~sum~0 136))} assume true; {8990#(and (= main_~i~0 17) (= main_~sum~0 136))} is VALID [2018-11-14 17:37:14,906 INFO L273 TraceCheckUtils]: 55: Hoare triple {8990#(and (= main_~i~0 17) (= main_~sum~0 136))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {8997#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} is VALID [2018-11-14 17:37:14,907 INFO L273 TraceCheckUtils]: 56: Hoare triple {8997#(and (= main_~i~0 17) (= (+ main_~i~0 136) main_~sum~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9001#(and (= main_~i~0 18) (= main_~sum~0 153))} is VALID [2018-11-14 17:37:14,908 INFO L273 TraceCheckUtils]: 57: Hoare triple {9001#(and (= main_~i~0 18) (= main_~sum~0 153))} assume true; {9001#(and (= main_~i~0 18) (= main_~sum~0 153))} is VALID [2018-11-14 17:37:14,909 INFO L273 TraceCheckUtils]: 58: Hoare triple {9001#(and (= main_~i~0 18) (= main_~sum~0 153))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9008#(and (= main_~i~0 18) (= main_~sum~0 (+ main_~i~0 153)))} is VALID [2018-11-14 17:37:14,909 INFO L273 TraceCheckUtils]: 59: Hoare triple {9008#(and (= main_~i~0 18) (= main_~sum~0 (+ main_~i~0 153)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9012#(and (= main_~i~0 19) (= main_~sum~0 171))} is VALID [2018-11-14 17:37:14,910 INFO L273 TraceCheckUtils]: 60: Hoare triple {9012#(and (= main_~i~0 19) (= main_~sum~0 171))} assume true; {9012#(and (= main_~i~0 19) (= main_~sum~0 171))} is VALID [2018-11-14 17:37:14,911 INFO L273 TraceCheckUtils]: 61: Hoare triple {9012#(and (= main_~i~0 19) (= main_~sum~0 171))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9019#(and (= (+ main_~i~0 171) main_~sum~0) (= main_~i~0 19))} is VALID [2018-11-14 17:37:14,912 INFO L273 TraceCheckUtils]: 62: Hoare triple {9019#(and (= (+ main_~i~0 171) main_~sum~0) (= main_~i~0 19))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9023#(and (= main_~i~0 20) (= main_~sum~0 190))} is VALID [2018-11-14 17:37:14,912 INFO L273 TraceCheckUtils]: 63: Hoare triple {9023#(and (= main_~i~0 20) (= main_~sum~0 190))} assume true; {9023#(and (= main_~i~0 20) (= main_~sum~0 190))} is VALID [2018-11-14 17:37:14,913 INFO L273 TraceCheckUtils]: 64: Hoare triple {9023#(and (= main_~i~0 20) (= main_~sum~0 190))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9030#(and (= main_~i~0 20) (= main_~sum~0 (+ main_~i~0 190)))} is VALID [2018-11-14 17:37:14,914 INFO L273 TraceCheckUtils]: 65: Hoare triple {9030#(and (= main_~i~0 20) (= main_~sum~0 (+ main_~i~0 190)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9034#(and (= main_~i~0 21) (= main_~sum~0 210))} is VALID [2018-11-14 17:37:14,914 INFO L273 TraceCheckUtils]: 66: Hoare triple {9034#(and (= main_~i~0 21) (= main_~sum~0 210))} assume true; {9034#(and (= main_~i~0 21) (= main_~sum~0 210))} is VALID [2018-11-14 17:37:14,915 INFO L273 TraceCheckUtils]: 67: Hoare triple {9034#(and (= main_~i~0 21) (= main_~sum~0 210))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9041#(and (= main_~sum~0 (+ main_~i~0 210)) (= main_~i~0 21))} is VALID [2018-11-14 17:37:14,916 INFO L273 TraceCheckUtils]: 68: Hoare triple {9041#(and (= main_~sum~0 (+ main_~i~0 210)) (= main_~i~0 21))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9045#(and (= main_~sum~0 231) (= main_~i~0 22))} is VALID [2018-11-14 17:37:14,917 INFO L273 TraceCheckUtils]: 69: Hoare triple {9045#(and (= main_~sum~0 231) (= main_~i~0 22))} assume true; {9045#(and (= main_~sum~0 231) (= main_~i~0 22))} is VALID [2018-11-14 17:37:14,918 INFO L273 TraceCheckUtils]: 70: Hoare triple {9045#(and (= main_~sum~0 231) (= main_~i~0 22))} assume !!(~i~0 <= ~n~0);~sum~0 := ~sum~0 + ~i~0; {9052#(and (= (+ main_~i~0 231) main_~sum~0) (<= main_~i~0 main_~n~0) (= main_~i~0 22))} is VALID [2018-11-14 17:37:14,919 INFO L273 TraceCheckUtils]: 71: Hoare triple {9052#(and (= (+ main_~i~0 231) main_~sum~0) (<= main_~i~0 main_~n~0) (= main_~i~0 22))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9056#(and (<= main_~i~0 23) (<= 22 main_~n~0) (= main_~sum~0 253))} is VALID [2018-11-14 17:37:14,919 INFO L273 TraceCheckUtils]: 72: Hoare triple {9056#(and (<= main_~i~0 23) (<= 22 main_~n~0) (= main_~sum~0 253))} assume true; {9056#(and (<= main_~i~0 23) (<= 22 main_~n~0) (= main_~sum~0 253))} is VALID [2018-11-14 17:37:14,920 INFO L273 TraceCheckUtils]: 73: Hoare triple {9056#(and (<= main_~i~0 23) (<= 22 main_~n~0) (= main_~sum~0 253))} assume !(~i~0 <= ~n~0); {9063#(and (<= main_~n~0 22) (<= 22 main_~n~0) (= main_~sum~0 253))} is VALID [2018-11-14 17:37:14,921 INFO L256 TraceCheckUtils]: 74: Hoare triple {9063#(and (<= main_~n~0 22) (<= 22 main_~n~0) (= main_~sum~0 253))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (~n~0 + 1) then 1 else 0)); {9067#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:37:14,922 INFO L273 TraceCheckUtils]: 75: Hoare triple {9067#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {9071#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:37:14,923 INFO L273 TraceCheckUtils]: 76: Hoare triple {9071#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {8795#false} is VALID [2018-11-14 17:37:14,923 INFO L273 TraceCheckUtils]: 77: Hoare triple {8795#false} assume !false; {8795#false} is VALID [2018-11-14 17:37:14,934 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:14,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:37:14,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-11-14 17:37:14,954 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 78 [2018-11-14 17:37:14,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:37:14,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states. [2018-11-14 17:37:15,043 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:15,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-14 17:37:15,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-14 17:37:15,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=2352, Unknown=0, NotChecked=0, Total=2450 [2018-11-14 17:37:15,045 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 50 states.