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-Const.epf -i ../../../trunk/examples/svcomp/loop-new/gauss_sum_true-unreach-call.i.p+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 19:23:05,091 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 19:23:05,093 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 19:23:05,109 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 19:23:05,109 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 19:23:05,110 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 19:23:05,112 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 19:23:05,115 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 19:23:05,122 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 19:23:05,123 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 19:23:05,124 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 19:23:05,127 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 19:23:05,128 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 19:23:05,129 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 19:23:05,130 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 19:23:05,130 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 19:23:05,131 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 19:23:05,133 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 19:23:05,135 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 19:23:05,136 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 19:23:05,137 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 19:23:05,138 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 19:23:05,141 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 19:23:05,141 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 19:23:05,141 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 19:23:05,142 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 19:23:05,143 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 19:23:05,144 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 19:23:05,145 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 19:23:05,147 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 19:23:05,148 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 19:23:05,148 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 19:23:05,151 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 19:23:05,151 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 19:23:05,152 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 19:23:05,153 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 19:23:05,153 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 19:23:05,182 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 19:23:05,182 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 19:23:05,184 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 19:23:05,184 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 19:23:05,190 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 19:23:05,190 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 19:23:05,190 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 19:23:05,190 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 19:23:05,192 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 19:23:05,192 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 19:23:05,192 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 19:23:05,193 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 19:23:05,193 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 19:23:05,193 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 19:23:05,193 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 19:23:05,193 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 19:23:05,194 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 19:23:05,194 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 19:23:05,194 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 19:23:05,194 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 19:23:05,194 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 19:23:05,195 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 19:23:05,195 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 19:23:05,195 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:23:05,195 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 19:23:05,195 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 19:23:05,196 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 19:23:05,197 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 19:23:05,197 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 19:23:05,197 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 19:23:05,198 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 19:23:05,262 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 19:23:05,281 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 19:23:05,285 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 19:23:05,286 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 19:23:05,287 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 19:23:05,287 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/gauss_sum_true-unreach-call.i.p+cfa-reducer.c [2018-11-14 19:23:05,350 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bd1440aa/2a5aa98c6c2543919f0a882f28e1967f/FLAG082bec1ff [2018-11-14 19:23:05,777 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 19:23:05,778 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum_true-unreach-call.i.p+cfa-reducer.c [2018-11-14 19:23:05,785 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bd1440aa/2a5aa98c6c2543919f0a882f28e1967f/FLAG082bec1ff [2018-11-14 19:23:05,801 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bd1440aa/2a5aa98c6c2543919f0a882f28e1967f [2018-11-14 19:23:05,812 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 19:23:05,814 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 19:23:05,815 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 19:23:05,815 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 19:23:05,819 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 19:23:05,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:23:05" (1/1) ... [2018-11-14 19:23:05,823 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6150c6a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:23:05, skipping insertion in model container [2018-11-14 19:23:05,824 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:23:05" (1/1) ... [2018-11-14 19:23:05,834 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 19:23:05,857 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 19:23:06,050 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:23:06,058 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 19:23:06,084 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:23:06,102 INFO L195 MainTranslator]: Completed translation [2018-11-14 19:23:06,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:23:06 WrapperNode [2018-11-14 19:23:06,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 19:23:06,103 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 19:23:06,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 19:23:06,104 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 19:23:06,121 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:23:06" (1/1) ... [2018-11-14 19:23:06,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:23:06" (1/1) ... [2018-11-14 19:23:06,128 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:23:06" (1/1) ... [2018-11-14 19:23:06,128 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:23:06" (1/1) ... [2018-11-14 19:23:06,134 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:23:06" (1/1) ... [2018-11-14 19:23:06,139 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:23:06" (1/1) ... [2018-11-14 19:23:06,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:23:06" (1/1) ... [2018-11-14 19:23:06,142 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 19:23:06,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 19:23:06,142 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 19:23:06,143 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 19:23:06,144 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:23:06" (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 19:23:06,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 19:23:06,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 19:23:06,279 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 19:23:06,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 19:23:06,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 19:23:06,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 19:23:06,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 19:23:06,280 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 19:23:06,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 19:23:06,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 19:23:06,716 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 19:23:06,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:23:06 BoogieIcfgContainer [2018-11-14 19:23:06,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 19:23:06,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 19:23:06,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 19:23:06,721 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 19:23:06,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:23:05" (1/3) ... [2018-11-14 19:23:06,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13b7bdfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:23:06, skipping insertion in model container [2018-11-14 19:23:06,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:23:06" (2/3) ... [2018-11-14 19:23:06,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13b7bdfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:23:06, skipping insertion in model container [2018-11-14 19:23:06,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:23:06" (3/3) ... [2018-11-14 19:23:06,725 INFO L112 eAbstractionObserver]: Analyzing ICFG gauss_sum_true-unreach-call.i.p+cfa-reducer.c [2018-11-14 19:23:06,735 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 19:23:06,744 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 19:23:06,761 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 19:23:06,795 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 19:23:06,796 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 19:23:06,796 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 19:23:06,796 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 19:23:06,796 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 19:23:06,796 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 19:23:06,796 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 19:23:06,797 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 19:23:06,797 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 19:23:06,818 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2018-11-14 19:23:06,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 19:23:06,826 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:23:06,829 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:23:06,831 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:23:06,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:23:06,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1277702393, now seen corresponding path program 1 times [2018-11-14 19:23:06,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:23:06,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:23:06,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:06,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:23:06,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:06,931 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:23:06,932 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:23:06,932 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 19:23:06,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:23:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:23:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:23:07,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:23:07,225 INFO L256 TraceCheckUtils]: 0: Hoare triple {19#true} call ULTIMATE.init(); {19#true} is VALID [2018-11-14 19:23:07,228 INFO L273 TraceCheckUtils]: 1: Hoare triple {19#true} ~__return_main~0 := 0;~__return_80~0 := 0; {19#true} is VALID [2018-11-14 19:23:07,229 INFO L273 TraceCheckUtils]: 2: Hoare triple {19#true} assume true; {19#true} is VALID [2018-11-14 19:23:07,229 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19#true} {19#true} #28#return; {19#true} is VALID [2018-11-14 19:23:07,229 INFO L256 TraceCheckUtils]: 4: Hoare triple {19#true} call #t~ret2 := main(); {19#true} is VALID [2018-11-14 19:23:07,230 INFO L273 TraceCheckUtils]: 5: Hoare triple {19#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {19#true} is VALID [2018-11-14 19:23:07,231 INFO L273 TraceCheckUtils]: 6: Hoare triple {19#true} assume !!(1 <= ~main__n~0); {42#(<= 1 main_~main__n~0)} is VALID [2018-11-14 19:23:07,232 INFO L273 TraceCheckUtils]: 7: Hoare triple {42#(<= 1 main_~main__n~0)} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {46#(and (<= main_~main__i~0 1) (<= 1 main_~main__n~0))} is VALID [2018-11-14 19:23:07,245 INFO L273 TraceCheckUtils]: 8: Hoare triple {46#(and (<= main_~main__i~0 1) (<= 1 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {20#false} is VALID [2018-11-14 19:23:07,246 INFO L273 TraceCheckUtils]: 9: Hoare triple {20#false} assume ~__VERIFIER_assert__cond~0 == 0; {20#false} is VALID [2018-11-14 19:23:07,246 INFO L273 TraceCheckUtils]: 10: Hoare triple {20#false} assume !false; {20#false} is VALID [2018-11-14 19:23:07,249 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 19:23:07,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:23:07,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 19:23:07,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-14 19:23:07,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:23:07,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 19:23:07,421 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 19:23:07,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 19:23:07,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 19:23:07,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 19:23:07,446 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 4 states. [2018-11-14 19:23:07,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:07,755 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-14 19:23:07,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 19:23:07,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-14 19:23:07,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:23:07,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 19:23:07,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2018-11-14 19:23:07,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 19:23:07,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2018-11-14 19:23:07,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2018-11-14 19:23:07,865 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 19:23:07,874 INFO L225 Difference]: With dead ends: 26 [2018-11-14 19:23:07,874 INFO L226 Difference]: Without dead ends: 13 [2018-11-14 19:23:07,877 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 19:23:07,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-14 19:23:08,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-14 19:23:08,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:23:08,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-14 19:23:08,032 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-14 19:23:08,032 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-14 19:23:08,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:08,035 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-14 19:23:08,036 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-14 19:23:08,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:08,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:08,037 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-14 19:23:08,037 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-14 19:23:08,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:08,040 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-14 19:23:08,040 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-14 19:23:08,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:08,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:08,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:23:08,042 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:23:08,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 19:23:08,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-14 19:23:08,047 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-11-14 19:23:08,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:23:08,048 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-14 19:23:08,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 19:23:08,048 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-14 19:23:08,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 19:23:08,049 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:23:08,049 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:23:08,049 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:23:08,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:23:08,050 INFO L82 PathProgramCache]: Analyzing trace with hash -954130992, now seen corresponding path program 1 times [2018-11-14 19:23:08,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:23:08,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:23:08,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:08,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:23:08,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:08,069 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:23:08,070 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:23:08,070 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 19:23:08,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:23:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:23:08,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:23:08,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:23:08,429 INFO L256 TraceCheckUtils]: 0: Hoare triple {132#true} call ULTIMATE.init(); {132#true} is VALID [2018-11-14 19:23:08,429 INFO L273 TraceCheckUtils]: 1: Hoare triple {132#true} ~__return_main~0 := 0;~__return_80~0 := 0; {132#true} is VALID [2018-11-14 19:23:08,430 INFO L273 TraceCheckUtils]: 2: Hoare triple {132#true} assume true; {132#true} is VALID [2018-11-14 19:23:08,430 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {132#true} {132#true} #28#return; {132#true} is VALID [2018-11-14 19:23:08,430 INFO L256 TraceCheckUtils]: 4: Hoare triple {132#true} call #t~ret2 := main(); {132#true} is VALID [2018-11-14 19:23:08,431 INFO L273 TraceCheckUtils]: 5: Hoare triple {132#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {132#true} is VALID [2018-11-14 19:23:08,432 INFO L273 TraceCheckUtils]: 6: Hoare triple {132#true} assume !!(1 <= ~main__n~0); {155#(<= 1 main_~main__n~0)} is VALID [2018-11-14 19:23:08,433 INFO L273 TraceCheckUtils]: 7: Hoare triple {155#(<= 1 main_~main__n~0)} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {159#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0) (<= 1 main_~main__n~0))} is VALID [2018-11-14 19:23:08,437 INFO L273 TraceCheckUtils]: 8: Hoare triple {159#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {163#(and (= main_~main__sum~0 1) (<= main_~main__i~0 2) (<= 1 main_~main__n~0))} is VALID [2018-11-14 19:23:08,438 INFO L273 TraceCheckUtils]: 9: Hoare triple {163#(and (= main_~main__sum~0 1) (<= main_~main__i~0 2) (<= 1 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {167#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:23:08,439 INFO L273 TraceCheckUtils]: 10: Hoare triple {167#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {133#false} is VALID [2018-11-14 19:23:08,439 INFO L273 TraceCheckUtils]: 11: Hoare triple {133#false} assume !false; {133#false} is VALID [2018-11-14 19:23:08,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:23:08,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:23:08,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-14 19:23:08,463 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-14 19:23:08,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:23:08,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:23:08,487 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 19:23:08,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:23:08,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:23:08,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:23:08,488 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2018-11-14 19:23:09,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:09,141 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-14 19:23:09,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 19:23:09,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-14 19:23:09,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:23:09,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:23:09,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2018-11-14 19:23:09,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:23:09,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2018-11-14 19:23:09,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 17 transitions. [2018-11-14 19:23:09,210 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:23:09,211 INFO L225 Difference]: With dead ends: 17 [2018-11-14 19:23:09,211 INFO L226 Difference]: Without dead ends: 14 [2018-11-14 19:23:09,212 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-14 19:23:09,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-14 19:23:09,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-14 19:23:09,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:23:09,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-14 19:23:09,231 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 19:23:09,232 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 19:23:09,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:09,234 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-14 19:23:09,234 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 19:23:09,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:09,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:09,235 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 19:23:09,235 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 19:23:09,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:09,237 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-14 19:23:09,237 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 19:23:09,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:09,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:09,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:23:09,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:23:09,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 19:23:09,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-14 19:23:09,240 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-11-14 19:23:09,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:23:09,240 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-14 19:23:09,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:23:09,241 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 19:23:09,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 19:23:09,241 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:23:09,241 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:23:09,242 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:23:09,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:23:09,242 INFO L82 PathProgramCache]: Analyzing trace with hash 486647847, now seen corresponding path program 2 times [2018-11-14 19:23:09,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:23:09,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:23:09,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:09,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:23:09,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:09,258 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:23:09,258 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:23:09,258 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 19:23:09,276 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 19:23:09,296 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 19:23:09,296 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:23:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:23:09,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:23:09,515 INFO L256 TraceCheckUtils]: 0: Hoare triple {248#true} call ULTIMATE.init(); {248#true} is VALID [2018-11-14 19:23:09,516 INFO L273 TraceCheckUtils]: 1: Hoare triple {248#true} ~__return_main~0 := 0;~__return_80~0 := 0; {248#true} is VALID [2018-11-14 19:23:09,516 INFO L273 TraceCheckUtils]: 2: Hoare triple {248#true} assume true; {248#true} is VALID [2018-11-14 19:23:09,516 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {248#true} {248#true} #28#return; {248#true} is VALID [2018-11-14 19:23:09,517 INFO L256 TraceCheckUtils]: 4: Hoare triple {248#true} call #t~ret2 := main(); {248#true} is VALID [2018-11-14 19:23:09,517 INFO L273 TraceCheckUtils]: 5: Hoare triple {248#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {248#true} is VALID [2018-11-14 19:23:09,517 INFO L273 TraceCheckUtils]: 6: Hoare triple {248#true} assume !!(1 <= ~main__n~0); {248#true} is VALID [2018-11-14 19:23:09,520 INFO L273 TraceCheckUtils]: 7: Hoare triple {248#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {274#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 19:23:09,521 INFO L273 TraceCheckUtils]: 8: Hoare triple {274#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {278#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 19:23:09,521 INFO L273 TraceCheckUtils]: 9: Hoare triple {278#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {282#(and (<= 2 main_~main__n~0) (<= main_~main__i~0 3) (= main_~main__sum~0 3))} is VALID [2018-11-14 19:23:09,522 INFO L273 TraceCheckUtils]: 10: Hoare triple {282#(and (<= 2 main_~main__n~0) (<= main_~main__i~0 3) (= main_~main__sum~0 3))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {286#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:23:09,524 INFO L273 TraceCheckUtils]: 11: Hoare triple {286#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {249#false} is VALID [2018-11-14 19:23:09,524 INFO L273 TraceCheckUtils]: 12: Hoare triple {249#false} assume !false; {249#false} is VALID [2018-11-14 19:23:09,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:23:09,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:23:09,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-14 19:23:09,547 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-14 19:23:09,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:23:09,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:23:09,563 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:23:09,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:23:09,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:23:09,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:23:09,565 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 6 states. [2018-11-14 19:23:09,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:09,856 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-14 19:23:09,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 19:23:09,856 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-14 19:23:09,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:23:09,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:23:09,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2018-11-14 19:23:09,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:23:09,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2018-11-14 19:23:09,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 18 transitions. [2018-11-14 19:23:09,888 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 19:23:09,889 INFO L225 Difference]: With dead ends: 18 [2018-11-14 19:23:09,889 INFO L226 Difference]: Without dead ends: 15 [2018-11-14 19:23:09,890 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-14 19:23:09,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-14 19:23:09,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-14 19:23:09,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:23:09,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-14 19:23:09,948 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-14 19:23:09,948 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-14 19:23:09,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:09,950 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-14 19:23:09,950 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-14 19:23:09,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:09,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:09,951 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-14 19:23:09,951 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-14 19:23:09,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:09,953 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-14 19:23:09,953 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-14 19:23:09,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:09,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:09,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:23:09,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:23:09,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 19:23:09,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-14 19:23:09,956 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-11-14 19:23:09,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:23:09,956 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-14 19:23:09,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:23:09,956 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-14 19:23:09,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-14 19:23:09,957 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:23:09,957 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:23:09,957 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:23:09,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:23:09,958 INFO L82 PathProgramCache]: Analyzing trace with hash -2093848400, now seen corresponding path program 3 times [2018-11-14 19:23:09,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:23:09,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:23:09,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:09,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:23:09,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:09,971 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:23:09,971 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:23:09,971 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 19:23:09,981 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 19:23:09,994 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-14 19:23:09,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:23:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:23:10,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:23:10,175 INFO L256 TraceCheckUtils]: 0: Hoare triple {373#true} call ULTIMATE.init(); {373#true} is VALID [2018-11-14 19:23:10,175 INFO L273 TraceCheckUtils]: 1: Hoare triple {373#true} ~__return_main~0 := 0;~__return_80~0 := 0; {373#true} is VALID [2018-11-14 19:23:10,176 INFO L273 TraceCheckUtils]: 2: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-14 19:23:10,176 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {373#true} {373#true} #28#return; {373#true} is VALID [2018-11-14 19:23:10,177 INFO L256 TraceCheckUtils]: 4: Hoare triple {373#true} call #t~ret2 := main(); {373#true} is VALID [2018-11-14 19:23:10,177 INFO L273 TraceCheckUtils]: 5: Hoare triple {373#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {373#true} is VALID [2018-11-14 19:23:10,177 INFO L273 TraceCheckUtils]: 6: Hoare triple {373#true} assume !!(1 <= ~main__n~0); {373#true} is VALID [2018-11-14 19:23:10,178 INFO L273 TraceCheckUtils]: 7: Hoare triple {373#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {399#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 19:23:10,179 INFO L273 TraceCheckUtils]: 8: Hoare triple {399#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {403#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 19:23:10,180 INFO L273 TraceCheckUtils]: 9: Hoare triple {403#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {407#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 19:23:10,180 INFO L273 TraceCheckUtils]: 10: Hoare triple {407#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {411#(and (= main_~main__sum~0 6) (<= 3 main_~main__n~0) (<= main_~main__i~0 4))} is VALID [2018-11-14 19:23:10,181 INFO L273 TraceCheckUtils]: 11: Hoare triple {411#(and (= main_~main__sum~0 6) (<= 3 main_~main__n~0) (<= main_~main__i~0 4))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {415#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:23:10,182 INFO L273 TraceCheckUtils]: 12: Hoare triple {415#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {374#false} is VALID [2018-11-14 19:23:10,183 INFO L273 TraceCheckUtils]: 13: Hoare triple {374#false} assume !false; {374#false} is VALID [2018-11-14 19:23:10,184 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:23:10,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:23:10,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-14 19:23:10,205 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-11-14 19:23:10,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:23:10,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 19:23:10,221 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:23:10,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 19:23:10,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 19:23:10,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-14 19:23:10,223 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 7 states. [2018-11-14 19:23:10,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:10,479 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-14 19:23:10,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 19:23:10,480 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-11-14 19:23:10,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:23:10,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 19:23:10,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2018-11-14 19:23:10,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 19:23:10,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2018-11-14 19:23:10,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 19 transitions. [2018-11-14 19:23:10,521 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:23:10,522 INFO L225 Difference]: With dead ends: 19 [2018-11-14 19:23:10,522 INFO L226 Difference]: Without dead ends: 16 [2018-11-14 19:23:10,523 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:23:10,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-14 19:23:10,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-14 19:23:10,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:23:10,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-14 19:23:10,578 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-14 19:23:10,579 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-14 19:23:10,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:10,581 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-14 19:23:10,581 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-14 19:23:10,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:10,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:10,582 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-14 19:23:10,582 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-14 19:23:10,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:10,584 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-14 19:23:10,584 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-14 19:23:10,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:10,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:10,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:23:10,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:23:10,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 19:23:10,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-14 19:23:10,587 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-11-14 19:23:10,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:23:10,587 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-14 19:23:10,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 19:23:10,587 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-14 19:23:10,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 19:23:10,588 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:23:10,588 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:23:10,588 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:23:10,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:23:10,589 INFO L82 PathProgramCache]: Analyzing trace with hash -484853433, now seen corresponding path program 4 times [2018-11-14 19:23:10,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:23:10,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:23:10,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:10,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:23:10,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:10,603 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:23:10,603 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:23:10,603 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 19:23:10,612 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 19:23:10,654 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 19:23:10,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:23:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:23:10,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:23:10,882 INFO L256 TraceCheckUtils]: 0: Hoare triple {508#true} call ULTIMATE.init(); {508#true} is VALID [2018-11-14 19:23:10,883 INFO L273 TraceCheckUtils]: 1: Hoare triple {508#true} ~__return_main~0 := 0;~__return_80~0 := 0; {508#true} is VALID [2018-11-14 19:23:10,884 INFO L273 TraceCheckUtils]: 2: Hoare triple {508#true} assume true; {508#true} is VALID [2018-11-14 19:23:10,884 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {508#true} {508#true} #28#return; {508#true} is VALID [2018-11-14 19:23:10,885 INFO L256 TraceCheckUtils]: 4: Hoare triple {508#true} call #t~ret2 := main(); {508#true} is VALID [2018-11-14 19:23:10,885 INFO L273 TraceCheckUtils]: 5: Hoare triple {508#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {508#true} is VALID [2018-11-14 19:23:10,885 INFO L273 TraceCheckUtils]: 6: Hoare triple {508#true} assume !!(1 <= ~main__n~0); {508#true} is VALID [2018-11-14 19:23:10,888 INFO L273 TraceCheckUtils]: 7: Hoare triple {508#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {534#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 19:23:10,888 INFO L273 TraceCheckUtils]: 8: Hoare triple {534#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {538#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-14 19:23:10,889 INFO L273 TraceCheckUtils]: 9: Hoare triple {538#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {542#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 19:23:10,890 INFO L273 TraceCheckUtils]: 10: Hoare triple {542#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {546#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 19:23:10,891 INFO L273 TraceCheckUtils]: 11: Hoare triple {546#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {550#(and (<= 4 main_~main__n~0) (= main_~main__sum~0 10) (<= main_~main__i~0 5))} is VALID [2018-11-14 19:23:10,898 INFO L273 TraceCheckUtils]: 12: Hoare triple {550#(and (<= 4 main_~main__n~0) (= main_~main__sum~0 10) (<= main_~main__i~0 5))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {554#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:23:10,899 INFO L273 TraceCheckUtils]: 13: Hoare triple {554#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {509#false} is VALID [2018-11-14 19:23:10,899 INFO L273 TraceCheckUtils]: 14: Hoare triple {509#false} assume !false; {509#false} is VALID [2018-11-14 19:23:10,900 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:23:10,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:23:10,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-14 19:23:10,921 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-11-14 19:23:10,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:23:10,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 19:23:10,947 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 19:23:10,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 19:23:10,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 19:23:10,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:23:10,948 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 8 states. [2018-11-14 19:23:11,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:11,192 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-14 19:23:11,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 19:23:11,193 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-11-14 19:23:11,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:23:11,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:23:11,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2018-11-14 19:23:11,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:23:11,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2018-11-14 19:23:11,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 20 transitions. [2018-11-14 19:23:11,281 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:23:11,283 INFO L225 Difference]: With dead ends: 20 [2018-11-14 19:23:11,283 INFO L226 Difference]: Without dead ends: 17 [2018-11-14 19:23:11,284 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-14 19:23:11,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-14 19:23:11,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-14 19:23:11,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:23:11,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-14 19:23:11,308 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-14 19:23:11,308 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-14 19:23:11,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:11,310 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-14 19:23:11,310 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-14 19:23:11,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:11,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:11,311 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-14 19:23:11,311 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-14 19:23:11,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:11,312 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-14 19:23:11,312 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-14 19:23:11,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:11,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:11,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:23:11,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:23:11,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 19:23:11,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-14 19:23:11,315 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-11-14 19:23:11,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:23:11,315 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-14 19:23:11,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 19:23:11,315 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-14 19:23:11,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 19:23:11,316 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:23:11,316 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:23:11,316 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:23:11,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:23:11,317 INFO L82 PathProgramCache]: Analyzing trace with hash -2145617008, now seen corresponding path program 5 times [2018-11-14 19:23:11,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:23:11,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:23:11,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:11,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:23:11,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:11,330 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:23:11,330 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:23:11,330 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 19:23:11,347 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 19:23:11,360 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-14 19:23:11,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:23:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:23:11,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:23:11,560 INFO L256 TraceCheckUtils]: 0: Hoare triple {653#true} call ULTIMATE.init(); {653#true} is VALID [2018-11-14 19:23:11,560 INFO L273 TraceCheckUtils]: 1: Hoare triple {653#true} ~__return_main~0 := 0;~__return_80~0 := 0; {653#true} is VALID [2018-11-14 19:23:11,561 INFO L273 TraceCheckUtils]: 2: Hoare triple {653#true} assume true; {653#true} is VALID [2018-11-14 19:23:11,561 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {653#true} {653#true} #28#return; {653#true} is VALID [2018-11-14 19:23:11,561 INFO L256 TraceCheckUtils]: 4: Hoare triple {653#true} call #t~ret2 := main(); {653#true} is VALID [2018-11-14 19:23:11,562 INFO L273 TraceCheckUtils]: 5: Hoare triple {653#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {653#true} is VALID [2018-11-14 19:23:11,562 INFO L273 TraceCheckUtils]: 6: Hoare triple {653#true} assume !!(1 <= ~main__n~0); {653#true} is VALID [2018-11-14 19:23:11,563 INFO L273 TraceCheckUtils]: 7: Hoare triple {653#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {679#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 19:23:11,564 INFO L273 TraceCheckUtils]: 8: Hoare triple {679#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {683#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 19:23:11,564 INFO L273 TraceCheckUtils]: 9: Hoare triple {683#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {687#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 19:23:11,565 INFO L273 TraceCheckUtils]: 10: Hoare triple {687#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {691#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 19:23:11,566 INFO L273 TraceCheckUtils]: 11: Hoare triple {691#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {695#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 19:23:11,567 INFO L273 TraceCheckUtils]: 12: Hoare triple {695#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {699#(and (<= main_~main__i~0 6) (= main_~main__sum~0 15) (<= 5 main_~main__n~0))} is VALID [2018-11-14 19:23:11,569 INFO L273 TraceCheckUtils]: 13: Hoare triple {699#(and (<= main_~main__i~0 6) (= main_~main__sum~0 15) (<= 5 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {703#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:23:11,570 INFO L273 TraceCheckUtils]: 14: Hoare triple {703#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {654#false} is VALID [2018-11-14 19:23:11,570 INFO L273 TraceCheckUtils]: 15: Hoare triple {654#false} assume !false; {654#false} is VALID [2018-11-14 19:23:11,571 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 19:23:11,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:23:11,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-11-14 19:23:11,592 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-11-14 19:23:11,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:23:11,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 19:23:11,610 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:23:11,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 19:23:11,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 19:23:11,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-14 19:23:11,611 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2018-11-14 19:23:12,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:12,037 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-14 19:23:12,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 19:23:12,038 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-11-14 19:23:12,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:23:12,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 19:23:12,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2018-11-14 19:23:12,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 19:23:12,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2018-11-14 19:23:12,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 21 transitions. [2018-11-14 19:23:12,078 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 19:23:12,079 INFO L225 Difference]: With dead ends: 21 [2018-11-14 19:23:12,080 INFO L226 Difference]: Without dead ends: 18 [2018-11-14 19:23:12,081 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-14 19:23:12,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-14 19:23:12,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-14 19:23:12,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:23:12,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-14 19:23:12,119 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-14 19:23:12,119 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-14 19:23:12,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:12,121 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-14 19:23:12,121 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-14 19:23:12,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:12,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:12,122 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-14 19:23:12,122 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-14 19:23:12,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:12,123 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-14 19:23:12,123 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-14 19:23:12,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:12,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:12,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:23:12,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:23:12,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 19:23:12,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-14 19:23:12,126 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-11-14 19:23:12,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:23:12,126 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-14 19:23:12,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 19:23:12,126 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-14 19:23:12,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 19:23:12,127 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:23:12,127 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:23:12,128 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:23:12,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:23:12,128 INFO L82 PathProgramCache]: Analyzing trace with hash -2089680281, now seen corresponding path program 6 times [2018-11-14 19:23:12,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:23:12,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:23:12,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:12,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:23:12,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:12,142 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:23:12,142 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:23:12,142 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 19:23:12,166 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 19:23:12,182 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-14 19:23:12,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:23:12,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:23:12,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:23:12,420 INFO L256 TraceCheckUtils]: 0: Hoare triple {808#true} call ULTIMATE.init(); {808#true} is VALID [2018-11-14 19:23:12,420 INFO L273 TraceCheckUtils]: 1: Hoare triple {808#true} ~__return_main~0 := 0;~__return_80~0 := 0; {808#true} is VALID [2018-11-14 19:23:12,421 INFO L273 TraceCheckUtils]: 2: Hoare triple {808#true} assume true; {808#true} is VALID [2018-11-14 19:23:12,421 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {808#true} {808#true} #28#return; {808#true} is VALID [2018-11-14 19:23:12,421 INFO L256 TraceCheckUtils]: 4: Hoare triple {808#true} call #t~ret2 := main(); {808#true} is VALID [2018-11-14 19:23:12,422 INFO L273 TraceCheckUtils]: 5: Hoare triple {808#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {808#true} is VALID [2018-11-14 19:23:12,422 INFO L273 TraceCheckUtils]: 6: Hoare triple {808#true} assume !!(1 <= ~main__n~0); {808#true} is VALID [2018-11-14 19:23:12,422 INFO L273 TraceCheckUtils]: 7: Hoare triple {808#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {834#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 19:23:12,423 INFO L273 TraceCheckUtils]: 8: Hoare triple {834#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {838#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-14 19:23:12,424 INFO L273 TraceCheckUtils]: 9: Hoare triple {838#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {842#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 19:23:12,425 INFO L273 TraceCheckUtils]: 10: Hoare triple {842#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {846#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 19:23:12,425 INFO L273 TraceCheckUtils]: 11: Hoare triple {846#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {850#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 19:23:12,426 INFO L273 TraceCheckUtils]: 12: Hoare triple {850#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {854#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 19:23:12,427 INFO L273 TraceCheckUtils]: 13: Hoare triple {854#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {858#(and (= main_~main__sum~0 21) (<= main_~main__i~0 7) (<= 6 main_~main__n~0))} is VALID [2018-11-14 19:23:12,429 INFO L273 TraceCheckUtils]: 14: Hoare triple {858#(and (= main_~main__sum~0 21) (<= main_~main__i~0 7) (<= 6 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {862#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:23:12,430 INFO L273 TraceCheckUtils]: 15: Hoare triple {862#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {809#false} is VALID [2018-11-14 19:23:12,430 INFO L273 TraceCheckUtils]: 16: Hoare triple {809#false} assume !false; {809#false} is VALID [2018-11-14 19:23:12,432 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:23:12,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:23:12,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-11-14 19:23:12,452 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-11-14 19:23:12,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:23:12,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 19:23:12,471 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:23:12,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 19:23:12,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 19:23:12,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-14 19:23:12,473 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 10 states. [2018-11-14 19:23:12,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:12,848 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-14 19:23:12,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 19:23:12,848 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-11-14 19:23:12,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:23:12,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 19:23:12,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 22 transitions. [2018-11-14 19:23:12,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 19:23:12,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 22 transitions. [2018-11-14 19:23:12,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 22 transitions. [2018-11-14 19:23:12,873 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 19:23:12,874 INFO L225 Difference]: With dead ends: 22 [2018-11-14 19:23:12,874 INFO L226 Difference]: Without dead ends: 19 [2018-11-14 19:23:12,875 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-14 19:23:12,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-14 19:23:12,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-14 19:23:12,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:23:12,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-14 19:23:12,904 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-14 19:23:12,904 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-14 19:23:12,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:12,906 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-14 19:23:12,906 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-14 19:23:12,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:12,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:12,907 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-14 19:23:12,907 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-14 19:23:12,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:12,909 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-14 19:23:12,909 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-14 19:23:12,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:12,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:12,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:23:12,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:23:12,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 19:23:12,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-14 19:23:12,911 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-11-14 19:23:12,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:23:12,912 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-11-14 19:23:12,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 19:23:12,912 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-14 19:23:12,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 19:23:12,913 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:23:12,913 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:23:12,913 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:23:12,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:23:12,913 INFO L82 PathProgramCache]: Analyzing trace with hash -355641744, now seen corresponding path program 7 times [2018-11-14 19:23:12,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:23:12,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:23:12,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:12,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:23:12,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:12,927 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:23:12,928 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:23:12,928 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 19:23:12,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:23:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:23:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:23:12,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:23:13,302 INFO L256 TraceCheckUtils]: 0: Hoare triple {973#true} call ULTIMATE.init(); {973#true} is VALID [2018-11-14 19:23:13,302 INFO L273 TraceCheckUtils]: 1: Hoare triple {973#true} ~__return_main~0 := 0;~__return_80~0 := 0; {973#true} is VALID [2018-11-14 19:23:13,303 INFO L273 TraceCheckUtils]: 2: Hoare triple {973#true} assume true; {973#true} is VALID [2018-11-14 19:23:13,303 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {973#true} {973#true} #28#return; {973#true} is VALID [2018-11-14 19:23:13,303 INFO L256 TraceCheckUtils]: 4: Hoare triple {973#true} call #t~ret2 := main(); {973#true} is VALID [2018-11-14 19:23:13,304 INFO L273 TraceCheckUtils]: 5: Hoare triple {973#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {973#true} is VALID [2018-11-14 19:23:13,304 INFO L273 TraceCheckUtils]: 6: Hoare triple {973#true} assume !!(1 <= ~main__n~0); {973#true} is VALID [2018-11-14 19:23:13,309 INFO L273 TraceCheckUtils]: 7: Hoare triple {973#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {999#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 19:23:13,310 INFO L273 TraceCheckUtils]: 8: Hoare triple {999#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1003#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 19:23:13,310 INFO L273 TraceCheckUtils]: 9: Hoare triple {1003#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1007#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 19:23:13,311 INFO L273 TraceCheckUtils]: 10: Hoare triple {1007#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1011#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 19:23:13,312 INFO L273 TraceCheckUtils]: 11: Hoare triple {1011#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1015#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 19:23:13,313 INFO L273 TraceCheckUtils]: 12: Hoare triple {1015#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1019#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 19:23:13,314 INFO L273 TraceCheckUtils]: 13: Hoare triple {1019#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1023#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 19:23:13,315 INFO L273 TraceCheckUtils]: 14: Hoare triple {1023#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1027#(and (<= main_~main__i~0 8) (<= 7 main_~main__n~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 19:23:13,316 INFO L273 TraceCheckUtils]: 15: Hoare triple {1027#(and (<= main_~main__i~0 8) (<= 7 main_~main__n~0) (= main_~main__sum~0 28))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1031#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:23:13,317 INFO L273 TraceCheckUtils]: 16: Hoare triple {1031#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {974#false} is VALID [2018-11-14 19:23:13,318 INFO L273 TraceCheckUtils]: 17: Hoare triple {974#false} assume !false; {974#false} is VALID [2018-11-14 19:23:13,319 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:23:13,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:23:13,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-11-14 19:23:13,341 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-11-14 19:23:13,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:23:13,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 19:23:13,360 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 19:23:13,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 19:23:13,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 19:23:13,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-14 19:23:13,362 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 11 states. [2018-11-14 19:23:13,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:13,773 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-14 19:23:13,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 19:23:13,774 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-11-14 19:23:13,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:23:13,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 19:23:13,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2018-11-14 19:23:13,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 19:23:13,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2018-11-14 19:23:13,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 23 transitions. [2018-11-14 19:23:13,807 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:23:13,808 INFO L225 Difference]: With dead ends: 23 [2018-11-14 19:23:13,808 INFO L226 Difference]: Without dead ends: 20 [2018-11-14 19:23:13,809 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-11-14 19:23:13,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-14 19:23:13,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-14 19:23:13,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:23:13,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-14 19:23:13,842 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-14 19:23:13,842 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-14 19:23:13,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:13,844 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-14 19:23:13,844 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-14 19:23:13,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:13,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:13,845 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-14 19:23:13,845 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-14 19:23:13,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:13,846 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-14 19:23:13,846 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-14 19:23:13,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:13,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:13,847 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:23:13,847 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:23:13,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 19:23:13,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-14 19:23:13,849 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-11-14 19:23:13,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:23:13,849 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-14 19:23:13,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 19:23:13,849 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-14 19:23:13,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 19:23:13,850 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:23:13,850 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:23:13,850 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:23:13,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:23:13,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1859945351, now seen corresponding path program 8 times [2018-11-14 19:23:13,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:23:13,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:23:13,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:13,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:23:13,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:13,863 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:23:13,863 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:23:13,863 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 19:23:13,894 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 19:23:13,923 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 19:23:13,924 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:23:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:23:13,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:23:14,284 INFO L256 TraceCheckUtils]: 0: Hoare triple {1148#true} call ULTIMATE.init(); {1148#true} is VALID [2018-11-14 19:23:14,284 INFO L273 TraceCheckUtils]: 1: Hoare triple {1148#true} ~__return_main~0 := 0;~__return_80~0 := 0; {1148#true} is VALID [2018-11-14 19:23:14,285 INFO L273 TraceCheckUtils]: 2: Hoare triple {1148#true} assume true; {1148#true} is VALID [2018-11-14 19:23:14,285 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1148#true} {1148#true} #28#return; {1148#true} is VALID [2018-11-14 19:23:14,285 INFO L256 TraceCheckUtils]: 4: Hoare triple {1148#true} call #t~ret2 := main(); {1148#true} is VALID [2018-11-14 19:23:14,286 INFO L273 TraceCheckUtils]: 5: Hoare triple {1148#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {1148#true} is VALID [2018-11-14 19:23:14,286 INFO L273 TraceCheckUtils]: 6: Hoare triple {1148#true} assume !!(1 <= ~main__n~0); {1148#true} is VALID [2018-11-14 19:23:14,301 INFO L273 TraceCheckUtils]: 7: Hoare triple {1148#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1174#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 19:23:14,302 INFO L273 TraceCheckUtils]: 8: Hoare triple {1174#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1178#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 19:23:14,303 INFO L273 TraceCheckUtils]: 9: Hoare triple {1178#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1182#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 19:23:14,304 INFO L273 TraceCheckUtils]: 10: Hoare triple {1182#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1186#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 19:23:14,304 INFO L273 TraceCheckUtils]: 11: Hoare triple {1186#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1190#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 19:23:14,308 INFO L273 TraceCheckUtils]: 12: Hoare triple {1190#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1194#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 19:23:14,308 INFO L273 TraceCheckUtils]: 13: Hoare triple {1194#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1198#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 19:23:14,309 INFO L273 TraceCheckUtils]: 14: Hoare triple {1198#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1202#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 19:23:14,310 INFO L273 TraceCheckUtils]: 15: Hoare triple {1202#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1206#(and (<= main_~main__i~0 9) (<= 8 main_~main__n~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 19:23:14,311 INFO L273 TraceCheckUtils]: 16: Hoare triple {1206#(and (<= main_~main__i~0 9) (<= 8 main_~main__n~0) (= main_~main__sum~0 36))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1210#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:23:14,311 INFO L273 TraceCheckUtils]: 17: Hoare triple {1210#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {1149#false} is VALID [2018-11-14 19:23:14,311 INFO L273 TraceCheckUtils]: 18: Hoare triple {1149#false} assume !false; {1149#false} is VALID [2018-11-14 19:23:14,314 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:23:14,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:23:14,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-11-14 19:23:14,342 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-11-14 19:23:14,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:23:14,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 19:23:14,369 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:23:14,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 19:23:14,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 19:23:14,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-14 19:23:14,370 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 12 states. [2018-11-14 19:23:15,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:15,075 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-14 19:23:15,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 19:23:15,075 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-11-14 19:23:15,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:23:15,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 19:23:15,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2018-11-14 19:23:15,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 19:23:15,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2018-11-14 19:23:15,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 24 transitions. [2018-11-14 19:23:15,159 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 19:23:15,160 INFO L225 Difference]: With dead ends: 24 [2018-11-14 19:23:15,160 INFO L226 Difference]: Without dead ends: 21 [2018-11-14 19:23:15,160 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-11-14 19:23:15,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-14 19:23:15,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-14 19:23:15,199 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:23:15,199 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-14 19:23:15,199 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-14 19:23:15,199 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-14 19:23:15,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:15,201 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-14 19:23:15,201 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-14 19:23:15,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:15,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:15,201 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-14 19:23:15,202 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-14 19:23:15,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:15,202 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-14 19:23:15,203 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-14 19:23:15,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:15,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:15,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:23:15,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:23:15,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 19:23:15,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-14 19:23:15,205 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-11-14 19:23:15,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:23:15,205 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-14 19:23:15,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 19:23:15,205 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-14 19:23:15,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 19:23:15,206 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:23:15,206 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:23:15,206 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:23:15,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:23:15,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1823668560, now seen corresponding path program 9 times [2018-11-14 19:23:15,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:23:15,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:23:15,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:15,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:23:15,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:15,220 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:23:15,220 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:23:15,220 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 19:23:15,237 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 19:23:15,261 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-14 19:23:15,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:23:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:23:15,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:23:15,653 INFO L256 TraceCheckUtils]: 0: Hoare triple {1333#true} call ULTIMATE.init(); {1333#true} is VALID [2018-11-14 19:23:15,653 INFO L273 TraceCheckUtils]: 1: Hoare triple {1333#true} ~__return_main~0 := 0;~__return_80~0 := 0; {1333#true} is VALID [2018-11-14 19:23:15,653 INFO L273 TraceCheckUtils]: 2: Hoare triple {1333#true} assume true; {1333#true} is VALID [2018-11-14 19:23:15,653 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1333#true} {1333#true} #28#return; {1333#true} is VALID [2018-11-14 19:23:15,654 INFO L256 TraceCheckUtils]: 4: Hoare triple {1333#true} call #t~ret2 := main(); {1333#true} is VALID [2018-11-14 19:23:15,654 INFO L273 TraceCheckUtils]: 5: Hoare triple {1333#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {1333#true} is VALID [2018-11-14 19:23:15,654 INFO L273 TraceCheckUtils]: 6: Hoare triple {1333#true} assume !!(1 <= ~main__n~0); {1333#true} is VALID [2018-11-14 19:23:15,654 INFO L273 TraceCheckUtils]: 7: Hoare triple {1333#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1359#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 19:23:15,656 INFO L273 TraceCheckUtils]: 8: Hoare triple {1359#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1363#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-14 19:23:15,656 INFO L273 TraceCheckUtils]: 9: Hoare triple {1363#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1367#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 19:23:15,658 INFO L273 TraceCheckUtils]: 10: Hoare triple {1367#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1371#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 19:23:15,659 INFO L273 TraceCheckUtils]: 11: Hoare triple {1371#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1375#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 19:23:15,660 INFO L273 TraceCheckUtils]: 12: Hoare triple {1375#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1379#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 19:23:15,661 INFO L273 TraceCheckUtils]: 13: Hoare triple {1379#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1383#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 19:23:15,662 INFO L273 TraceCheckUtils]: 14: Hoare triple {1383#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1387#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 19:23:15,663 INFO L273 TraceCheckUtils]: 15: Hoare triple {1387#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1391#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 19:23:15,664 INFO L273 TraceCheckUtils]: 16: Hoare triple {1391#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1395#(and (= main_~main__sum~0 45) (<= 9 main_~main__n~0) (<= main_~main__i~0 10))} is VALID [2018-11-14 19:23:15,665 INFO L273 TraceCheckUtils]: 17: Hoare triple {1395#(and (= main_~main__sum~0 45) (<= 9 main_~main__n~0) (<= main_~main__i~0 10))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1399#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:23:15,670 INFO L273 TraceCheckUtils]: 18: Hoare triple {1399#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {1334#false} is VALID [2018-11-14 19:23:15,670 INFO L273 TraceCheckUtils]: 19: Hoare triple {1334#false} assume !false; {1334#false} is VALID [2018-11-14 19:23:15,671 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:23:15,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:23:15,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-11-14 19:23:15,693 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-11-14 19:23:15,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:23:15,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 19:23:15,736 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:23:15,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 19:23:15,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 19:23:15,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-14 19:23:15,737 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 13 states. [2018-11-14 19:23:16,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:16,332 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-14 19:23:16,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 19:23:16,333 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-11-14 19:23:16,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:23:16,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 19:23:16,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2018-11-14 19:23:16,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 19:23:16,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2018-11-14 19:23:16,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 25 transitions. [2018-11-14 19:23:16,378 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:23:16,379 INFO L225 Difference]: With dead ends: 25 [2018-11-14 19:23:16,379 INFO L226 Difference]: Without dead ends: 22 [2018-11-14 19:23:16,380 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-11-14 19:23:16,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-14 19:23:16,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-14 19:23:16,421 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:23:16,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-14 19:23:16,422 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 19:23:16,422 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 19:23:16,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:16,423 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-14 19:23:16,423 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-14 19:23:16,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:16,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:16,424 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 19:23:16,424 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 19:23:16,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:16,425 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-14 19:23:16,425 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-14 19:23:16,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:16,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:16,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:23:16,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:23:16,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 19:23:16,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-14 19:23:16,426 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-11-14 19:23:16,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:23:16,427 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-14 19:23:16,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 19:23:16,427 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-14 19:23:16,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 19:23:16,427 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:23:16,428 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:23:16,428 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:23:16,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:23:16,428 INFO L82 PathProgramCache]: Analyzing trace with hash 699088039, now seen corresponding path program 10 times [2018-11-14 19:23:16,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:23:16,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:23:16,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:16,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:23:16,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:16,441 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:23:16,441 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:23:16,441 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 19:23:16,459 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 19:23:16,556 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 19:23:16,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:23:16,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:23:16,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:23:16,809 INFO L256 TraceCheckUtils]: 0: Hoare triple {1528#true} call ULTIMATE.init(); {1528#true} is VALID [2018-11-14 19:23:16,809 INFO L273 TraceCheckUtils]: 1: Hoare triple {1528#true} ~__return_main~0 := 0;~__return_80~0 := 0; {1528#true} is VALID [2018-11-14 19:23:16,809 INFO L273 TraceCheckUtils]: 2: Hoare triple {1528#true} assume true; {1528#true} is VALID [2018-11-14 19:23:16,810 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1528#true} {1528#true} #28#return; {1528#true} is VALID [2018-11-14 19:23:16,810 INFO L256 TraceCheckUtils]: 4: Hoare triple {1528#true} call #t~ret2 := main(); {1528#true} is VALID [2018-11-14 19:23:16,811 INFO L273 TraceCheckUtils]: 5: Hoare triple {1528#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {1528#true} is VALID [2018-11-14 19:23:16,811 INFO L273 TraceCheckUtils]: 6: Hoare triple {1528#true} assume !!(1 <= ~main__n~0); {1528#true} is VALID [2018-11-14 19:23:16,812 INFO L273 TraceCheckUtils]: 7: Hoare triple {1528#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1554#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 19:23:16,812 INFO L273 TraceCheckUtils]: 8: Hoare triple {1554#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1558#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-14 19:23:16,813 INFO L273 TraceCheckUtils]: 9: Hoare triple {1558#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1562#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 19:23:16,813 INFO L273 TraceCheckUtils]: 10: Hoare triple {1562#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1566#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 19:23:16,814 INFO L273 TraceCheckUtils]: 11: Hoare triple {1566#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1570#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 19:23:16,815 INFO L273 TraceCheckUtils]: 12: Hoare triple {1570#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1574#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 19:23:16,816 INFO L273 TraceCheckUtils]: 13: Hoare triple {1574#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1578#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 19:23:16,817 INFO L273 TraceCheckUtils]: 14: Hoare triple {1578#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1582#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 19:23:16,818 INFO L273 TraceCheckUtils]: 15: Hoare triple {1582#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1586#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 19:23:16,819 INFO L273 TraceCheckUtils]: 16: Hoare triple {1586#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1590#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 19:23:16,820 INFO L273 TraceCheckUtils]: 17: Hoare triple {1590#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1594#(and (= main_~main__sum~0 55) (<= main_~main__i~0 11) (<= 10 main_~main__n~0))} is VALID [2018-11-14 19:23:16,822 INFO L273 TraceCheckUtils]: 18: Hoare triple {1594#(and (= main_~main__sum~0 55) (<= main_~main__i~0 11) (<= 10 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1598#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:23:16,822 INFO L273 TraceCheckUtils]: 19: Hoare triple {1598#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {1529#false} is VALID [2018-11-14 19:23:16,823 INFO L273 TraceCheckUtils]: 20: Hoare triple {1529#false} assume !false; {1529#false} is VALID [2018-11-14 19:23:16,824 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:23:16,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:23:16,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-11-14 19:23:16,845 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2018-11-14 19:23:16,845 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:23:16,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 19:23:16,864 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 19:23:16,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 19:23:16,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 19:23:16,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-14 19:23:16,865 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 14 states. [2018-11-14 19:23:17,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:17,444 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-14 19:23:17,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 19:23:17,444 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2018-11-14 19:23:17,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:23:17,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 19:23:17,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 26 transitions. [2018-11-14 19:23:17,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 19:23:17,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 26 transitions. [2018-11-14 19:23:17,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 26 transitions. [2018-11-14 19:23:17,503 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:23:17,504 INFO L225 Difference]: With dead ends: 26 [2018-11-14 19:23:17,504 INFO L226 Difference]: Without dead ends: 23 [2018-11-14 19:23:17,505 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-11-14 19:23:17,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-14 19:23:17,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-14 19:23:17,546 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:23:17,546 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2018-11-14 19:23:17,546 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-14 19:23:17,546 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-14 19:23:17,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:17,547 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-14 19:23:17,547 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-14 19:23:17,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:17,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:17,548 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-14 19:23:17,548 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-14 19:23:17,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:17,549 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-14 19:23:17,549 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-14 19:23:17,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:17,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:17,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:23:17,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:23:17,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 19:23:17,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-11-14 19:23:17,551 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-11-14 19:23:17,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:23:17,551 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-11-14 19:23:17,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 19:23:17,551 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-14 19:23:17,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 19:23:17,552 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:23:17,552 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:23:17,552 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:23:17,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:23:17,552 INFO L82 PathProgramCache]: Analyzing trace with hash 196830256, now seen corresponding path program 11 times [2018-11-14 19:23:17,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:23:17,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:23:17,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:17,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:23:17,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:17,565 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:23:17,565 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:23:17,565 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 19:23:17,576 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 19:23:17,598 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-14 19:23:17,598 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:23:17,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:23:17,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:23:17,904 INFO L256 TraceCheckUtils]: 0: Hoare triple {1733#true} call ULTIMATE.init(); {1733#true} is VALID [2018-11-14 19:23:17,905 INFO L273 TraceCheckUtils]: 1: Hoare triple {1733#true} ~__return_main~0 := 0;~__return_80~0 := 0; {1733#true} is VALID [2018-11-14 19:23:17,905 INFO L273 TraceCheckUtils]: 2: Hoare triple {1733#true} assume true; {1733#true} is VALID [2018-11-14 19:23:17,905 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1733#true} {1733#true} #28#return; {1733#true} is VALID [2018-11-14 19:23:17,905 INFO L256 TraceCheckUtils]: 4: Hoare triple {1733#true} call #t~ret2 := main(); {1733#true} is VALID [2018-11-14 19:23:17,906 INFO L273 TraceCheckUtils]: 5: Hoare triple {1733#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {1733#true} is VALID [2018-11-14 19:23:17,906 INFO L273 TraceCheckUtils]: 6: Hoare triple {1733#true} assume !!(1 <= ~main__n~0); {1733#true} is VALID [2018-11-14 19:23:17,907 INFO L273 TraceCheckUtils]: 7: Hoare triple {1733#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1759#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 19:23:17,907 INFO L273 TraceCheckUtils]: 8: Hoare triple {1759#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1763#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-14 19:23:17,908 INFO L273 TraceCheckUtils]: 9: Hoare triple {1763#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1767#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 19:23:17,909 INFO L273 TraceCheckUtils]: 10: Hoare triple {1767#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1771#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 19:23:17,910 INFO L273 TraceCheckUtils]: 11: Hoare triple {1771#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1775#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 19:23:17,911 INFO L273 TraceCheckUtils]: 12: Hoare triple {1775#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1779#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 19:23:17,912 INFO L273 TraceCheckUtils]: 13: Hoare triple {1779#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1783#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 19:23:17,913 INFO L273 TraceCheckUtils]: 14: Hoare triple {1783#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1787#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 19:23:17,914 INFO L273 TraceCheckUtils]: 15: Hoare triple {1787#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1791#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 19:23:17,916 INFO L273 TraceCheckUtils]: 16: Hoare triple {1791#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1795#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 19:23:17,917 INFO L273 TraceCheckUtils]: 17: Hoare triple {1795#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1799#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 19:23:17,918 INFO L273 TraceCheckUtils]: 18: Hoare triple {1799#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1803#(and (= main_~main__sum~0 66) (<= main_~main__i~0 12) (<= 11 main_~main__n~0))} is VALID [2018-11-14 19:23:17,919 INFO L273 TraceCheckUtils]: 19: Hoare triple {1803#(and (= main_~main__sum~0 66) (<= main_~main__i~0 12) (<= 11 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1807#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:23:17,920 INFO L273 TraceCheckUtils]: 20: Hoare triple {1807#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {1734#false} is VALID [2018-11-14 19:23:17,920 INFO L273 TraceCheckUtils]: 21: Hoare triple {1734#false} assume !false; {1734#false} is VALID [2018-11-14 19:23:17,921 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:23:17,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:23:17,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-11-14 19:23:17,942 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-11-14 19:23:17,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:23:17,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 19:23:17,963 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 19:23:17,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 19:23:17,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 19:23:17,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-14 19:23:17,965 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 15 states. [2018-11-14 19:23:18,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:18,812 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-14 19:23:18,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-14 19:23:18,812 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-11-14 19:23:18,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:23:18,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 19:23:18,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-11-14 19:23:18,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 19:23:18,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-11-14 19:23:18,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 27 transitions. [2018-11-14 19:23:18,860 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 19:23:18,861 INFO L225 Difference]: With dead ends: 27 [2018-11-14 19:23:18,862 INFO L226 Difference]: Without dead ends: 24 [2018-11-14 19:23:18,862 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-11-14 19:23:18,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-14 19:23:18,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-14 19:23:18,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:23:18,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-14 19:23:18,900 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 19:23:18,901 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 19:23:18,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:18,902 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-14 19:23:18,902 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-14 19:23:18,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:18,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:18,903 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 19:23:18,903 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 19:23:18,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:18,904 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-14 19:23:18,904 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-14 19:23:18,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:18,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:18,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:23:18,905 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:23:18,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 19:23:18,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-14 19:23:18,906 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-11-14 19:23:18,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:23:18,906 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-14 19:23:18,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 19:23:18,906 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-14 19:23:18,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 19:23:18,907 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:23:18,907 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:23:18,907 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:23:18,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:23:18,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1806708167, now seen corresponding path program 12 times [2018-11-14 19:23:18,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:23:18,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:23:18,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:18,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:23:18,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:18,919 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:23:18,919 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:23:18,919 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 19:23:18,946 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 19:23:18,974 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-14 19:23:18,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:23:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:23:19,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:23:21,121 INFO L256 TraceCheckUtils]: 0: Hoare triple {1948#true} call ULTIMATE.init(); {1948#true} is VALID [2018-11-14 19:23:21,122 INFO L273 TraceCheckUtils]: 1: Hoare triple {1948#true} ~__return_main~0 := 0;~__return_80~0 := 0; {1948#true} is VALID [2018-11-14 19:23:21,122 INFO L273 TraceCheckUtils]: 2: Hoare triple {1948#true} assume true; {1948#true} is VALID [2018-11-14 19:23:21,123 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1948#true} {1948#true} #28#return; {1948#true} is VALID [2018-11-14 19:23:21,123 INFO L256 TraceCheckUtils]: 4: Hoare triple {1948#true} call #t~ret2 := main(); {1948#true} is VALID [2018-11-14 19:23:21,123 INFO L273 TraceCheckUtils]: 5: Hoare triple {1948#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {1948#true} is VALID [2018-11-14 19:23:21,124 INFO L273 TraceCheckUtils]: 6: Hoare triple {1948#true} assume !!(1 <= ~main__n~0); {1948#true} is VALID [2018-11-14 19:23:21,131 INFO L273 TraceCheckUtils]: 7: Hoare triple {1948#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1974#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 19:23:21,132 INFO L273 TraceCheckUtils]: 8: Hoare triple {1974#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1978#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-14 19:23:21,132 INFO L273 TraceCheckUtils]: 9: Hoare triple {1978#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1982#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 19:23:21,133 INFO L273 TraceCheckUtils]: 10: Hoare triple {1982#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1986#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 19:23:21,134 INFO L273 TraceCheckUtils]: 11: Hoare triple {1986#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1990#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 19:23:21,134 INFO L273 TraceCheckUtils]: 12: Hoare triple {1990#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1994#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 19:23:21,135 INFO L273 TraceCheckUtils]: 13: Hoare triple {1994#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1998#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 19:23:21,135 INFO L273 TraceCheckUtils]: 14: Hoare triple {1998#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2002#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 19:23:21,136 INFO L273 TraceCheckUtils]: 15: Hoare triple {2002#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2006#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 19:23:21,137 INFO L273 TraceCheckUtils]: 16: Hoare triple {2006#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2010#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 19:23:21,138 INFO L273 TraceCheckUtils]: 17: Hoare triple {2010#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2014#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 19:23:21,139 INFO L273 TraceCheckUtils]: 18: Hoare triple {2014#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2018#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 19:23:21,140 INFO L273 TraceCheckUtils]: 19: Hoare triple {2018#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2022#(and (= main_~main__sum~0 78) (<= main_~main__i~0 13) (<= 12 main_~main__n~0))} is VALID [2018-11-14 19:23:21,141 INFO L273 TraceCheckUtils]: 20: Hoare triple {2022#(and (= main_~main__sum~0 78) (<= main_~main__i~0 13) (<= 12 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2026#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:23:21,142 INFO L273 TraceCheckUtils]: 21: Hoare triple {2026#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {1949#false} is VALID [2018-11-14 19:23:21,142 INFO L273 TraceCheckUtils]: 22: Hoare triple {1949#false} assume !false; {1949#false} is VALID [2018-11-14 19:23:21,144 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:23:21,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:23:21,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-11-14 19:23:21,166 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-11-14 19:23:21,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:23:21,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 19:23:21,190 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:23:21,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 19:23:21,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 19:23:21,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-11-14 19:23:21,191 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 16 states. [2018-11-14 19:23:22,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:22,035 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-14 19:23:22,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 19:23:22,036 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-11-14 19:23:22,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:23:22,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 19:23:22,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 28 transitions. [2018-11-14 19:23:22,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 19:23:22,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 28 transitions. [2018-11-14 19:23:22,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 28 transitions. [2018-11-14 19:23:22,072 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:23:22,073 INFO L225 Difference]: With dead ends: 28 [2018-11-14 19:23:22,073 INFO L226 Difference]: Without dead ends: 25 [2018-11-14 19:23:22,074 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-11-14 19:23:22,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-14 19:23:22,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-14 19:23:22,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:23:22,283 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-14 19:23:22,283 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-14 19:23:22,283 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-14 19:23:22,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:22,284 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-14 19:23:22,285 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-14 19:23:22,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:22,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:22,285 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-14 19:23:22,285 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-14 19:23:22,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:22,286 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-14 19:23:22,286 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-14 19:23:22,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:22,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:22,287 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:23:22,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:23:22,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 19:23:22,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-11-14 19:23:22,288 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-11-14 19:23:22,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:23:22,288 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-11-14 19:23:22,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 19:23:22,288 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-14 19:23:22,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 19:23:22,289 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:23:22,289 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:23:22,289 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:23:22,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:23:22,289 INFO L82 PathProgramCache]: Analyzing trace with hash 173315856, now seen corresponding path program 13 times [2018-11-14 19:23:22,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:23:22,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:23:22,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:22,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:23:22,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:22,301 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:23:22,301 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:23:22,302 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 19:23:22,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:23:22,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:23:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:23:22,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:23:22,698 INFO L256 TraceCheckUtils]: 0: Hoare triple {2173#true} call ULTIMATE.init(); {2173#true} is VALID [2018-11-14 19:23:22,698 INFO L273 TraceCheckUtils]: 1: Hoare triple {2173#true} ~__return_main~0 := 0;~__return_80~0 := 0; {2173#true} is VALID [2018-11-14 19:23:22,699 INFO L273 TraceCheckUtils]: 2: Hoare triple {2173#true} assume true; {2173#true} is VALID [2018-11-14 19:23:22,699 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2173#true} {2173#true} #28#return; {2173#true} is VALID [2018-11-14 19:23:22,699 INFO L256 TraceCheckUtils]: 4: Hoare triple {2173#true} call #t~ret2 := main(); {2173#true} is VALID [2018-11-14 19:23:22,699 INFO L273 TraceCheckUtils]: 5: Hoare triple {2173#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {2173#true} is VALID [2018-11-14 19:23:22,700 INFO L273 TraceCheckUtils]: 6: Hoare triple {2173#true} assume !!(1 <= ~main__n~0); {2173#true} is VALID [2018-11-14 19:23:22,701 INFO L273 TraceCheckUtils]: 7: Hoare triple {2173#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2199#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 19:23:22,701 INFO L273 TraceCheckUtils]: 8: Hoare triple {2199#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2203#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 19:23:22,702 INFO L273 TraceCheckUtils]: 9: Hoare triple {2203#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2207#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 19:23:22,703 INFO L273 TraceCheckUtils]: 10: Hoare triple {2207#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2211#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 19:23:22,703 INFO L273 TraceCheckUtils]: 11: Hoare triple {2211#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2215#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 19:23:22,704 INFO L273 TraceCheckUtils]: 12: Hoare triple {2215#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2219#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 19:23:22,705 INFO L273 TraceCheckUtils]: 13: Hoare triple {2219#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2223#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 19:23:22,706 INFO L273 TraceCheckUtils]: 14: Hoare triple {2223#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2227#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 19:23:22,707 INFO L273 TraceCheckUtils]: 15: Hoare triple {2227#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2231#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 19:23:22,708 INFO L273 TraceCheckUtils]: 16: Hoare triple {2231#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2235#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 19:23:22,709 INFO L273 TraceCheckUtils]: 17: Hoare triple {2235#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2239#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 19:23:22,710 INFO L273 TraceCheckUtils]: 18: Hoare triple {2239#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2243#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 19:23:22,711 INFO L273 TraceCheckUtils]: 19: Hoare triple {2243#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2247#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 19:23:22,712 INFO L273 TraceCheckUtils]: 20: Hoare triple {2247#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2251#(and (<= main_~main__i~0 14) (= main_~main__sum~0 91) (<= 13 main_~main__n~0))} is VALID [2018-11-14 19:23:22,714 INFO L273 TraceCheckUtils]: 21: Hoare triple {2251#(and (<= main_~main__i~0 14) (= main_~main__sum~0 91) (<= 13 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2255#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:23:22,714 INFO L273 TraceCheckUtils]: 22: Hoare triple {2255#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {2174#false} is VALID [2018-11-14 19:23:22,715 INFO L273 TraceCheckUtils]: 23: Hoare triple {2174#false} assume !false; {2174#false} is VALID [2018-11-14 19:23:22,716 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:23:22,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:23:22,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-11-14 19:23:22,739 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2018-11-14 19:23:22,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:23:22,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 19:23:22,761 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 19:23:22,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 19:23:22,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 19:23:22,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-11-14 19:23:22,762 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 17 states. [2018-11-14 19:23:23,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:23,510 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-14 19:23:23,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 19:23:23,510 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2018-11-14 19:23:23,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:23:23,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 19:23:23,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. [2018-11-14 19:23:23,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 19:23:23,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. [2018-11-14 19:23:23,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 29 transitions. [2018-11-14 19:23:23,543 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:23:23,544 INFO L225 Difference]: With dead ends: 29 [2018-11-14 19:23:23,544 INFO L226 Difference]: Without dead ends: 26 [2018-11-14 19:23:23,545 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-11-14 19:23:23,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-14 19:23:23,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-14 19:23:23,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:23:23,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-14 19:23:23,607 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-14 19:23:23,607 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-14 19:23:23,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:23,607 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-14 19:23:23,608 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-14 19:23:23,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:23,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:23,608 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-14 19:23:23,608 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-14 19:23:23,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:23,609 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-14 19:23:23,609 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-14 19:23:23,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:23,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:23,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:23:23,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:23:23,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 19:23:23,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-11-14 19:23:23,611 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-11-14 19:23:23,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:23:23,611 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-11-14 19:23:23,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 19:23:23,612 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-14 19:23:23,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 19:23:23,612 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:23:23,612 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:23:23,612 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:23:23,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:23:23,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1077761767, now seen corresponding path program 14 times [2018-11-14 19:23:23,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:23:23,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:23:23,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:23,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:23:23,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:23,628 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:23:23,628 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:23:23,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 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 19:23:23,638 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 19:23:23,655 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 19:23:23,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:23:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:23:23,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:23:24,049 INFO L256 TraceCheckUtils]: 0: Hoare triple {2408#true} call ULTIMATE.init(); {2408#true} is VALID [2018-11-14 19:23:24,049 INFO L273 TraceCheckUtils]: 1: Hoare triple {2408#true} ~__return_main~0 := 0;~__return_80~0 := 0; {2408#true} is VALID [2018-11-14 19:23:24,049 INFO L273 TraceCheckUtils]: 2: Hoare triple {2408#true} assume true; {2408#true} is VALID [2018-11-14 19:23:24,050 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2408#true} {2408#true} #28#return; {2408#true} is VALID [2018-11-14 19:23:24,050 INFO L256 TraceCheckUtils]: 4: Hoare triple {2408#true} call #t~ret2 := main(); {2408#true} is VALID [2018-11-14 19:23:24,050 INFO L273 TraceCheckUtils]: 5: Hoare triple {2408#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {2408#true} is VALID [2018-11-14 19:23:24,051 INFO L273 TraceCheckUtils]: 6: Hoare triple {2408#true} assume !!(1 <= ~main__n~0); {2408#true} is VALID [2018-11-14 19:23:24,052 INFO L273 TraceCheckUtils]: 7: Hoare triple {2408#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2434#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 19:23:24,053 INFO L273 TraceCheckUtils]: 8: Hoare triple {2434#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2438#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 19:23:24,056 INFO L273 TraceCheckUtils]: 9: Hoare triple {2438#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2442#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 19:23:24,060 INFO L273 TraceCheckUtils]: 10: Hoare triple {2442#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2446#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 19:23:24,061 INFO L273 TraceCheckUtils]: 11: Hoare triple {2446#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2450#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 19:23:24,062 INFO L273 TraceCheckUtils]: 12: Hoare triple {2450#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2454#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 19:23:24,063 INFO L273 TraceCheckUtils]: 13: Hoare triple {2454#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2458#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 19:23:24,063 INFO L273 TraceCheckUtils]: 14: Hoare triple {2458#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2462#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 19:23:24,064 INFO L273 TraceCheckUtils]: 15: Hoare triple {2462#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2466#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 19:23:24,064 INFO L273 TraceCheckUtils]: 16: Hoare triple {2466#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2470#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 19:23:24,065 INFO L273 TraceCheckUtils]: 17: Hoare triple {2470#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2474#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 19:23:24,066 INFO L273 TraceCheckUtils]: 18: Hoare triple {2474#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2478#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 19:23:24,071 INFO L273 TraceCheckUtils]: 19: Hoare triple {2478#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2482#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 19:23:24,072 INFO L273 TraceCheckUtils]: 20: Hoare triple {2482#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2486#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 19:23:24,072 INFO L273 TraceCheckUtils]: 21: Hoare triple {2486#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2490#(and (<= main_~main__i~0 15) (= main_~main__sum~0 105) (<= 14 main_~main__n~0))} is VALID [2018-11-14 19:23:24,073 INFO L273 TraceCheckUtils]: 22: Hoare triple {2490#(and (<= main_~main__i~0 15) (= main_~main__sum~0 105) (<= 14 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2494#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:23:24,074 INFO L273 TraceCheckUtils]: 23: Hoare triple {2494#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {2409#false} is VALID [2018-11-14 19:23:24,074 INFO L273 TraceCheckUtils]: 24: Hoare triple {2409#false} assume !false; {2409#false} is VALID [2018-11-14 19:23:24,076 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:23:24,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:23:24,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-11-14 19:23:24,097 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2018-11-14 19:23:24,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:23:24,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 19:23:24,184 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:23:24,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 19:23:24,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 19:23:24,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-11-14 19:23:24,185 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 18 states. [2018-11-14 19:23:25,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:25,031 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-14 19:23:25,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-14 19:23:25,031 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2018-11-14 19:23:25,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:23:25,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 19:23:25,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 30 transitions. [2018-11-14 19:23:25,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 19:23:25,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 30 transitions. [2018-11-14 19:23:25,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 30 transitions. [2018-11-14 19:23:25,063 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 19:23:25,064 INFO L225 Difference]: With dead ends: 30 [2018-11-14 19:23:25,064 INFO L226 Difference]: Without dead ends: 27 [2018-11-14 19:23:25,065 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2018-11-14 19:23:25,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-14 19:23:25,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-14 19:23:25,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:23:25,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-14 19:23:25,114 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-14 19:23:25,114 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-14 19:23:25,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:25,115 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-14 19:23:25,115 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-14 19:23:25,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:25,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:25,116 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-14 19:23:25,116 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-14 19:23:25,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:25,117 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-14 19:23:25,117 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-14 19:23:25,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:25,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:25,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:23:25,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:23:25,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 19:23:25,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-14 19:23:25,119 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-11-14 19:23:25,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:23:25,119 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-14 19:23:25,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 19:23:25,119 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-14 19:23:25,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 19:23:25,120 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:23:25,120 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:23:25,120 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:23:25,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:23:25,120 INFO L82 PathProgramCache]: Analyzing trace with hash -949186064, now seen corresponding path program 15 times [2018-11-14 19:23:25,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:23:25,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:23:25,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:25,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:23:25,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:25,131 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:23:25,131 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:23:25,132 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 19:23:25,146 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 19:23:25,198 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-14 19:23:25,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:23:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:23:25,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:23:25,938 INFO L256 TraceCheckUtils]: 0: Hoare triple {2653#true} call ULTIMATE.init(); {2653#true} is VALID [2018-11-14 19:23:25,938 INFO L273 TraceCheckUtils]: 1: Hoare triple {2653#true} ~__return_main~0 := 0;~__return_80~0 := 0; {2653#true} is VALID [2018-11-14 19:23:25,938 INFO L273 TraceCheckUtils]: 2: Hoare triple {2653#true} assume true; {2653#true} is VALID [2018-11-14 19:23:25,939 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2653#true} {2653#true} #28#return; {2653#true} is VALID [2018-11-14 19:23:25,939 INFO L256 TraceCheckUtils]: 4: Hoare triple {2653#true} call #t~ret2 := main(); {2653#true} is VALID [2018-11-14 19:23:25,939 INFO L273 TraceCheckUtils]: 5: Hoare triple {2653#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {2653#true} is VALID [2018-11-14 19:23:25,939 INFO L273 TraceCheckUtils]: 6: Hoare triple {2653#true} assume !!(1 <= ~main__n~0); {2653#true} is VALID [2018-11-14 19:23:25,940 INFO L273 TraceCheckUtils]: 7: Hoare triple {2653#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2679#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 19:23:25,940 INFO L273 TraceCheckUtils]: 8: Hoare triple {2679#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2683#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 19:23:25,942 INFO L273 TraceCheckUtils]: 9: Hoare triple {2683#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2687#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 19:23:25,942 INFO L273 TraceCheckUtils]: 10: Hoare triple {2687#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2691#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 19:23:25,944 INFO L273 TraceCheckUtils]: 11: Hoare triple {2691#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2695#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 19:23:25,945 INFO L273 TraceCheckUtils]: 12: Hoare triple {2695#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2699#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 19:23:25,947 INFO L273 TraceCheckUtils]: 13: Hoare triple {2699#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2703#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 19:23:25,947 INFO L273 TraceCheckUtils]: 14: Hoare triple {2703#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2707#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 19:23:25,949 INFO L273 TraceCheckUtils]: 15: Hoare triple {2707#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2711#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 19:23:25,949 INFO L273 TraceCheckUtils]: 16: Hoare triple {2711#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2715#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 19:23:25,951 INFO L273 TraceCheckUtils]: 17: Hoare triple {2715#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2719#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 19:23:25,952 INFO L273 TraceCheckUtils]: 18: Hoare triple {2719#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2723#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 19:23:25,953 INFO L273 TraceCheckUtils]: 19: Hoare triple {2723#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2727#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 19:23:25,954 INFO L273 TraceCheckUtils]: 20: Hoare triple {2727#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2731#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 19:23:25,955 INFO L273 TraceCheckUtils]: 21: Hoare triple {2731#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2735#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 19:23:25,956 INFO L273 TraceCheckUtils]: 22: Hoare triple {2735#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2739#(and (<= 15 main_~main__n~0) (<= main_~main__i~0 16) (= main_~main__sum~0 120))} is VALID [2018-11-14 19:23:25,957 INFO L273 TraceCheckUtils]: 23: Hoare triple {2739#(and (<= 15 main_~main__n~0) (<= main_~main__i~0 16) (= main_~main__sum~0 120))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2743#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:23:25,958 INFO L273 TraceCheckUtils]: 24: Hoare triple {2743#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {2654#false} is VALID [2018-11-14 19:23:25,958 INFO L273 TraceCheckUtils]: 25: Hoare triple {2654#false} assume !false; {2654#false} is VALID [2018-11-14 19:23:25,960 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:23:25,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:23:25,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-11-14 19:23:25,981 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 26 [2018-11-14 19:23:25,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:23:25,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-14 19:23:26,027 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:23:26,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-14 19:23:26,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-14 19:23:26,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-11-14 19:23:26,028 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 19 states. [2018-11-14 19:23:27,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:27,051 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-14 19:23:27,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-14 19:23:27,052 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 26 [2018-11-14 19:23:27,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:23:27,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 19:23:27,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 31 transitions. [2018-11-14 19:23:27,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 19:23:27,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 31 transitions. [2018-11-14 19:23:27,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 31 transitions. [2018-11-14 19:23:27,084 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:23:27,085 INFO L225 Difference]: With dead ends: 31 [2018-11-14 19:23:27,085 INFO L226 Difference]: Without dead ends: 28 [2018-11-14 19:23:27,086 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2018-11-14 19:23:27,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-14 19:23:27,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-14 19:23:27,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:23:27,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-14 19:23:27,140 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 19:23:27,140 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 19:23:27,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:27,141 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-14 19:23:27,141 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-14 19:23:27,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:27,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:27,142 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 19:23:27,142 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 19:23:27,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:27,143 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-14 19:23:27,143 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-14 19:23:27,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:27,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:27,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:23:27,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:23:27,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 19:23:27,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-11-14 19:23:27,145 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-11-14 19:23:27,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:23:27,145 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-11-14 19:23:27,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-14 19:23:27,145 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-14 19:23:27,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 19:23:27,146 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:23:27,146 INFO L375 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:23:27,146 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:23:27,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:23:27,146 INFO L82 PathProgramCache]: Analyzing trace with hash 639940615, now seen corresponding path program 16 times [2018-11-14 19:23:27,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:23:27,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:23:27,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:27,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:23:27,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:27,158 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:23:27,158 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:23:27,158 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 19:23:27,173 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 19:23:27,288 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 19:23:27,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:23:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:23:27,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:23:27,680 INFO L256 TraceCheckUtils]: 0: Hoare triple {2908#true} call ULTIMATE.init(); {2908#true} is VALID [2018-11-14 19:23:27,681 INFO L273 TraceCheckUtils]: 1: Hoare triple {2908#true} ~__return_main~0 := 0;~__return_80~0 := 0; {2908#true} is VALID [2018-11-14 19:23:27,681 INFO L273 TraceCheckUtils]: 2: Hoare triple {2908#true} assume true; {2908#true} is VALID [2018-11-14 19:23:27,681 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2908#true} {2908#true} #28#return; {2908#true} is VALID [2018-11-14 19:23:27,681 INFO L256 TraceCheckUtils]: 4: Hoare triple {2908#true} call #t~ret2 := main(); {2908#true} is VALID [2018-11-14 19:23:27,682 INFO L273 TraceCheckUtils]: 5: Hoare triple {2908#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {2908#true} is VALID [2018-11-14 19:23:27,682 INFO L273 TraceCheckUtils]: 6: Hoare triple {2908#true} assume !!(1 <= ~main__n~0); {2908#true} is VALID [2018-11-14 19:23:27,698 INFO L273 TraceCheckUtils]: 7: Hoare triple {2908#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2934#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 19:23:27,699 INFO L273 TraceCheckUtils]: 8: Hoare triple {2934#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2938#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 19:23:27,700 INFO L273 TraceCheckUtils]: 9: Hoare triple {2938#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2942#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 19:23:27,700 INFO L273 TraceCheckUtils]: 10: Hoare triple {2942#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2946#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 19:23:27,704 INFO L273 TraceCheckUtils]: 11: Hoare triple {2946#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2950#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 19:23:27,705 INFO L273 TraceCheckUtils]: 12: Hoare triple {2950#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2954#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 19:23:27,712 INFO L273 TraceCheckUtils]: 13: Hoare triple {2954#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2958#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 19:23:27,713 INFO L273 TraceCheckUtils]: 14: Hoare triple {2958#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2962#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 19:23:27,713 INFO L273 TraceCheckUtils]: 15: Hoare triple {2962#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2966#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 19:23:27,714 INFO L273 TraceCheckUtils]: 16: Hoare triple {2966#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2970#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 19:23:27,715 INFO L273 TraceCheckUtils]: 17: Hoare triple {2970#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2974#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 19:23:27,715 INFO L273 TraceCheckUtils]: 18: Hoare triple {2974#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2978#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 19:23:27,716 INFO L273 TraceCheckUtils]: 19: Hoare triple {2978#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2982#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 19:23:27,716 INFO L273 TraceCheckUtils]: 20: Hoare triple {2982#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2986#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 19:23:27,717 INFO L273 TraceCheckUtils]: 21: Hoare triple {2986#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2990#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 19:23:27,718 INFO L273 TraceCheckUtils]: 22: Hoare triple {2990#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2994#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 19:23:27,719 INFO L273 TraceCheckUtils]: 23: Hoare triple {2994#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2998#(and (= main_~main__sum~0 136) (<= 16 main_~main__n~0) (<= main_~main__i~0 17))} is VALID [2018-11-14 19:23:27,721 INFO L273 TraceCheckUtils]: 24: Hoare triple {2998#(and (= main_~main__sum~0 136) (<= 16 main_~main__n~0) (<= main_~main__i~0 17))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3002#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:23:27,721 INFO L273 TraceCheckUtils]: 25: Hoare triple {3002#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {2909#false} is VALID [2018-11-14 19:23:27,722 INFO L273 TraceCheckUtils]: 26: Hoare triple {2909#false} assume !false; {2909#false} is VALID [2018-11-14 19:23:27,724 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:23:27,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:23:27,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-11-14 19:23:27,755 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2018-11-14 19:23:27,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:23:27,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-14 19:23:27,782 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 19:23:27,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-14 19:23:27,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-14 19:23:27,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-11-14 19:23:27,784 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 20 states. [2018-11-14 19:23:29,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:29,309 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-14 19:23:29,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-14 19:23:29,309 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2018-11-14 19:23:29,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:23:29,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 19:23:29,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 32 transitions. [2018-11-14 19:23:29,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 19:23:29,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 32 transitions. [2018-11-14 19:23:29,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 32 transitions. [2018-11-14 19:23:29,353 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:23:29,354 INFO L225 Difference]: With dead ends: 32 [2018-11-14 19:23:29,354 INFO L226 Difference]: Without dead ends: 29 [2018-11-14 19:23:29,355 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-11-14 19:23:29,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-14 19:23:29,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-14 19:23:29,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:23:29,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-14 19:23:29,419 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 19:23:29,419 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 19:23:29,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:29,421 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-14 19:23:29,421 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-14 19:23:29,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:29,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:29,422 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 19:23:29,422 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 19:23:29,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:29,423 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-14 19:23:29,423 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-14 19:23:29,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:29,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:29,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:23:29,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:23:29,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 19:23:29,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-11-14 19:23:29,424 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-11-14 19:23:29,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:23:29,425 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-11-14 19:23:29,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-14 19:23:29,425 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-14 19:23:29,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 19:23:29,425 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:23:29,426 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:23:29,426 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:23:29,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:23:29,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1636739888, now seen corresponding path program 17 times [2018-11-14 19:23:29,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:23:29,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:23:29,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:29,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:23:29,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:29,439 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:23:29,439 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:23:29,439 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 19:23:29,457 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 19:23:29,494 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-11-14 19:23:29,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:23:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:23:29,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:23:30,397 INFO L256 TraceCheckUtils]: 0: Hoare triple {3173#true} call ULTIMATE.init(); {3173#true} is VALID [2018-11-14 19:23:30,398 INFO L273 TraceCheckUtils]: 1: Hoare triple {3173#true} ~__return_main~0 := 0;~__return_80~0 := 0; {3173#true} is VALID [2018-11-14 19:23:30,398 INFO L273 TraceCheckUtils]: 2: Hoare triple {3173#true} assume true; {3173#true} is VALID [2018-11-14 19:23:30,398 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3173#true} {3173#true} #28#return; {3173#true} is VALID [2018-11-14 19:23:30,398 INFO L256 TraceCheckUtils]: 4: Hoare triple {3173#true} call #t~ret2 := main(); {3173#true} is VALID [2018-11-14 19:23:30,399 INFO L273 TraceCheckUtils]: 5: Hoare triple {3173#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {3173#true} is VALID [2018-11-14 19:23:30,399 INFO L273 TraceCheckUtils]: 6: Hoare triple {3173#true} assume !!(1 <= ~main__n~0); {3173#true} is VALID [2018-11-14 19:23:30,399 INFO L273 TraceCheckUtils]: 7: Hoare triple {3173#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {3199#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 19:23:30,400 INFO L273 TraceCheckUtils]: 8: Hoare triple {3199#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3203#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 19:23:30,401 INFO L273 TraceCheckUtils]: 9: Hoare triple {3203#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3207#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 19:23:30,401 INFO L273 TraceCheckUtils]: 10: Hoare triple {3207#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3211#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 19:23:30,402 INFO L273 TraceCheckUtils]: 11: Hoare triple {3211#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3215#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 19:23:30,402 INFO L273 TraceCheckUtils]: 12: Hoare triple {3215#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3219#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 19:23:30,403 INFO L273 TraceCheckUtils]: 13: Hoare triple {3219#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3223#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 19:23:30,404 INFO L273 TraceCheckUtils]: 14: Hoare triple {3223#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3227#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 19:23:30,405 INFO L273 TraceCheckUtils]: 15: Hoare triple {3227#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3231#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 19:23:30,406 INFO L273 TraceCheckUtils]: 16: Hoare triple {3231#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3235#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 19:23:30,407 INFO L273 TraceCheckUtils]: 17: Hoare triple {3235#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3239#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 19:23:30,408 INFO L273 TraceCheckUtils]: 18: Hoare triple {3239#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3243#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 19:23:30,410 INFO L273 TraceCheckUtils]: 19: Hoare triple {3243#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3247#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 19:23:30,411 INFO L273 TraceCheckUtils]: 20: Hoare triple {3247#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3251#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 19:23:30,412 INFO L273 TraceCheckUtils]: 21: Hoare triple {3251#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3255#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 19:23:30,413 INFO L273 TraceCheckUtils]: 22: Hoare triple {3255#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3259#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 19:23:30,414 INFO L273 TraceCheckUtils]: 23: Hoare triple {3259#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3263#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 19:23:30,415 INFO L273 TraceCheckUtils]: 24: Hoare triple {3263#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3267#(and (<= main_~main__i~0 18) (= main_~main__sum~0 153) (<= 17 main_~main__n~0))} is VALID [2018-11-14 19:23:30,417 INFO L273 TraceCheckUtils]: 25: Hoare triple {3267#(and (<= main_~main__i~0 18) (= main_~main__sum~0 153) (<= 17 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3271#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:23:30,418 INFO L273 TraceCheckUtils]: 26: Hoare triple {3271#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {3174#false} is VALID [2018-11-14 19:23:30,418 INFO L273 TraceCheckUtils]: 27: Hoare triple {3174#false} assume !false; {3174#false} is VALID [2018-11-14 19:23:30,421 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:23:30,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:23:30,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-11-14 19:23:30,444 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2018-11-14 19:23:30,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:23:30,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-14 19:23:30,473 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:23:30,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-14 19:23:30,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-14 19:23:30,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-11-14 19:23:30,474 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 21 states. [2018-11-14 19:23:31,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:31,778 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-14 19:23:31,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-14 19:23:31,778 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2018-11-14 19:23:31,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:23:31,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 19:23:31,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 33 transitions. [2018-11-14 19:23:31,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 19:23:31,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 33 transitions. [2018-11-14 19:23:31,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 33 transitions. [2018-11-14 19:23:31,810 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 19:23:31,811 INFO L225 Difference]: With dead ends: 33 [2018-11-14 19:23:31,811 INFO L226 Difference]: Without dead ends: 30 [2018-11-14 19:23:31,812 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-11-14 19:23:31,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-14 19:23:31,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-14 19:23:31,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:23:31,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2018-11-14 19:23:31,873 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-14 19:23:31,873 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-14 19:23:31,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:31,875 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-14 19:23:31,875 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-14 19:23:31,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:31,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:31,876 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-14 19:23:31,876 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-14 19:23:31,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:31,877 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-14 19:23:31,877 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-14 19:23:31,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:31,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:31,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:23:31,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:23:31,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 19:23:31,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-14 19:23:31,878 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-11-14 19:23:31,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:23:31,878 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-14 19:23:31,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-14 19:23:31,878 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-14 19:23:31,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 19:23:31,879 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:23:31,879 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:23:31,879 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:23:31,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:23:31,879 INFO L82 PathProgramCache]: Analyzing trace with hash 800608551, now seen corresponding path program 18 times [2018-11-14 19:23:31,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:23:31,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:23:31,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:31,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:23:31,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:31,891 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:23:31,891 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:23:31,891 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 19:23:31,915 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 19:23:31,956 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-11-14 19:23:31,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:23:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:23:31,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:23:32,512 INFO L256 TraceCheckUtils]: 0: Hoare triple {3448#true} call ULTIMATE.init(); {3448#true} is VALID [2018-11-14 19:23:32,513 INFO L273 TraceCheckUtils]: 1: Hoare triple {3448#true} ~__return_main~0 := 0;~__return_80~0 := 0; {3448#true} is VALID [2018-11-14 19:23:32,513 INFO L273 TraceCheckUtils]: 2: Hoare triple {3448#true} assume true; {3448#true} is VALID [2018-11-14 19:23:32,513 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3448#true} {3448#true} #28#return; {3448#true} is VALID [2018-11-14 19:23:32,514 INFO L256 TraceCheckUtils]: 4: Hoare triple {3448#true} call #t~ret2 := main(); {3448#true} is VALID [2018-11-14 19:23:32,514 INFO L273 TraceCheckUtils]: 5: Hoare triple {3448#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {3448#true} is VALID [2018-11-14 19:23:32,514 INFO L273 TraceCheckUtils]: 6: Hoare triple {3448#true} assume !!(1 <= ~main__n~0); {3448#true} is VALID [2018-11-14 19:23:32,515 INFO L273 TraceCheckUtils]: 7: Hoare triple {3448#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {3474#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 19:23:32,515 INFO L273 TraceCheckUtils]: 8: Hoare triple {3474#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3478#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 19:23:32,516 INFO L273 TraceCheckUtils]: 9: Hoare triple {3478#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3482#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 19:23:32,516 INFO L273 TraceCheckUtils]: 10: Hoare triple {3482#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3486#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 19:23:32,517 INFO L273 TraceCheckUtils]: 11: Hoare triple {3486#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3490#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 19:23:32,518 INFO L273 TraceCheckUtils]: 12: Hoare triple {3490#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3494#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 19:23:32,519 INFO L273 TraceCheckUtils]: 13: Hoare triple {3494#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3498#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 19:23:32,520 INFO L273 TraceCheckUtils]: 14: Hoare triple {3498#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3502#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 19:23:32,521 INFO L273 TraceCheckUtils]: 15: Hoare triple {3502#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3506#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 19:23:32,522 INFO L273 TraceCheckUtils]: 16: Hoare triple {3506#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3510#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 19:23:32,523 INFO L273 TraceCheckUtils]: 17: Hoare triple {3510#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3514#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 19:23:32,524 INFO L273 TraceCheckUtils]: 18: Hoare triple {3514#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3518#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 19:23:32,525 INFO L273 TraceCheckUtils]: 19: Hoare triple {3518#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3522#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 19:23:32,526 INFO L273 TraceCheckUtils]: 20: Hoare triple {3522#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3526#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 19:23:32,527 INFO L273 TraceCheckUtils]: 21: Hoare triple {3526#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3530#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 19:23:32,528 INFO L273 TraceCheckUtils]: 22: Hoare triple {3530#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3534#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 19:23:32,529 INFO L273 TraceCheckUtils]: 23: Hoare triple {3534#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3538#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 19:23:32,530 INFO L273 TraceCheckUtils]: 24: Hoare triple {3538#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3542#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 19:23:32,530 INFO L273 TraceCheckUtils]: 25: Hoare triple {3542#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3546#(and (<= main_~main__i~0 19) (<= 18 main_~main__n~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 19:23:32,532 INFO L273 TraceCheckUtils]: 26: Hoare triple {3546#(and (<= main_~main__i~0 19) (<= 18 main_~main__n~0) (= main_~main__sum~0 171))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3550#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:23:32,533 INFO L273 TraceCheckUtils]: 27: Hoare triple {3550#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {3449#false} is VALID [2018-11-14 19:23:32,533 INFO L273 TraceCheckUtils]: 28: Hoare triple {3449#false} assume !false; {3449#false} is VALID [2018-11-14 19:23:32,536 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:23:32,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:23:32,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-11-14 19:23:32,556 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2018-11-14 19:23:32,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:23:32,557 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-14 19:23:32,582 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:23:32,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-14 19:23:32,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-14 19:23:32,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-11-14 19:23:32,583 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 22 states. [2018-11-14 19:23:33,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:33,850 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-14 19:23:33,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-14 19:23:33,851 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2018-11-14 19:23:33,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:23:33,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 19:23:33,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 34 transitions. [2018-11-14 19:23:33,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 19:23:33,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 34 transitions. [2018-11-14 19:23:33,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 34 transitions. [2018-11-14 19:23:34,306 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:23:34,307 INFO L225 Difference]: With dead ends: 34 [2018-11-14 19:23:34,307 INFO L226 Difference]: Without dead ends: 31 [2018-11-14 19:23:34,308 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2018-11-14 19:23:34,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-14 19:23:34,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-14 19:23:34,417 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:23:34,417 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-14 19:23:34,417 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-14 19:23:34,418 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-14 19:23:34,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:34,419 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-14 19:23:34,419 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-14 19:23:34,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:34,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:34,420 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-14 19:23:34,420 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-14 19:23:34,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:34,421 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-14 19:23:34,421 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-14 19:23:34,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:34,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:34,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:23:34,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:23:34,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 19:23:34,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-11-14 19:23:34,422 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-11-14 19:23:34,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:23:34,422 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-11-14 19:23:34,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-14 19:23:34,422 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-14 19:23:34,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 19:23:34,422 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:23:34,422 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:23:34,423 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:23:34,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:23:34,423 INFO L82 PathProgramCache]: Analyzing trace with hash -951001168, now seen corresponding path program 19 times [2018-11-14 19:23:34,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:23:34,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:23:34,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:34,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:23:34,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:34,433 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:23:34,434 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:23:34,434 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 19:23:34,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:23:34,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:23:34,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:23:34,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:23:35,015 INFO L256 TraceCheckUtils]: 0: Hoare triple {3733#true} call ULTIMATE.init(); {3733#true} is VALID [2018-11-14 19:23:35,015 INFO L273 TraceCheckUtils]: 1: Hoare triple {3733#true} ~__return_main~0 := 0;~__return_80~0 := 0; {3733#true} is VALID [2018-11-14 19:23:35,016 INFO L273 TraceCheckUtils]: 2: Hoare triple {3733#true} assume true; {3733#true} is VALID [2018-11-14 19:23:35,016 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3733#true} {3733#true} #28#return; {3733#true} is VALID [2018-11-14 19:23:35,016 INFO L256 TraceCheckUtils]: 4: Hoare triple {3733#true} call #t~ret2 := main(); {3733#true} is VALID [2018-11-14 19:23:35,017 INFO L273 TraceCheckUtils]: 5: Hoare triple {3733#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {3733#true} is VALID [2018-11-14 19:23:35,017 INFO L273 TraceCheckUtils]: 6: Hoare triple {3733#true} assume !!(1 <= ~main__n~0); {3733#true} is VALID [2018-11-14 19:23:35,019 INFO L273 TraceCheckUtils]: 7: Hoare triple {3733#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {3759#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 19:23:35,020 INFO L273 TraceCheckUtils]: 8: Hoare triple {3759#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3763#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 19:23:35,020 INFO L273 TraceCheckUtils]: 9: Hoare triple {3763#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3767#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 19:23:35,021 INFO L273 TraceCheckUtils]: 10: Hoare triple {3767#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3771#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 19:23:35,021 INFO L273 TraceCheckUtils]: 11: Hoare triple {3771#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3775#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 19:23:35,022 INFO L273 TraceCheckUtils]: 12: Hoare triple {3775#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3779#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 19:23:35,023 INFO L273 TraceCheckUtils]: 13: Hoare triple {3779#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3783#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 19:23:35,023 INFO L273 TraceCheckUtils]: 14: Hoare triple {3783#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3787#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 19:23:35,024 INFO L273 TraceCheckUtils]: 15: Hoare triple {3787#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3791#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 19:23:35,025 INFO L273 TraceCheckUtils]: 16: Hoare triple {3791#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3795#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 19:23:35,026 INFO L273 TraceCheckUtils]: 17: Hoare triple {3795#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3799#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 19:23:35,027 INFO L273 TraceCheckUtils]: 18: Hoare triple {3799#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3803#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 19:23:35,028 INFO L273 TraceCheckUtils]: 19: Hoare triple {3803#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3807#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 19:23:35,029 INFO L273 TraceCheckUtils]: 20: Hoare triple {3807#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3811#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 19:23:35,030 INFO L273 TraceCheckUtils]: 21: Hoare triple {3811#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3815#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 19:23:35,031 INFO L273 TraceCheckUtils]: 22: Hoare triple {3815#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3819#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 19:23:35,032 INFO L273 TraceCheckUtils]: 23: Hoare triple {3819#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3823#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 19:23:35,033 INFO L273 TraceCheckUtils]: 24: Hoare triple {3823#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3827#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 19:23:35,034 INFO L273 TraceCheckUtils]: 25: Hoare triple {3827#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3831#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 19:23:35,035 INFO L273 TraceCheckUtils]: 26: Hoare triple {3831#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3835#(and (<= main_~main__i~0 20) (= main_~main__sum~0 190) (<= 19 main_~main__n~0))} is VALID [2018-11-14 19:23:35,036 INFO L273 TraceCheckUtils]: 27: Hoare triple {3835#(and (<= main_~main__i~0 20) (= main_~main__sum~0 190) (<= 19 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3839#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:23:35,037 INFO L273 TraceCheckUtils]: 28: Hoare triple {3839#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {3734#false} is VALID [2018-11-14 19:23:35,037 INFO L273 TraceCheckUtils]: 29: Hoare triple {3734#false} assume !false; {3734#false} is VALID [2018-11-14 19:23:35,040 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:23:35,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:23:35,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-11-14 19:23:35,061 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-11-14 19:23:35,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:23:35,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-14 19:23:35,088 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 19:23:35,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-14 19:23:35,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-14 19:23:35,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-11-14 19:23:35,089 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 23 states. [2018-11-14 19:23:37,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:37,053 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-14 19:23:37,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-14 19:23:37,053 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-11-14 19:23:37,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:23:37,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 19:23:37,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2018-11-14 19:23:37,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 19:23:37,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2018-11-14 19:23:37,056 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 35 transitions. [2018-11-14 19:23:37,091 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:23:37,092 INFO L225 Difference]: With dead ends: 35 [2018-11-14 19:23:37,092 INFO L226 Difference]: Without dead ends: 32 [2018-11-14 19:23:37,093 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2018-11-14 19:23:37,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-14 19:23:37,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-14 19:23:37,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:23:37,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2018-11-14 19:23:37,150 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-14 19:23:37,150 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-14 19:23:37,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:37,152 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-14 19:23:37,152 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-14 19:23:37,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:37,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:37,152 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-14 19:23:37,152 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-14 19:23:37,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:37,153 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-14 19:23:37,153 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-14 19:23:37,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:37,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:37,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:23:37,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:23:37,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 19:23:37,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-11-14 19:23:37,155 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-11-14 19:23:37,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:23:37,155 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-11-14 19:23:37,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-14 19:23:37,156 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-14 19:23:37,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 19:23:37,156 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:23:37,156 INFO L375 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:23:37,157 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:23:37,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:23:37,157 INFO L82 PathProgramCache]: Analyzing trace with hash 583672391, now seen corresponding path program 20 times [2018-11-14 19:23:37,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:23:37,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:23:37,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:37,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:23:37,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:37,168 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:23:37,169 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:23:37,169 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 19:23:37,204 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 19:23:37,238 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 19:23:37,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:23:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:23:37,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:23:38,269 INFO L256 TraceCheckUtils]: 0: Hoare triple {4028#true} call ULTIMATE.init(); {4028#true} is VALID [2018-11-14 19:23:38,270 INFO L273 TraceCheckUtils]: 1: Hoare triple {4028#true} ~__return_main~0 := 0;~__return_80~0 := 0; {4028#true} is VALID [2018-11-14 19:23:38,270 INFO L273 TraceCheckUtils]: 2: Hoare triple {4028#true} assume true; {4028#true} is VALID [2018-11-14 19:23:38,270 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4028#true} {4028#true} #28#return; {4028#true} is VALID [2018-11-14 19:23:38,270 INFO L256 TraceCheckUtils]: 4: Hoare triple {4028#true} call #t~ret2 := main(); {4028#true} is VALID [2018-11-14 19:23:38,270 INFO L273 TraceCheckUtils]: 5: Hoare triple {4028#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {4028#true} is VALID [2018-11-14 19:23:38,271 INFO L273 TraceCheckUtils]: 6: Hoare triple {4028#true} assume !!(1 <= ~main__n~0); {4028#true} is VALID [2018-11-14 19:23:38,271 INFO L273 TraceCheckUtils]: 7: Hoare triple {4028#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {4054#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 19:23:38,271 INFO L273 TraceCheckUtils]: 8: Hoare triple {4054#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4058#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-14 19:23:38,272 INFO L273 TraceCheckUtils]: 9: Hoare triple {4058#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4062#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 19:23:38,273 INFO L273 TraceCheckUtils]: 10: Hoare triple {4062#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4066#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 19:23:38,275 INFO L273 TraceCheckUtils]: 11: Hoare triple {4066#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4070#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 19:23:38,276 INFO L273 TraceCheckUtils]: 12: Hoare triple {4070#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4074#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 19:23:38,277 INFO L273 TraceCheckUtils]: 13: Hoare triple {4074#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4078#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 19:23:38,277 INFO L273 TraceCheckUtils]: 14: Hoare triple {4078#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4082#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 19:23:38,278 INFO L273 TraceCheckUtils]: 15: Hoare triple {4082#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4086#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 19:23:38,279 INFO L273 TraceCheckUtils]: 16: Hoare triple {4086#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4090#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 19:23:38,279 INFO L273 TraceCheckUtils]: 17: Hoare triple {4090#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4094#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 19:23:38,280 INFO L273 TraceCheckUtils]: 18: Hoare triple {4094#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4098#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 19:23:38,281 INFO L273 TraceCheckUtils]: 19: Hoare triple {4098#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4102#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 19:23:38,282 INFO L273 TraceCheckUtils]: 20: Hoare triple {4102#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4106#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 19:23:38,283 INFO L273 TraceCheckUtils]: 21: Hoare triple {4106#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4110#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 19:23:38,283 INFO L273 TraceCheckUtils]: 22: Hoare triple {4110#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4114#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 19:23:38,284 INFO L273 TraceCheckUtils]: 23: Hoare triple {4114#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4118#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 19:23:38,285 INFO L273 TraceCheckUtils]: 24: Hoare triple {4118#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4122#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 19:23:38,286 INFO L273 TraceCheckUtils]: 25: Hoare triple {4122#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4126#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 19:23:38,287 INFO L273 TraceCheckUtils]: 26: Hoare triple {4126#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4130#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 19:23:38,289 INFO L273 TraceCheckUtils]: 27: Hoare triple {4130#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4134#(and (<= 20 main_~main__n~0) (<= main_~main__i~0 21) (= main_~main__sum~0 210))} is VALID [2018-11-14 19:23:38,290 INFO L273 TraceCheckUtils]: 28: Hoare triple {4134#(and (<= 20 main_~main__n~0) (<= main_~main__i~0 21) (= main_~main__sum~0 210))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4138#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:23:38,291 INFO L273 TraceCheckUtils]: 29: Hoare triple {4138#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {4029#false} is VALID [2018-11-14 19:23:38,291 INFO L273 TraceCheckUtils]: 30: Hoare triple {4029#false} assume !false; {4029#false} is VALID [2018-11-14 19:23:38,293 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:23:38,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:23:38,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-11-14 19:23:38,315 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2018-11-14 19:23:38,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:23:38,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 19:23:38,342 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:23:38,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 19:23:38,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 19:23:38,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-11-14 19:23:38,343 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 24 states. [2018-11-14 19:23:39,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:39,910 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-14 19:23:39,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-14 19:23:39,910 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2018-11-14 19:23:39,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:23:39,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 19:23:39,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 36 transitions. [2018-11-14 19:23:39,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 19:23:39,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 36 transitions. [2018-11-14 19:23:39,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 36 transitions. [2018-11-14 19:23:39,946 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 19:23:39,947 INFO L225 Difference]: With dead ends: 36 [2018-11-14 19:23:39,947 INFO L226 Difference]: Without dead ends: 33 [2018-11-14 19:23:39,948 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-11-14 19:23:39,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-14 19:23:40,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-14 19:23:40,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:23:40,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-14 19:23:40,010 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-14 19:23:40,011 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-14 19:23:40,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:40,012 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-14 19:23:40,012 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-14 19:23:40,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:40,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:40,012 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-14 19:23:40,012 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-14 19:23:40,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:40,013 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-14 19:23:40,013 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-14 19:23:40,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:40,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:40,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:23:40,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:23:40,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 19:23:40,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-14 19:23:40,014 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-11-14 19:23:40,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:23:40,015 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-14 19:23:40,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 19:23:40,015 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-14 19:23:40,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 19:23:40,015 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:23:40,015 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:23:40,016 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:23:40,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:23:40,016 INFO L82 PathProgramCache]: Analyzing trace with hash 913912464, now seen corresponding path program 21 times [2018-11-14 19:23:40,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:23:40,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:23:40,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:40,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:23:40,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:40,027 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:23:40,027 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:23:40,027 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 19:23:40,043 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 19:23:40,235 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-14 19:23:40,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:23:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:23:40,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:23:40,952 INFO L256 TraceCheckUtils]: 0: Hoare triple {4333#true} call ULTIMATE.init(); {4333#true} is VALID [2018-11-14 19:23:40,953 INFO L273 TraceCheckUtils]: 1: Hoare triple {4333#true} ~__return_main~0 := 0;~__return_80~0 := 0; {4333#true} is VALID [2018-11-14 19:23:40,953 INFO L273 TraceCheckUtils]: 2: Hoare triple {4333#true} assume true; {4333#true} is VALID [2018-11-14 19:23:40,953 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4333#true} {4333#true} #28#return; {4333#true} is VALID [2018-11-14 19:23:40,953 INFO L256 TraceCheckUtils]: 4: Hoare triple {4333#true} call #t~ret2 := main(); {4333#true} is VALID [2018-11-14 19:23:40,954 INFO L273 TraceCheckUtils]: 5: Hoare triple {4333#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {4333#true} is VALID [2018-11-14 19:23:40,954 INFO L273 TraceCheckUtils]: 6: Hoare triple {4333#true} assume !!(1 <= ~main__n~0); {4333#true} is VALID [2018-11-14 19:23:40,954 INFO L273 TraceCheckUtils]: 7: Hoare triple {4333#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {4359#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 19:23:40,955 INFO L273 TraceCheckUtils]: 8: Hoare triple {4359#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4363#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-14 19:23:40,956 INFO L273 TraceCheckUtils]: 9: Hoare triple {4363#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4367#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 19:23:40,956 INFO L273 TraceCheckUtils]: 10: Hoare triple {4367#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4371#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 19:23:40,957 INFO L273 TraceCheckUtils]: 11: Hoare triple {4371#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4375#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 19:23:40,957 INFO L273 TraceCheckUtils]: 12: Hoare triple {4375#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4379#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 19:23:40,958 INFO L273 TraceCheckUtils]: 13: Hoare triple {4379#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4383#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 19:23:40,959 INFO L273 TraceCheckUtils]: 14: Hoare triple {4383#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4387#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 19:23:40,960 INFO L273 TraceCheckUtils]: 15: Hoare triple {4387#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4391#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 19:23:40,961 INFO L273 TraceCheckUtils]: 16: Hoare triple {4391#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4395#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 19:23:40,962 INFO L273 TraceCheckUtils]: 17: Hoare triple {4395#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4399#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 19:23:40,963 INFO L273 TraceCheckUtils]: 18: Hoare triple {4399#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4403#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 19:23:40,964 INFO L273 TraceCheckUtils]: 19: Hoare triple {4403#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4407#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 19:23:40,964 INFO L273 TraceCheckUtils]: 20: Hoare triple {4407#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4411#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 19:23:40,965 INFO L273 TraceCheckUtils]: 21: Hoare triple {4411#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4415#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 19:23:40,966 INFO L273 TraceCheckUtils]: 22: Hoare triple {4415#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4419#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 19:23:40,967 INFO L273 TraceCheckUtils]: 23: Hoare triple {4419#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4423#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 19:23:40,968 INFO L273 TraceCheckUtils]: 24: Hoare triple {4423#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4427#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 19:23:40,969 INFO L273 TraceCheckUtils]: 25: Hoare triple {4427#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4431#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 19:23:40,970 INFO L273 TraceCheckUtils]: 26: Hoare triple {4431#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4435#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 19:23:40,971 INFO L273 TraceCheckUtils]: 27: Hoare triple {4435#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4439#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 19:23:40,972 INFO L273 TraceCheckUtils]: 28: Hoare triple {4439#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4443#(and (<= 21 main_~main__n~0) (= main_~main__sum~0 231) (<= main_~main__i~0 22))} is VALID [2018-11-14 19:23:40,973 INFO L273 TraceCheckUtils]: 29: Hoare triple {4443#(and (<= 21 main_~main__n~0) (= main_~main__sum~0 231) (<= main_~main__i~0 22))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4447#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:23:40,974 INFO L273 TraceCheckUtils]: 30: Hoare triple {4447#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {4334#false} is VALID [2018-11-14 19:23:40,974 INFO L273 TraceCheckUtils]: 31: Hoare triple {4334#false} assume !false; {4334#false} is VALID [2018-11-14 19:23:40,976 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:23:40,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:23:40,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-11-14 19:23:40,997 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 32 [2018-11-14 19:23:40,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:23:40,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-14 19:23:41,026 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:23:41,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-14 19:23:41,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-14 19:23:41,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-11-14 19:23:41,029 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 25 states. [2018-11-14 19:23:42,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:42,873 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-11-14 19:23:42,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-14 19:23:42,874 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 32 [2018-11-14 19:23:42,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:23:42,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 19:23:42,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2018-11-14 19:23:42,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 19:23:42,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2018-11-14 19:23:42,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 37 transitions. [2018-11-14 19:23:42,931 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 19:23:42,932 INFO L225 Difference]: With dead ends: 37 [2018-11-14 19:23:42,932 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 19:23:42,933 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2018-11-14 19:23:42,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 19:23:43,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-14 19:23:43,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:23:43,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2018-11-14 19:23:43,008 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-14 19:23:43,008 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-14 19:23:43,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:43,009 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-14 19:23:43,009 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-14 19:23:43,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:43,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:43,009 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-14 19:23:43,009 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-14 19:23:43,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:43,010 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-14 19:23:43,010 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-14 19:23:43,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:43,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:43,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:23:43,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:23:43,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 19:23:43,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-11-14 19:23:43,011 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-11-14 19:23:43,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:23:43,011 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-11-14 19:23:43,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-14 19:23:43,012 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-14 19:23:43,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-14 19:23:43,012 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:23:43,012 INFO L375 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:23:43,012 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:23:43,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:23:43,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1733547161, now seen corresponding path program 22 times [2018-11-14 19:23:43,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:23:43,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:23:43,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:43,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:23:43,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:43,021 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:23:43,021 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:23:43,021 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 19:23:43,037 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 19:23:43,255 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 19:23:43,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:23:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:23:43,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:23:44,084 INFO L256 TraceCheckUtils]: 0: Hoare triple {4648#true} call ULTIMATE.init(); {4648#true} is VALID [2018-11-14 19:23:44,084 INFO L273 TraceCheckUtils]: 1: Hoare triple {4648#true} ~__return_main~0 := 0;~__return_80~0 := 0; {4648#true} is VALID [2018-11-14 19:23:44,084 INFO L273 TraceCheckUtils]: 2: Hoare triple {4648#true} assume true; {4648#true} is VALID [2018-11-14 19:23:44,085 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4648#true} {4648#true} #28#return; {4648#true} is VALID [2018-11-14 19:23:44,085 INFO L256 TraceCheckUtils]: 4: Hoare triple {4648#true} call #t~ret2 := main(); {4648#true} is VALID [2018-11-14 19:23:44,085 INFO L273 TraceCheckUtils]: 5: Hoare triple {4648#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {4648#true} is VALID [2018-11-14 19:23:44,085 INFO L273 TraceCheckUtils]: 6: Hoare triple {4648#true} assume !!(1 <= ~main__n~0); {4648#true} is VALID [2018-11-14 19:23:44,085 INFO L273 TraceCheckUtils]: 7: Hoare triple {4648#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {4674#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 19:23:44,086 INFO L273 TraceCheckUtils]: 8: Hoare triple {4674#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4678#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-14 19:23:44,087 INFO L273 TraceCheckUtils]: 9: Hoare triple {4678#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4682#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 19:23:44,087 INFO L273 TraceCheckUtils]: 10: Hoare triple {4682#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4686#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 19:23:44,088 INFO L273 TraceCheckUtils]: 11: Hoare triple {4686#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4690#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 19:23:44,088 INFO L273 TraceCheckUtils]: 12: Hoare triple {4690#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4694#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 19:23:44,089 INFO L273 TraceCheckUtils]: 13: Hoare triple {4694#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4698#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 19:23:44,089 INFO L273 TraceCheckUtils]: 14: Hoare triple {4698#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4702#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 19:23:44,090 INFO L273 TraceCheckUtils]: 15: Hoare triple {4702#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4706#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 19:23:44,090 INFO L273 TraceCheckUtils]: 16: Hoare triple {4706#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4710#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 19:23:44,091 INFO L273 TraceCheckUtils]: 17: Hoare triple {4710#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4714#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 19:23:44,092 INFO L273 TraceCheckUtils]: 18: Hoare triple {4714#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4718#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 19:23:44,093 INFO L273 TraceCheckUtils]: 19: Hoare triple {4718#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4722#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 19:23:44,094 INFO L273 TraceCheckUtils]: 20: Hoare triple {4722#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4726#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 19:23:44,095 INFO L273 TraceCheckUtils]: 21: Hoare triple {4726#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4730#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 19:23:44,096 INFO L273 TraceCheckUtils]: 22: Hoare triple {4730#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4734#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 19:23:44,097 INFO L273 TraceCheckUtils]: 23: Hoare triple {4734#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4738#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 19:23:44,098 INFO L273 TraceCheckUtils]: 24: Hoare triple {4738#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4742#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 19:23:44,099 INFO L273 TraceCheckUtils]: 25: Hoare triple {4742#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4746#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 19:23:44,100 INFO L273 TraceCheckUtils]: 26: Hoare triple {4746#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4750#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 19:23:44,101 INFO L273 TraceCheckUtils]: 27: Hoare triple {4750#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4754#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 19:23:44,102 INFO L273 TraceCheckUtils]: 28: Hoare triple {4754#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4758#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 19:23:44,103 INFO L273 TraceCheckUtils]: 29: Hoare triple {4758#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4762#(and (<= 22 main_~main__n~0) (<= main_~main__i~0 23) (= main_~main__sum~0 253))} is VALID [2018-11-14 19:23:44,104 INFO L273 TraceCheckUtils]: 30: Hoare triple {4762#(and (<= 22 main_~main__n~0) (<= main_~main__i~0 23) (= main_~main__sum~0 253))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4766#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:23:44,105 INFO L273 TraceCheckUtils]: 31: Hoare triple {4766#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {4649#false} is VALID [2018-11-14 19:23:44,105 INFO L273 TraceCheckUtils]: 32: Hoare triple {4649#false} assume !false; {4649#false} is VALID [2018-11-14 19:23:44,108 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:23:44,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:23:44,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-11-14 19:23:44,128 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 33 [2018-11-14 19:23:44,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:23:44,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-14 19:23:44,160 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 19:23:44,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-14 19:23:44,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-14 19:23:44,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-11-14 19:23:44,161 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 26 states. [2018-11-14 19:23:45,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:45,860 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-14 19:23:45,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-14 19:23:45,860 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 33 [2018-11-14 19:23:45,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:23:45,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 19:23:45,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2018-11-14 19:23:45,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 19:23:45,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2018-11-14 19:23:45,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 38 transitions. [2018-11-14 19:23:46,288 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:23:46,289 INFO L225 Difference]: With dead ends: 38 [2018-11-14 19:23:46,289 INFO L226 Difference]: Without dead ends: 35 [2018-11-14 19:23:46,290 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2018-11-14 19:23:46,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-14 19:23:46,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-14 19:23:46,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:23:46,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2018-11-14 19:23:46,429 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-14 19:23:46,429 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-14 19:23:46,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:46,430 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-14 19:23:46,430 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-14 19:23:46,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:46,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:46,431 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-14 19:23:46,431 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-14 19:23:46,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:46,432 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-14 19:23:46,432 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-14 19:23:46,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:46,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:46,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:23:46,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:23:46,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 19:23:46,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-11-14 19:23:46,434 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-11-14 19:23:46,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:23:46,434 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-11-14 19:23:46,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-14 19:23:46,434 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-14 19:23:46,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-14 19:23:46,435 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:23:46,435 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:23:46,435 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:23:46,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:23:46,436 INFO L82 PathProgramCache]: Analyzing trace with hash 2094550384, now seen corresponding path program 23 times [2018-11-14 19:23:46,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:23:46,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:23:46,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:46,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:23:46,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:46,445 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:23:46,445 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:23:46,445 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 19:23:46,460 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 19:23:46,505 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-11-14 19:23:46,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:23:46,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:23:46,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:23:47,573 INFO L256 TraceCheckUtils]: 0: Hoare triple {4973#true} call ULTIMATE.init(); {4973#true} is VALID [2018-11-14 19:23:47,574 INFO L273 TraceCheckUtils]: 1: Hoare triple {4973#true} ~__return_main~0 := 0;~__return_80~0 := 0; {4973#true} is VALID [2018-11-14 19:23:47,574 INFO L273 TraceCheckUtils]: 2: Hoare triple {4973#true} assume true; {4973#true} is VALID [2018-11-14 19:23:47,574 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4973#true} {4973#true} #28#return; {4973#true} is VALID [2018-11-14 19:23:47,574 INFO L256 TraceCheckUtils]: 4: Hoare triple {4973#true} call #t~ret2 := main(); {4973#true} is VALID [2018-11-14 19:23:47,574 INFO L273 TraceCheckUtils]: 5: Hoare triple {4973#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {4973#true} is VALID [2018-11-14 19:23:47,575 INFO L273 TraceCheckUtils]: 6: Hoare triple {4973#true} assume !!(1 <= ~main__n~0); {4973#true} is VALID [2018-11-14 19:23:47,589 INFO L273 TraceCheckUtils]: 7: Hoare triple {4973#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {4999#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 19:23:47,591 INFO L273 TraceCheckUtils]: 8: Hoare triple {4999#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5003#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 19:23:47,592 INFO L273 TraceCheckUtils]: 9: Hoare triple {5003#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5007#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 19:23:47,592 INFO L273 TraceCheckUtils]: 10: Hoare triple {5007#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5011#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 19:23:47,593 INFO L273 TraceCheckUtils]: 11: Hoare triple {5011#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5015#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 19:23:47,593 INFO L273 TraceCheckUtils]: 12: Hoare triple {5015#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5019#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 19:23:47,594 INFO L273 TraceCheckUtils]: 13: Hoare triple {5019#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5023#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 19:23:47,594 INFO L273 TraceCheckUtils]: 14: Hoare triple {5023#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5027#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 19:23:47,595 INFO L273 TraceCheckUtils]: 15: Hoare triple {5027#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5031#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 19:23:47,596 INFO L273 TraceCheckUtils]: 16: Hoare triple {5031#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5035#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 19:23:47,597 INFO L273 TraceCheckUtils]: 17: Hoare triple {5035#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5039#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 19:23:47,597 INFO L273 TraceCheckUtils]: 18: Hoare triple {5039#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5043#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 19:23:47,598 INFO L273 TraceCheckUtils]: 19: Hoare triple {5043#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5047#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 19:23:47,599 INFO L273 TraceCheckUtils]: 20: Hoare triple {5047#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5051#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 19:23:47,600 INFO L273 TraceCheckUtils]: 21: Hoare triple {5051#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5055#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 19:23:47,601 INFO L273 TraceCheckUtils]: 22: Hoare triple {5055#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5059#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 19:23:47,602 INFO L273 TraceCheckUtils]: 23: Hoare triple {5059#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5063#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 19:23:47,603 INFO L273 TraceCheckUtils]: 24: Hoare triple {5063#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5067#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 19:23:47,604 INFO L273 TraceCheckUtils]: 25: Hoare triple {5067#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5071#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 19:23:47,605 INFO L273 TraceCheckUtils]: 26: Hoare triple {5071#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5075#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 19:23:47,606 INFO L273 TraceCheckUtils]: 27: Hoare triple {5075#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5079#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 19:23:47,607 INFO L273 TraceCheckUtils]: 28: Hoare triple {5079#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5083#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 19:23:47,607 INFO L273 TraceCheckUtils]: 29: Hoare triple {5083#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5087#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-14 19:23:47,608 INFO L273 TraceCheckUtils]: 30: Hoare triple {5087#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5091#(and (<= main_~main__i~0 24) (= main_~main__sum~0 276) (<= 23 main_~main__n~0))} is VALID [2018-11-14 19:23:47,610 INFO L273 TraceCheckUtils]: 31: Hoare triple {5091#(and (<= main_~main__i~0 24) (= main_~main__sum~0 276) (<= 23 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5095#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:23:47,610 INFO L273 TraceCheckUtils]: 32: Hoare triple {5095#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {4974#false} is VALID [2018-11-14 19:23:47,611 INFO L273 TraceCheckUtils]: 33: Hoare triple {4974#false} assume !false; {4974#false} is VALID [2018-11-14 19:23:47,614 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:23:47,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:23:47,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-11-14 19:23:47,635 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 34 [2018-11-14 19:23:47,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:23:47,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-14 19:23:47,669 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:23:47,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-14 19:23:47,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-14 19:23:47,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-11-14 19:23:47,670 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 27 states. [2018-11-14 19:23:49,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:49,620 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-14 19:23:49,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-14 19:23:49,621 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 34 [2018-11-14 19:23:49,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:23:49,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 19:23:49,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2018-11-14 19:23:49,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 19:23:49,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2018-11-14 19:23:49,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 39 transitions. [2018-11-14 19:23:50,092 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 19:23:50,093 INFO L225 Difference]: With dead ends: 39 [2018-11-14 19:23:50,093 INFO L226 Difference]: Without dead ends: 36 [2018-11-14 19:23:50,093 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2018-11-14 19:23:50,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-14 19:23:50,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-14 19:23:50,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:23:50,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2018-11-14 19:23:50,167 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-14 19:23:50,167 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-14 19:23:50,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:50,168 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-14 19:23:50,169 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-14 19:23:50,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:50,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:50,169 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-14 19:23:50,169 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-14 19:23:50,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:50,171 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-14 19:23:50,171 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-14 19:23:50,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:50,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:50,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:23:50,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:23:50,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 19:23:50,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-11-14 19:23:50,173 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-11-14 19:23:50,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:23:50,173 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-11-14 19:23:50,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-14 19:23:50,173 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-14 19:23:50,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-14 19:23:50,174 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:23:50,174 INFO L375 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:23:50,174 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:23:50,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:23:50,175 INFO L82 PathProgramCache]: Analyzing trace with hash 506489991, now seen corresponding path program 24 times [2018-11-14 19:23:50,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:23:50,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:23:50,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:50,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:23:50,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:50,184 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:23:50,184 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:23:50,184 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 19:23:50,204 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 19:23:50,285 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-14 19:23:50,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:23:50,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:23:50,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:23:51,579 INFO L256 TraceCheckUtils]: 0: Hoare triple {5308#true} call ULTIMATE.init(); {5308#true} is VALID [2018-11-14 19:23:51,579 INFO L273 TraceCheckUtils]: 1: Hoare triple {5308#true} ~__return_main~0 := 0;~__return_80~0 := 0; {5308#true} is VALID [2018-11-14 19:23:51,579 INFO L273 TraceCheckUtils]: 2: Hoare triple {5308#true} assume true; {5308#true} is VALID [2018-11-14 19:23:51,579 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5308#true} {5308#true} #28#return; {5308#true} is VALID [2018-11-14 19:23:51,579 INFO L256 TraceCheckUtils]: 4: Hoare triple {5308#true} call #t~ret2 := main(); {5308#true} is VALID [2018-11-14 19:23:51,580 INFO L273 TraceCheckUtils]: 5: Hoare triple {5308#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {5308#true} is VALID [2018-11-14 19:23:51,580 INFO L273 TraceCheckUtils]: 6: Hoare triple {5308#true} assume !!(1 <= ~main__n~0); {5308#true} is VALID [2018-11-14 19:23:51,580 INFO L273 TraceCheckUtils]: 7: Hoare triple {5308#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {5334#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 19:23:51,582 INFO L273 TraceCheckUtils]: 8: Hoare triple {5334#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5338#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 19:23:51,582 INFO L273 TraceCheckUtils]: 9: Hoare triple {5338#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5342#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 19:23:51,584 INFO L273 TraceCheckUtils]: 10: Hoare triple {5342#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5346#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 19:23:51,584 INFO L273 TraceCheckUtils]: 11: Hoare triple {5346#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5350#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 19:23:51,585 INFO L273 TraceCheckUtils]: 12: Hoare triple {5350#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5354#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 19:23:51,586 INFO L273 TraceCheckUtils]: 13: Hoare triple {5354#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5358#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 19:23:51,587 INFO L273 TraceCheckUtils]: 14: Hoare triple {5358#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5362#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 19:23:51,588 INFO L273 TraceCheckUtils]: 15: Hoare triple {5362#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5366#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 19:23:51,589 INFO L273 TraceCheckUtils]: 16: Hoare triple {5366#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5370#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 19:23:51,590 INFO L273 TraceCheckUtils]: 17: Hoare triple {5370#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5374#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 19:23:51,591 INFO L273 TraceCheckUtils]: 18: Hoare triple {5374#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5378#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 19:23:51,592 INFO L273 TraceCheckUtils]: 19: Hoare triple {5378#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5382#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 19:23:51,593 INFO L273 TraceCheckUtils]: 20: Hoare triple {5382#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5386#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 19:23:51,594 INFO L273 TraceCheckUtils]: 21: Hoare triple {5386#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5390#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 19:23:51,595 INFO L273 TraceCheckUtils]: 22: Hoare triple {5390#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5394#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 19:23:51,596 INFO L273 TraceCheckUtils]: 23: Hoare triple {5394#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5398#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 19:23:51,597 INFO L273 TraceCheckUtils]: 24: Hoare triple {5398#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5402#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 19:23:51,598 INFO L273 TraceCheckUtils]: 25: Hoare triple {5402#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5406#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 19:23:51,599 INFO L273 TraceCheckUtils]: 26: Hoare triple {5406#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5410#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 19:23:51,600 INFO L273 TraceCheckUtils]: 27: Hoare triple {5410#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5414#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 19:23:51,601 INFO L273 TraceCheckUtils]: 28: Hoare triple {5414#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5418#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 19:23:51,602 INFO L273 TraceCheckUtils]: 29: Hoare triple {5418#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5422#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-14 19:23:51,603 INFO L273 TraceCheckUtils]: 30: Hoare triple {5422#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5426#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-14 19:23:51,604 INFO L273 TraceCheckUtils]: 31: Hoare triple {5426#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5430#(and (<= 24 main_~main__n~0) (= main_~main__sum~0 300) (<= main_~main__i~0 25))} is VALID [2018-11-14 19:23:51,605 INFO L273 TraceCheckUtils]: 32: Hoare triple {5430#(and (<= 24 main_~main__n~0) (= main_~main__sum~0 300) (<= main_~main__i~0 25))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5434#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:23:51,606 INFO L273 TraceCheckUtils]: 33: Hoare triple {5434#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {5309#false} is VALID [2018-11-14 19:23:51,606 INFO L273 TraceCheckUtils]: 34: Hoare triple {5309#false} assume !false; {5309#false} is VALID [2018-11-14 19:23:51,609 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:23:51,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:23:51,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-11-14 19:23:51,631 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 35 [2018-11-14 19:23:51,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:23:51,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-14 19:23:51,690 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:23:51,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-14 19:23:51,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-14 19:23:51,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-11-14 19:23:51,691 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 28 states. [2018-11-14 19:23:53,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:53,685 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-11-14 19:23:53,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-14 19:23:53,685 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 35 [2018-11-14 19:23:53,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:23:53,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 19:23:53,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-11-14 19:23:53,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 19:23:53,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-11-14 19:23:53,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 40 transitions. [2018-11-14 19:23:54,192 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:23:54,192 INFO L225 Difference]: With dead ends: 40 [2018-11-14 19:23:54,192 INFO L226 Difference]: Without dead ends: 37 [2018-11-14 19:23:54,193 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=57, Invalid=755, Unknown=0, NotChecked=0, Total=812 [2018-11-14 19:23:54,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-14 19:23:54,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-14 19:23:54,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:23:54,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-14 19:23:54,277 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-14 19:23:54,277 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-14 19:23:54,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:54,279 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-11-14 19:23:54,280 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-11-14 19:23:54,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:54,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:54,280 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-14 19:23:54,280 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-14 19:23:54,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:54,282 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-11-14 19:23:54,282 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-11-14 19:23:54,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:54,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:54,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:23:54,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:23:54,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 19:23:54,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-11-14 19:23:54,284 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-11-14 19:23:54,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:23:54,284 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-11-14 19:23:54,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-14 19:23:54,284 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-11-14 19:23:54,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-14 19:23:54,285 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:23:54,285 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:23:54,285 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:23:54,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:23:54,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1478741936, now seen corresponding path program 25 times [2018-11-14 19:23:54,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:23:54,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:23:54,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:54,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:23:54,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:54,295 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:23:54,295 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:23:54,295 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 19:23:54,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:23:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:23:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:23:54,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:23:55,572 INFO L256 TraceCheckUtils]: 0: Hoare triple {5653#true} call ULTIMATE.init(); {5653#true} is VALID [2018-11-14 19:23:55,573 INFO L273 TraceCheckUtils]: 1: Hoare triple {5653#true} ~__return_main~0 := 0;~__return_80~0 := 0; {5653#true} is VALID [2018-11-14 19:23:55,573 INFO L273 TraceCheckUtils]: 2: Hoare triple {5653#true} assume true; {5653#true} is VALID [2018-11-14 19:23:55,573 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5653#true} {5653#true} #28#return; {5653#true} is VALID [2018-11-14 19:23:55,573 INFO L256 TraceCheckUtils]: 4: Hoare triple {5653#true} call #t~ret2 := main(); {5653#true} is VALID [2018-11-14 19:23:55,574 INFO L273 TraceCheckUtils]: 5: Hoare triple {5653#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {5653#true} is VALID [2018-11-14 19:23:55,574 INFO L273 TraceCheckUtils]: 6: Hoare triple {5653#true} assume !!(1 <= ~main__n~0); {5653#true} is VALID [2018-11-14 19:23:55,575 INFO L273 TraceCheckUtils]: 7: Hoare triple {5653#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {5679#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 19:23:55,575 INFO L273 TraceCheckUtils]: 8: Hoare triple {5679#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5683#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 19:23:55,576 INFO L273 TraceCheckUtils]: 9: Hoare triple {5683#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5687#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 19:23:55,576 INFO L273 TraceCheckUtils]: 10: Hoare triple {5687#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5691#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 19:23:55,577 INFO L273 TraceCheckUtils]: 11: Hoare triple {5691#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5695#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 19:23:55,578 INFO L273 TraceCheckUtils]: 12: Hoare triple {5695#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5699#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 19:23:55,579 INFO L273 TraceCheckUtils]: 13: Hoare triple {5699#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5703#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 19:23:55,579 INFO L273 TraceCheckUtils]: 14: Hoare triple {5703#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5707#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 19:23:55,580 INFO L273 TraceCheckUtils]: 15: Hoare triple {5707#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5711#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 19:23:55,581 INFO L273 TraceCheckUtils]: 16: Hoare triple {5711#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5715#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 19:23:55,582 INFO L273 TraceCheckUtils]: 17: Hoare triple {5715#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5719#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 19:23:55,583 INFO L273 TraceCheckUtils]: 18: Hoare triple {5719#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5723#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 19:23:55,584 INFO L273 TraceCheckUtils]: 19: Hoare triple {5723#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5727#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 19:23:55,585 INFO L273 TraceCheckUtils]: 20: Hoare triple {5727#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5731#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 19:23:55,586 INFO L273 TraceCheckUtils]: 21: Hoare triple {5731#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5735#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 19:23:55,587 INFO L273 TraceCheckUtils]: 22: Hoare triple {5735#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5739#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 19:23:55,588 INFO L273 TraceCheckUtils]: 23: Hoare triple {5739#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5743#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 19:23:55,588 INFO L273 TraceCheckUtils]: 24: Hoare triple {5743#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5747#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 19:23:55,589 INFO L273 TraceCheckUtils]: 25: Hoare triple {5747#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5751#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 19:23:55,590 INFO L273 TraceCheckUtils]: 26: Hoare triple {5751#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5755#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 19:23:55,591 INFO L273 TraceCheckUtils]: 27: Hoare triple {5755#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5759#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 19:23:55,592 INFO L273 TraceCheckUtils]: 28: Hoare triple {5759#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5763#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 19:23:55,593 INFO L273 TraceCheckUtils]: 29: Hoare triple {5763#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5767#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-14 19:23:55,594 INFO L273 TraceCheckUtils]: 30: Hoare triple {5767#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5771#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-14 19:23:55,595 INFO L273 TraceCheckUtils]: 31: Hoare triple {5771#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5775#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-14 19:23:55,596 INFO L273 TraceCheckUtils]: 32: Hoare triple {5775#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5779#(and (= main_~main__sum~0 325) (<= main_~main__i~0 26) (<= 25 main_~main__n~0))} is VALID [2018-11-14 19:23:55,597 INFO L273 TraceCheckUtils]: 33: Hoare triple {5779#(and (= main_~main__sum~0 325) (<= main_~main__i~0 26) (<= 25 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5783#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:23:55,598 INFO L273 TraceCheckUtils]: 34: Hoare triple {5783#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {5654#false} is VALID [2018-11-14 19:23:55,598 INFO L273 TraceCheckUtils]: 35: Hoare triple {5654#false} assume !false; {5654#false} is VALID [2018-11-14 19:23:55,601 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:23:55,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:23:55,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-11-14 19:23:55,622 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 36 [2018-11-14 19:23:55,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:23:55,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-14 19:23:55,659 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 19:23:55,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-14 19:23:55,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-14 19:23:55,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-11-14 19:23:55,661 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 29 states. [2018-11-14 19:23:57,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:57,798 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-11-14 19:23:57,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-14 19:23:57,798 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 36 [2018-11-14 19:23:57,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:23:57,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 19:23:57,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2018-11-14 19:23:57,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 19:23:57,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2018-11-14 19:23:57,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 41 transitions. [2018-11-14 19:23:57,839 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:23:57,839 INFO L225 Difference]: With dead ends: 41 [2018-11-14 19:23:57,840 INFO L226 Difference]: Without dead ends: 38 [2018-11-14 19:23:57,840 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=811, Unknown=0, NotChecked=0, Total=870 [2018-11-14 19:23:57,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-14 19:23:57,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-14 19:23:57,930 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:23:57,930 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2018-11-14 19:23:57,930 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-14 19:23:57,930 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-14 19:23:57,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:57,932 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-14 19:23:57,932 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-14 19:23:57,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:57,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:57,932 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-14 19:23:57,932 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-14 19:23:57,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:23:57,933 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-14 19:23:57,933 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-14 19:23:57,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:23:57,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:23:57,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:23:57,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:23:57,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 19:23:57,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-11-14 19:23:57,934 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-11-14 19:23:57,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:23:57,934 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-11-14 19:23:57,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-14 19:23:57,934 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-14 19:23:57,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 19:23:57,935 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:23:57,935 INFO L375 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:23:57,935 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:23:57,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:23:57,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1403577767, now seen corresponding path program 26 times [2018-11-14 19:23:57,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:23:57,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:23:57,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:57,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:23:57,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:23:57,944 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:23:57,944 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:23:57,944 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 19:23:57,960 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 19:23:58,007 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 19:23:58,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:23:58,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:23:58,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:23:58,684 INFO L256 TraceCheckUtils]: 0: Hoare triple {6008#true} call ULTIMATE.init(); {6008#true} is VALID [2018-11-14 19:23:58,684 INFO L273 TraceCheckUtils]: 1: Hoare triple {6008#true} ~__return_main~0 := 0;~__return_80~0 := 0; {6008#true} is VALID [2018-11-14 19:23:58,685 INFO L273 TraceCheckUtils]: 2: Hoare triple {6008#true} assume true; {6008#true} is VALID [2018-11-14 19:23:58,685 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6008#true} {6008#true} #28#return; {6008#true} is VALID [2018-11-14 19:23:58,685 INFO L256 TraceCheckUtils]: 4: Hoare triple {6008#true} call #t~ret2 := main(); {6008#true} is VALID [2018-11-14 19:23:58,685 INFO L273 TraceCheckUtils]: 5: Hoare triple {6008#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {6008#true} is VALID [2018-11-14 19:23:58,686 INFO L273 TraceCheckUtils]: 6: Hoare triple {6008#true} assume !!(1 <= ~main__n~0); {6008#true} is VALID [2018-11-14 19:23:58,686 INFO L273 TraceCheckUtils]: 7: Hoare triple {6008#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {6034#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 19:23:58,687 INFO L273 TraceCheckUtils]: 8: Hoare triple {6034#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6038#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 19:23:58,688 INFO L273 TraceCheckUtils]: 9: Hoare triple {6038#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6042#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 19:23:58,688 INFO L273 TraceCheckUtils]: 10: Hoare triple {6042#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6046#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 19:23:58,689 INFO L273 TraceCheckUtils]: 11: Hoare triple {6046#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6050#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 19:23:58,689 INFO L273 TraceCheckUtils]: 12: Hoare triple {6050#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6054#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 19:23:58,690 INFO L273 TraceCheckUtils]: 13: Hoare triple {6054#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6058#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 19:23:58,690 INFO L273 TraceCheckUtils]: 14: Hoare triple {6058#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6062#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 19:23:58,691 INFO L273 TraceCheckUtils]: 15: Hoare triple {6062#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6066#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 19:23:58,692 INFO L273 TraceCheckUtils]: 16: Hoare triple {6066#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6070#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 19:23:58,693 INFO L273 TraceCheckUtils]: 17: Hoare triple {6070#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6074#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 19:23:58,694 INFO L273 TraceCheckUtils]: 18: Hoare triple {6074#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6078#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 19:23:58,695 INFO L273 TraceCheckUtils]: 19: Hoare triple {6078#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6082#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 19:23:58,696 INFO L273 TraceCheckUtils]: 20: Hoare triple {6082#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6086#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 19:23:58,697 INFO L273 TraceCheckUtils]: 21: Hoare triple {6086#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6090#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 19:23:58,698 INFO L273 TraceCheckUtils]: 22: Hoare triple {6090#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6094#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 19:23:58,699 INFO L273 TraceCheckUtils]: 23: Hoare triple {6094#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6098#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 19:23:58,700 INFO L273 TraceCheckUtils]: 24: Hoare triple {6098#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6102#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 19:23:58,701 INFO L273 TraceCheckUtils]: 25: Hoare triple {6102#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6106#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 19:23:58,702 INFO L273 TraceCheckUtils]: 26: Hoare triple {6106#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6110#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 19:23:58,702 INFO L273 TraceCheckUtils]: 27: Hoare triple {6110#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6114#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 19:23:58,703 INFO L273 TraceCheckUtils]: 28: Hoare triple {6114#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6118#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 19:23:58,704 INFO L273 TraceCheckUtils]: 29: Hoare triple {6118#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6122#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-14 19:23:58,705 INFO L273 TraceCheckUtils]: 30: Hoare triple {6122#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6126#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-14 19:23:58,706 INFO L273 TraceCheckUtils]: 31: Hoare triple {6126#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6130#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-14 19:23:58,707 INFO L273 TraceCheckUtils]: 32: Hoare triple {6130#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6134#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-14 19:23:58,708 INFO L273 TraceCheckUtils]: 33: Hoare triple {6134#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6138#(and (= main_~main__sum~0 351) (<= main_~main__i~0 27) (<= 26 main_~main__n~0))} is VALID [2018-11-14 19:23:58,709 INFO L273 TraceCheckUtils]: 34: Hoare triple {6138#(and (= main_~main__sum~0 351) (<= main_~main__i~0 27) (<= 26 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6142#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:23:58,710 INFO L273 TraceCheckUtils]: 35: Hoare triple {6142#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {6009#false} is VALID [2018-11-14 19:23:58,710 INFO L273 TraceCheckUtils]: 36: Hoare triple {6009#false} assume !false; {6009#false} is VALID [2018-11-14 19:23:58,713 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:23:58,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:23:58,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-11-14 19:23:58,734 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 37 [2018-11-14 19:23:58,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:23:58,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-14 19:23:58,769 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 19:23:58,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-14 19:23:58,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-14 19:23:58,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-11-14 19:23:58,771 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 30 states. [2018-11-14 19:24:00,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:00,914 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-14 19:24:00,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-14 19:24:00,914 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 37 [2018-11-14 19:24:00,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:24:00,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 19:24:00,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2018-11-14 19:24:00,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 19:24:00,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2018-11-14 19:24:00,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 42 transitions. [2018-11-14 19:24:01,315 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 19:24:01,316 INFO L225 Difference]: With dead ends: 42 [2018-11-14 19:24:01,317 INFO L226 Difference]: Without dead ends: 39 [2018-11-14 19:24:01,317 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=869, Unknown=0, NotChecked=0, Total=930 [2018-11-14 19:24:01,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-14 19:24:01,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-14 19:24:01,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:24:01,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2018-11-14 19:24:01,397 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-14 19:24:01,397 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-14 19:24:01,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:01,399 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-14 19:24:01,399 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-14 19:24:01,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:01,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:01,399 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-14 19:24:01,400 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-14 19:24:01,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:01,400 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-14 19:24:01,400 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-14 19:24:01,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:01,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:01,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:24:01,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:24:01,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-14 19:24:01,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-11-14 19:24:01,402 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-11-14 19:24:01,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:24:01,402 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-11-14 19:24:01,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-14 19:24:01,402 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-14 19:24:01,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-14 19:24:01,402 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:24:01,402 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:24:01,403 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:24:01,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:24:01,403 INFO L82 PathProgramCache]: Analyzing trace with hash 561175344, now seen corresponding path program 27 times [2018-11-14 19:24:01,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:24:01,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:24:01,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:01,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:24:01,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:01,411 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:24:01,411 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:24:01,412 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 19:24:01,434 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 19:24:01,737 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-14 19:24:01,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:24:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:24:01,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:24:02,579 INFO L256 TraceCheckUtils]: 0: Hoare triple {6373#true} call ULTIMATE.init(); {6373#true} is VALID [2018-11-14 19:24:02,579 INFO L273 TraceCheckUtils]: 1: Hoare triple {6373#true} ~__return_main~0 := 0;~__return_80~0 := 0; {6373#true} is VALID [2018-11-14 19:24:02,580 INFO L273 TraceCheckUtils]: 2: Hoare triple {6373#true} assume true; {6373#true} is VALID [2018-11-14 19:24:02,580 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6373#true} {6373#true} #28#return; {6373#true} is VALID [2018-11-14 19:24:02,580 INFO L256 TraceCheckUtils]: 4: Hoare triple {6373#true} call #t~ret2 := main(); {6373#true} is VALID [2018-11-14 19:24:02,580 INFO L273 TraceCheckUtils]: 5: Hoare triple {6373#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {6373#true} is VALID [2018-11-14 19:24:02,580 INFO L273 TraceCheckUtils]: 6: Hoare triple {6373#true} assume !!(1 <= ~main__n~0); {6373#true} is VALID [2018-11-14 19:24:02,581 INFO L273 TraceCheckUtils]: 7: Hoare triple {6373#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {6399#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 19:24:02,582 INFO L273 TraceCheckUtils]: 8: Hoare triple {6399#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6403#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 19:24:02,583 INFO L273 TraceCheckUtils]: 9: Hoare triple {6403#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6407#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 19:24:02,583 INFO L273 TraceCheckUtils]: 10: Hoare triple {6407#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6411#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 19:24:02,584 INFO L273 TraceCheckUtils]: 11: Hoare triple {6411#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6415#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 19:24:02,584 INFO L273 TraceCheckUtils]: 12: Hoare triple {6415#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6419#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 19:24:02,605 INFO L273 TraceCheckUtils]: 13: Hoare triple {6419#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6423#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 19:24:02,606 INFO L273 TraceCheckUtils]: 14: Hoare triple {6423#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6427#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 19:24:02,606 INFO L273 TraceCheckUtils]: 15: Hoare triple {6427#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6431#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 19:24:02,607 INFO L273 TraceCheckUtils]: 16: Hoare triple {6431#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6435#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 19:24:02,608 INFO L273 TraceCheckUtils]: 17: Hoare triple {6435#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6439#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 19:24:02,608 INFO L273 TraceCheckUtils]: 18: Hoare triple {6439#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6443#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 19:24:02,609 INFO L273 TraceCheckUtils]: 19: Hoare triple {6443#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6447#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 19:24:02,609 INFO L273 TraceCheckUtils]: 20: Hoare triple {6447#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6451#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 19:24:02,610 INFO L273 TraceCheckUtils]: 21: Hoare triple {6451#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6455#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 19:24:02,611 INFO L273 TraceCheckUtils]: 22: Hoare triple {6455#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6459#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 19:24:02,612 INFO L273 TraceCheckUtils]: 23: Hoare triple {6459#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6463#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 19:24:02,613 INFO L273 TraceCheckUtils]: 24: Hoare triple {6463#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6467#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 19:24:02,614 INFO L273 TraceCheckUtils]: 25: Hoare triple {6467#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6471#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 19:24:02,614 INFO L273 TraceCheckUtils]: 26: Hoare triple {6471#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6475#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 19:24:02,615 INFO L273 TraceCheckUtils]: 27: Hoare triple {6475#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6479#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 19:24:02,616 INFO L273 TraceCheckUtils]: 28: Hoare triple {6479#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6483#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 19:24:02,617 INFO L273 TraceCheckUtils]: 29: Hoare triple {6483#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6487#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-14 19:24:02,618 INFO L273 TraceCheckUtils]: 30: Hoare triple {6487#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6491#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-14 19:24:02,619 INFO L273 TraceCheckUtils]: 31: Hoare triple {6491#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6495#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-14 19:24:02,620 INFO L273 TraceCheckUtils]: 32: Hoare triple {6495#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6499#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-14 19:24:02,621 INFO L273 TraceCheckUtils]: 33: Hoare triple {6499#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6503#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-14 19:24:02,622 INFO L273 TraceCheckUtils]: 34: Hoare triple {6503#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6507#(and (<= 27 main_~main__n~0) (= main_~main__sum~0 378) (<= main_~main__i~0 28))} is VALID [2018-11-14 19:24:02,623 INFO L273 TraceCheckUtils]: 35: Hoare triple {6507#(and (<= 27 main_~main__n~0) (= main_~main__sum~0 378) (<= main_~main__i~0 28))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6511#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:24:02,624 INFO L273 TraceCheckUtils]: 36: Hoare triple {6511#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {6374#false} is VALID [2018-11-14 19:24:02,624 INFO L273 TraceCheckUtils]: 37: Hoare triple {6374#false} assume !false; {6374#false} is VALID [2018-11-14 19:24:02,627 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:24:02,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:24:02,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-11-14 19:24:02,648 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 38 [2018-11-14 19:24:02,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:24:02,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-14 19:24:02,691 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:02,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-14 19:24:02,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-14 19:24:02,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-11-14 19:24:02,693 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 31 states. [2018-11-14 19:24:05,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:05,090 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-11-14 19:24:05,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-14 19:24:05,091 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 38 [2018-11-14 19:24:05,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:24:05,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 19:24:05,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-11-14 19:24:05,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 19:24:05,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-11-14 19:24:05,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 43 transitions. [2018-11-14 19:24:05,132 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:05,133 INFO L225 Difference]: With dead ends: 43 [2018-11-14 19:24:05,133 INFO L226 Difference]: Without dead ends: 40 [2018-11-14 19:24:05,134 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=929, Unknown=0, NotChecked=0, Total=992 [2018-11-14 19:24:05,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-14 19:24:05,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-14 19:24:05,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:24:05,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-14 19:24:05,219 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-14 19:24:05,219 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-14 19:24:05,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:05,220 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-11-14 19:24:05,220 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-11-14 19:24:05,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:05,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:05,221 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-14 19:24:05,222 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-14 19:24:05,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:05,223 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-11-14 19:24:05,223 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-11-14 19:24:05,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:05,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:05,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:24:05,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:24:05,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-14 19:24:05,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-11-14 19:24:05,224 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-11-14 19:24:05,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:24:05,224 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-11-14 19:24:05,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-14 19:24:05,224 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-11-14 19:24:05,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-14 19:24:05,225 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:24:05,225 INFO L375 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:24:05,225 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:24:05,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:24:05,225 INFO L82 PathProgramCache]: Analyzing trace with hash 216504007, now seen corresponding path program 28 times [2018-11-14 19:24:05,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:24:05,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:24:05,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:05,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:24:05,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:05,234 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:24:05,234 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:24:05,234 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 19:24:05,247 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 19:24:05,485 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 19:24:05,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:24:05,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:24:05,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:24:06,268 INFO L256 TraceCheckUtils]: 0: Hoare triple {6748#true} call ULTIMATE.init(); {6748#true} is VALID [2018-11-14 19:24:06,268 INFO L273 TraceCheckUtils]: 1: Hoare triple {6748#true} ~__return_main~0 := 0;~__return_80~0 := 0; {6748#true} is VALID [2018-11-14 19:24:06,269 INFO L273 TraceCheckUtils]: 2: Hoare triple {6748#true} assume true; {6748#true} is VALID [2018-11-14 19:24:06,269 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6748#true} {6748#true} #28#return; {6748#true} is VALID [2018-11-14 19:24:06,269 INFO L256 TraceCheckUtils]: 4: Hoare triple {6748#true} call #t~ret2 := main(); {6748#true} is VALID [2018-11-14 19:24:06,269 INFO L273 TraceCheckUtils]: 5: Hoare triple {6748#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {6748#true} is VALID [2018-11-14 19:24:06,270 INFO L273 TraceCheckUtils]: 6: Hoare triple {6748#true} assume !!(1 <= ~main__n~0); {6748#true} is VALID [2018-11-14 19:24:06,270 INFO L273 TraceCheckUtils]: 7: Hoare triple {6748#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {6774#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 19:24:06,271 INFO L273 TraceCheckUtils]: 8: Hoare triple {6774#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6778#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-14 19:24:06,271 INFO L273 TraceCheckUtils]: 9: Hoare triple {6778#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6782#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 19:24:06,272 INFO L273 TraceCheckUtils]: 10: Hoare triple {6782#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6786#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 19:24:06,273 INFO L273 TraceCheckUtils]: 11: Hoare triple {6786#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6790#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 19:24:06,273 INFO L273 TraceCheckUtils]: 12: Hoare triple {6790#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6794#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 19:24:06,274 INFO L273 TraceCheckUtils]: 13: Hoare triple {6794#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6798#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 19:24:06,275 INFO L273 TraceCheckUtils]: 14: Hoare triple {6798#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6802#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 19:24:06,276 INFO L273 TraceCheckUtils]: 15: Hoare triple {6802#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6806#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 19:24:06,277 INFO L273 TraceCheckUtils]: 16: Hoare triple {6806#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6810#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 19:24:06,278 INFO L273 TraceCheckUtils]: 17: Hoare triple {6810#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6814#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 19:24:06,279 INFO L273 TraceCheckUtils]: 18: Hoare triple {6814#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6818#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 19:24:06,280 INFO L273 TraceCheckUtils]: 19: Hoare triple {6818#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6822#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 19:24:06,281 INFO L273 TraceCheckUtils]: 20: Hoare triple {6822#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6826#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 19:24:06,281 INFO L273 TraceCheckUtils]: 21: Hoare triple {6826#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6830#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 19:24:06,282 INFO L273 TraceCheckUtils]: 22: Hoare triple {6830#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6834#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 19:24:06,283 INFO L273 TraceCheckUtils]: 23: Hoare triple {6834#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6838#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 19:24:06,284 INFO L273 TraceCheckUtils]: 24: Hoare triple {6838#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6842#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 19:24:06,285 INFO L273 TraceCheckUtils]: 25: Hoare triple {6842#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6846#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 19:24:06,286 INFO L273 TraceCheckUtils]: 26: Hoare triple {6846#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6850#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 19:24:06,287 INFO L273 TraceCheckUtils]: 27: Hoare triple {6850#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6854#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 19:24:06,288 INFO L273 TraceCheckUtils]: 28: Hoare triple {6854#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6858#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 19:24:06,289 INFO L273 TraceCheckUtils]: 29: Hoare triple {6858#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6862#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-14 19:24:06,289 INFO L273 TraceCheckUtils]: 30: Hoare triple {6862#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6866#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-14 19:24:06,290 INFO L273 TraceCheckUtils]: 31: Hoare triple {6866#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6870#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-14 19:24:06,291 INFO L273 TraceCheckUtils]: 32: Hoare triple {6870#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6874#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-14 19:24:06,292 INFO L273 TraceCheckUtils]: 33: Hoare triple {6874#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6878#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-14 19:24:06,293 INFO L273 TraceCheckUtils]: 34: Hoare triple {6878#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6882#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-14 19:24:06,294 INFO L273 TraceCheckUtils]: 35: Hoare triple {6882#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6886#(and (<= 28 main_~main__n~0) (<= main_~main__i~0 29) (= main_~main__sum~0 406))} is VALID [2018-11-14 19:24:06,295 INFO L273 TraceCheckUtils]: 36: Hoare triple {6886#(and (<= 28 main_~main__n~0) (<= main_~main__i~0 29) (= main_~main__sum~0 406))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6890#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:24:06,296 INFO L273 TraceCheckUtils]: 37: Hoare triple {6890#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {6749#false} is VALID [2018-11-14 19:24:06,296 INFO L273 TraceCheckUtils]: 38: Hoare triple {6749#false} assume !false; {6749#false} is VALID [2018-11-14 19:24:06,299 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:24:06,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:24:06,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-11-14 19:24:06,319 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 39 [2018-11-14 19:24:06,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:24:06,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-14 19:24:06,366 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 19:24:06,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-14 19:24:06,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-14 19:24:06,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-11-14 19:24:06,368 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 32 states. [2018-11-14 19:24:08,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:08,902 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-11-14 19:24:08,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-14 19:24:08,902 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 39 [2018-11-14 19:24:08,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:24:08,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 19:24:08,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2018-11-14 19:24:08,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 19:24:08,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2018-11-14 19:24:08,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 44 transitions. [2018-11-14 19:24:08,971 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:08,972 INFO L225 Difference]: With dead ends: 44 [2018-11-14 19:24:08,972 INFO L226 Difference]: Without dead ends: 41 [2018-11-14 19:24:08,972 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=991, Unknown=0, NotChecked=0, Total=1056 [2018-11-14 19:24:08,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-14 19:24:09,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-14 19:24:09,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:24:09,057 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 41 states. [2018-11-14 19:24:09,057 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-14 19:24:09,057 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-14 19:24:09,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:09,058 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-11-14 19:24:09,058 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-11-14 19:24:09,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:09,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:09,059 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-14 19:24:09,059 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-14 19:24:09,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:09,060 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-11-14 19:24:09,060 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-11-14 19:24:09,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:09,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:09,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:24:09,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:24:09,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 19:24:09,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-11-14 19:24:09,062 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-11-14 19:24:09,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:24:09,062 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-11-14 19:24:09,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-14 19:24:09,062 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-11-14 19:24:09,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-14 19:24:09,063 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:24:09,063 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:24:09,063 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:24:09,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:24:09,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1878372848, now seen corresponding path program 29 times [2018-11-14 19:24:09,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:24:09,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:24:09,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:09,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:24:09,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:09,071 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:24:09,072 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:24:09,072 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 19:24:09,091 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 19:24:09,143 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-11-14 19:24:09,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:24:09,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:24:09,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:24:09,957 INFO L256 TraceCheckUtils]: 0: Hoare triple {7133#true} call ULTIMATE.init(); {7133#true} is VALID [2018-11-14 19:24:09,957 INFO L273 TraceCheckUtils]: 1: Hoare triple {7133#true} ~__return_main~0 := 0;~__return_80~0 := 0; {7133#true} is VALID [2018-11-14 19:24:09,957 INFO L273 TraceCheckUtils]: 2: Hoare triple {7133#true} assume true; {7133#true} is VALID [2018-11-14 19:24:09,957 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7133#true} {7133#true} #28#return; {7133#true} is VALID [2018-11-14 19:24:09,957 INFO L256 TraceCheckUtils]: 4: Hoare triple {7133#true} call #t~ret2 := main(); {7133#true} is VALID [2018-11-14 19:24:09,957 INFO L273 TraceCheckUtils]: 5: Hoare triple {7133#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {7133#true} is VALID [2018-11-14 19:24:09,958 INFO L273 TraceCheckUtils]: 6: Hoare triple {7133#true} assume !!(1 <= ~main__n~0); {7133#true} is VALID [2018-11-14 19:24:09,958 INFO L273 TraceCheckUtils]: 7: Hoare triple {7133#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {7159#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 19:24:09,959 INFO L273 TraceCheckUtils]: 8: Hoare triple {7159#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7163#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 19:24:09,959 INFO L273 TraceCheckUtils]: 9: Hoare triple {7163#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7167#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 19:24:09,960 INFO L273 TraceCheckUtils]: 10: Hoare triple {7167#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7171#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 19:24:09,961 INFO L273 TraceCheckUtils]: 11: Hoare triple {7171#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7175#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 19:24:09,962 INFO L273 TraceCheckUtils]: 12: Hoare triple {7175#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7179#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 19:24:09,963 INFO L273 TraceCheckUtils]: 13: Hoare triple {7179#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7183#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 19:24:09,963 INFO L273 TraceCheckUtils]: 14: Hoare triple {7183#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7187#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 19:24:09,964 INFO L273 TraceCheckUtils]: 15: Hoare triple {7187#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7191#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 19:24:09,965 INFO L273 TraceCheckUtils]: 16: Hoare triple {7191#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7195#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 19:24:09,966 INFO L273 TraceCheckUtils]: 17: Hoare triple {7195#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7199#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 19:24:09,967 INFO L273 TraceCheckUtils]: 18: Hoare triple {7199#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7203#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 19:24:09,968 INFO L273 TraceCheckUtils]: 19: Hoare triple {7203#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7207#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 19:24:09,969 INFO L273 TraceCheckUtils]: 20: Hoare triple {7207#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7211#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 19:24:09,970 INFO L273 TraceCheckUtils]: 21: Hoare triple {7211#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7215#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 19:24:09,971 INFO L273 TraceCheckUtils]: 22: Hoare triple {7215#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7219#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 19:24:09,972 INFO L273 TraceCheckUtils]: 23: Hoare triple {7219#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7223#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 19:24:09,973 INFO L273 TraceCheckUtils]: 24: Hoare triple {7223#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7227#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 19:24:09,973 INFO L273 TraceCheckUtils]: 25: Hoare triple {7227#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7231#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 19:24:09,974 INFO L273 TraceCheckUtils]: 26: Hoare triple {7231#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7235#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 19:24:09,975 INFO L273 TraceCheckUtils]: 27: Hoare triple {7235#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7239#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 19:24:09,976 INFO L273 TraceCheckUtils]: 28: Hoare triple {7239#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7243#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 19:24:09,977 INFO L273 TraceCheckUtils]: 29: Hoare triple {7243#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7247#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-14 19:24:09,978 INFO L273 TraceCheckUtils]: 30: Hoare triple {7247#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7251#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-14 19:24:09,979 INFO L273 TraceCheckUtils]: 31: Hoare triple {7251#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7255#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-14 19:24:09,980 INFO L273 TraceCheckUtils]: 32: Hoare triple {7255#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7259#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-14 19:24:09,980 INFO L273 TraceCheckUtils]: 33: Hoare triple {7259#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7263#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-14 19:24:09,981 INFO L273 TraceCheckUtils]: 34: Hoare triple {7263#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7267#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-14 19:24:09,982 INFO L273 TraceCheckUtils]: 35: Hoare triple {7267#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7271#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-14 19:24:09,983 INFO L273 TraceCheckUtils]: 36: Hoare triple {7271#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7275#(and (= main_~main__sum~0 435) (<= main_~main__i~0 30) (<= 29 main_~main__n~0))} is VALID [2018-11-14 19:24:09,985 INFO L273 TraceCheckUtils]: 37: Hoare triple {7275#(and (= main_~main__sum~0 435) (<= main_~main__i~0 30) (<= 29 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7279#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:24:09,985 INFO L273 TraceCheckUtils]: 38: Hoare triple {7279#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {7134#false} is VALID [2018-11-14 19:24:09,986 INFO L273 TraceCheckUtils]: 39: Hoare triple {7134#false} assume !false; {7134#false} is VALID [2018-11-14 19:24:09,989 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:24:10,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:24:10,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-11-14 19:24:10,010 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 40 [2018-11-14 19:24:10,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:24:10,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-14 19:24:10,047 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:10,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-14 19:24:10,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-14 19:24:10,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-11-14 19:24:10,048 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 33 states. [2018-11-14 19:24:12,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:12,744 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-14 19:24:12,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-14 19:24:12,745 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 40 [2018-11-14 19:24:12,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:24:12,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 19:24:12,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2018-11-14 19:24:12,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 19:24:12,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2018-11-14 19:24:12,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 45 transitions. [2018-11-14 19:24:12,823 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 19:24:12,824 INFO L225 Difference]: With dead ends: 45 [2018-11-14 19:24:12,824 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 19:24:12,825 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=1055, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 19:24:12,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 19:24:12,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-14 19:24:12,905 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:24:12,905 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-14 19:24:12,905 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-14 19:24:12,906 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-14 19:24:12,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:12,907 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-14 19:24:12,907 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-14 19:24:12,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:12,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:12,908 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-14 19:24:12,908 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-14 19:24:12,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:12,908 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-14 19:24:12,908 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-14 19:24:12,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:12,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:12,909 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:24:12,909 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:24:12,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 19:24:12,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-11-14 19:24:12,910 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-11-14 19:24:12,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:24:12,910 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-11-14 19:24:12,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-14 19:24:12,910 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-14 19:24:12,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-14 19:24:12,910 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:24:12,910 INFO L375 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:24:12,911 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:24:12,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:24:12,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1899921383, now seen corresponding path program 30 times [2018-11-14 19:24:12,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:24:12,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:24:12,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:12,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:24:12,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:12,919 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:24:12,919 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:24:12,919 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 19:24:12,929 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 19:24:13,067 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-11-14 19:24:13,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:24:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:24:13,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:24:13,937 INFO L256 TraceCheckUtils]: 0: Hoare triple {7528#true} call ULTIMATE.init(); {7528#true} is VALID [2018-11-14 19:24:13,938 INFO L273 TraceCheckUtils]: 1: Hoare triple {7528#true} ~__return_main~0 := 0;~__return_80~0 := 0; {7528#true} is VALID [2018-11-14 19:24:13,938 INFO L273 TraceCheckUtils]: 2: Hoare triple {7528#true} assume true; {7528#true} is VALID [2018-11-14 19:24:13,938 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7528#true} {7528#true} #28#return; {7528#true} is VALID [2018-11-14 19:24:13,938 INFO L256 TraceCheckUtils]: 4: Hoare triple {7528#true} call #t~ret2 := main(); {7528#true} is VALID [2018-11-14 19:24:13,938 INFO L273 TraceCheckUtils]: 5: Hoare triple {7528#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {7528#true} is VALID [2018-11-14 19:24:13,938 INFO L273 TraceCheckUtils]: 6: Hoare triple {7528#true} assume !!(1 <= ~main__n~0); {7528#true} is VALID [2018-11-14 19:24:13,939 INFO L273 TraceCheckUtils]: 7: Hoare triple {7528#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {7554#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 19:24:13,940 INFO L273 TraceCheckUtils]: 8: Hoare triple {7554#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7558#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 19:24:13,941 INFO L273 TraceCheckUtils]: 9: Hoare triple {7558#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7562#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 19:24:13,942 INFO L273 TraceCheckUtils]: 10: Hoare triple {7562#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7566#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 19:24:13,943 INFO L273 TraceCheckUtils]: 11: Hoare triple {7566#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7570#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 19:24:13,943 INFO L273 TraceCheckUtils]: 12: Hoare triple {7570#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7574#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 19:24:13,964 INFO L273 TraceCheckUtils]: 13: Hoare triple {7574#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7578#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 19:24:13,978 INFO L273 TraceCheckUtils]: 14: Hoare triple {7578#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7582#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 19:24:13,994 INFO L273 TraceCheckUtils]: 15: Hoare triple {7582#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7586#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 19:24:14,009 INFO L273 TraceCheckUtils]: 16: Hoare triple {7586#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7590#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 19:24:14,018 INFO L273 TraceCheckUtils]: 17: Hoare triple {7590#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7594#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 19:24:14,028 INFO L273 TraceCheckUtils]: 18: Hoare triple {7594#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7598#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 19:24:14,043 INFO L273 TraceCheckUtils]: 19: Hoare triple {7598#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7602#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 19:24:14,055 INFO L273 TraceCheckUtils]: 20: Hoare triple {7602#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7606#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 19:24:14,056 INFO L273 TraceCheckUtils]: 21: Hoare triple {7606#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7610#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 19:24:14,061 INFO L273 TraceCheckUtils]: 22: Hoare triple {7610#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7614#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 19:24:14,061 INFO L273 TraceCheckUtils]: 23: Hoare triple {7614#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7618#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 19:24:14,062 INFO L273 TraceCheckUtils]: 24: Hoare triple {7618#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7622#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 19:24:14,063 INFO L273 TraceCheckUtils]: 25: Hoare triple {7622#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7626#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 19:24:14,063 INFO L273 TraceCheckUtils]: 26: Hoare triple {7626#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7630#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 19:24:14,064 INFO L273 TraceCheckUtils]: 27: Hoare triple {7630#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7634#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 19:24:14,064 INFO L273 TraceCheckUtils]: 28: Hoare triple {7634#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7638#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 19:24:14,065 INFO L273 TraceCheckUtils]: 29: Hoare triple {7638#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7642#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-14 19:24:14,065 INFO L273 TraceCheckUtils]: 30: Hoare triple {7642#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7646#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-14 19:24:14,066 INFO L273 TraceCheckUtils]: 31: Hoare triple {7646#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7650#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-14 19:24:14,067 INFO L273 TraceCheckUtils]: 32: Hoare triple {7650#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7654#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-14 19:24:14,068 INFO L273 TraceCheckUtils]: 33: Hoare triple {7654#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7658#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-14 19:24:14,069 INFO L273 TraceCheckUtils]: 34: Hoare triple {7658#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7662#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-14 19:24:14,070 INFO L273 TraceCheckUtils]: 35: Hoare triple {7662#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7666#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-14 19:24:14,071 INFO L273 TraceCheckUtils]: 36: Hoare triple {7666#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7670#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-14 19:24:14,072 INFO L273 TraceCheckUtils]: 37: Hoare triple {7670#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7674#(and (<= main_~main__i~0 31) (= main_~main__sum~0 465) (<= 30 main_~main__n~0))} is VALID [2018-11-14 19:24:14,073 INFO L273 TraceCheckUtils]: 38: Hoare triple {7674#(and (<= main_~main__i~0 31) (= main_~main__sum~0 465) (<= 30 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7678#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:24:14,074 INFO L273 TraceCheckUtils]: 39: Hoare triple {7678#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {7529#false} is VALID [2018-11-14 19:24:14,074 INFO L273 TraceCheckUtils]: 40: Hoare triple {7529#false} assume !false; {7529#false} is VALID [2018-11-14 19:24:14,078 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:24:14,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:24:14,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-11-14 19:24:14,098 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 41 [2018-11-14 19:24:14,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:24:14,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-14 19:24:14,156 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:14,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-14 19:24:14,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-14 19:24:14,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 19:24:14,158 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 34 states. [2018-11-14 19:24:16,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:16,974 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-14 19:24:16,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-14 19:24:16,975 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 41 [2018-11-14 19:24:16,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:24:16,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 19:24:16,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2018-11-14 19:24:16,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 19:24:16,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2018-11-14 19:24:16,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 46 transitions. [2018-11-14 19:24:17,040 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:17,040 INFO L225 Difference]: With dead ends: 46 [2018-11-14 19:24:17,041 INFO L226 Difference]: Without dead ends: 43 [2018-11-14 19:24:17,041 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=1121, Unknown=0, NotChecked=0, Total=1190 [2018-11-14 19:24:17,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-14 19:24:17,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-14 19:24:17,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:24:17,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2018-11-14 19:24:17,254 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-14 19:24:17,254 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-14 19:24:17,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:17,255 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-11-14 19:24:17,256 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-11-14 19:24:17,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:17,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:17,256 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-14 19:24:17,256 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-14 19:24:17,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:17,257 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-11-14 19:24:17,257 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-11-14 19:24:17,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:17,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:17,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:24:17,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:24:17,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-14 19:24:17,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-11-14 19:24:17,258 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-11-14 19:24:17,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:24:17,259 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-11-14 19:24:17,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-14 19:24:17,259 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-11-14 19:24:17,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-14 19:24:17,259 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:24:17,259 INFO L375 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:24:17,260 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:24:17,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:24:17,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1232041744, now seen corresponding path program 31 times [2018-11-14 19:24:17,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:24:17,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:24:17,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:17,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:24:17,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:17,269 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:24:17,269 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:24:17,269 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 19:24:17,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:24:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:24:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:24:17,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:24:18,363 INFO L256 TraceCheckUtils]: 0: Hoare triple {7933#true} call ULTIMATE.init(); {7933#true} is VALID [2018-11-14 19:24:18,364 INFO L273 TraceCheckUtils]: 1: Hoare triple {7933#true} ~__return_main~0 := 0;~__return_80~0 := 0; {7933#true} is VALID [2018-11-14 19:24:18,364 INFO L273 TraceCheckUtils]: 2: Hoare triple {7933#true} assume true; {7933#true} is VALID [2018-11-14 19:24:18,364 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7933#true} {7933#true} #28#return; {7933#true} is VALID [2018-11-14 19:24:18,364 INFO L256 TraceCheckUtils]: 4: Hoare triple {7933#true} call #t~ret2 := main(); {7933#true} is VALID [2018-11-14 19:24:18,365 INFO L273 TraceCheckUtils]: 5: Hoare triple {7933#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {7933#true} is VALID [2018-11-14 19:24:18,365 INFO L273 TraceCheckUtils]: 6: Hoare triple {7933#true} assume !!(1 <= ~main__n~0); {7933#true} is VALID [2018-11-14 19:24:18,365 INFO L273 TraceCheckUtils]: 7: Hoare triple {7933#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {7959#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 19:24:18,366 INFO L273 TraceCheckUtils]: 8: Hoare triple {7959#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7963#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-14 19:24:18,367 INFO L273 TraceCheckUtils]: 9: Hoare triple {7963#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7967#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 19:24:18,367 INFO L273 TraceCheckUtils]: 10: Hoare triple {7967#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7971#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 19:24:18,367 INFO L273 TraceCheckUtils]: 11: Hoare triple {7971#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7975#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 19:24:18,368 INFO L273 TraceCheckUtils]: 12: Hoare triple {7975#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7979#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 19:24:18,369 INFO L273 TraceCheckUtils]: 13: Hoare triple {7979#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7983#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 19:24:18,369 INFO L273 TraceCheckUtils]: 14: Hoare triple {7983#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7987#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 19:24:18,370 INFO L273 TraceCheckUtils]: 15: Hoare triple {7987#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7991#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 19:24:18,370 INFO L273 TraceCheckUtils]: 16: Hoare triple {7991#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7995#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 19:24:18,371 INFO L273 TraceCheckUtils]: 17: Hoare triple {7995#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7999#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 19:24:18,372 INFO L273 TraceCheckUtils]: 18: Hoare triple {7999#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8003#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 19:24:18,373 INFO L273 TraceCheckUtils]: 19: Hoare triple {8003#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8007#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 19:24:18,374 INFO L273 TraceCheckUtils]: 20: Hoare triple {8007#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8011#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 19:24:18,375 INFO L273 TraceCheckUtils]: 21: Hoare triple {8011#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8015#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 19:24:18,376 INFO L273 TraceCheckUtils]: 22: Hoare triple {8015#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8019#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 19:24:18,377 INFO L273 TraceCheckUtils]: 23: Hoare triple {8019#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8023#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 19:24:18,378 INFO L273 TraceCheckUtils]: 24: Hoare triple {8023#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8027#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 19:24:18,378 INFO L273 TraceCheckUtils]: 25: Hoare triple {8027#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8031#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 19:24:18,379 INFO L273 TraceCheckUtils]: 26: Hoare triple {8031#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8035#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 19:24:18,380 INFO L273 TraceCheckUtils]: 27: Hoare triple {8035#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8039#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 19:24:18,381 INFO L273 TraceCheckUtils]: 28: Hoare triple {8039#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8043#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 19:24:18,382 INFO L273 TraceCheckUtils]: 29: Hoare triple {8043#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8047#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-14 19:24:18,383 INFO L273 TraceCheckUtils]: 30: Hoare triple {8047#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8051#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-14 19:24:18,384 INFO L273 TraceCheckUtils]: 31: Hoare triple {8051#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8055#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-14 19:24:18,385 INFO L273 TraceCheckUtils]: 32: Hoare triple {8055#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8059#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-14 19:24:18,385 INFO L273 TraceCheckUtils]: 33: Hoare triple {8059#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8063#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-14 19:24:18,386 INFO L273 TraceCheckUtils]: 34: Hoare triple {8063#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8067#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-14 19:24:18,387 INFO L273 TraceCheckUtils]: 35: Hoare triple {8067#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8071#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-14 19:24:18,388 INFO L273 TraceCheckUtils]: 36: Hoare triple {8071#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8075#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-14 19:24:18,389 INFO L273 TraceCheckUtils]: 37: Hoare triple {8075#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8079#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-14 19:24:18,390 INFO L273 TraceCheckUtils]: 38: Hoare triple {8079#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8083#(and (<= 31 main_~main__n~0) (= main_~main__sum~0 496) (<= main_~main__i~0 32))} is VALID [2018-11-14 19:24:18,391 INFO L273 TraceCheckUtils]: 39: Hoare triple {8083#(and (<= 31 main_~main__n~0) (= main_~main__sum~0 496) (<= main_~main__i~0 32))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8087#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:24:18,392 INFO L273 TraceCheckUtils]: 40: Hoare triple {8087#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {7934#false} is VALID [2018-11-14 19:24:18,392 INFO L273 TraceCheckUtils]: 41: Hoare triple {7934#false} assume !false; {7934#false} is VALID [2018-11-14 19:24:18,396 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:24:18,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:24:18,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-11-14 19:24:18,417 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 42 [2018-11-14 19:24:18,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:24:18,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-14 19:24:18,461 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 19:24:18,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-14 19:24:18,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-14 19:24:18,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-11-14 19:24:18,463 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 35 states. [2018-11-14 19:24:21,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:21,418 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-11-14 19:24:21,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-14 19:24:21,419 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 42 [2018-11-14 19:24:21,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:24:21,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 19:24:21,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2018-11-14 19:24:21,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 19:24:21,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2018-11-14 19:24:21,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 47 transitions. [2018-11-14 19:24:21,526 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:21,527 INFO L225 Difference]: With dead ends: 47 [2018-11-14 19:24:21,527 INFO L226 Difference]: Without dead ends: 44 [2018-11-14 19:24:21,528 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=1189, Unknown=0, NotChecked=0, Total=1260 [2018-11-14 19:24:21,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-14 19:24:21,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-14 19:24:21,614 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:24:21,615 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2018-11-14 19:24:21,615 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-14 19:24:21,615 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-14 19:24:21,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:21,616 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-11-14 19:24:21,617 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-14 19:24:21,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:21,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:21,617 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-14 19:24:21,617 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-14 19:24:21,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:21,618 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-11-14 19:24:21,618 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-14 19:24:21,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:21,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:21,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:24:21,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:24:21,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 19:24:21,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-11-14 19:24:21,620 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-11-14 19:24:21,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:24:21,620 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-11-14 19:24:21,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-14 19:24:21,620 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-14 19:24:21,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-14 19:24:21,621 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:24:21,621 INFO L375 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:24:21,621 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:24:21,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:24:21,621 INFO L82 PathProgramCache]: Analyzing trace with hash 461349127, now seen corresponding path program 32 times [2018-11-14 19:24:21,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:24:21,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:24:21,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:21,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:24:21,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:21,630 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:24:21,630 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:24:21,630 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 19:24:21,640 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 19:24:21,690 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 19:24:21,690 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:24:21,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:24:21,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:24:22,875 INFO L256 TraceCheckUtils]: 0: Hoare triple {8348#true} call ULTIMATE.init(); {8348#true} is VALID [2018-11-14 19:24:22,875 INFO L273 TraceCheckUtils]: 1: Hoare triple {8348#true} ~__return_main~0 := 0;~__return_80~0 := 0; {8348#true} is VALID [2018-11-14 19:24:22,876 INFO L273 TraceCheckUtils]: 2: Hoare triple {8348#true} assume true; {8348#true} is VALID [2018-11-14 19:24:22,876 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8348#true} {8348#true} #28#return; {8348#true} is VALID [2018-11-14 19:24:22,876 INFO L256 TraceCheckUtils]: 4: Hoare triple {8348#true} call #t~ret2 := main(); {8348#true} is VALID [2018-11-14 19:24:22,876 INFO L273 TraceCheckUtils]: 5: Hoare triple {8348#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {8348#true} is VALID [2018-11-14 19:24:22,876 INFO L273 TraceCheckUtils]: 6: Hoare triple {8348#true} assume !!(1 <= ~main__n~0); {8348#true} is VALID [2018-11-14 19:24:22,877 INFO L273 TraceCheckUtils]: 7: Hoare triple {8348#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {8374#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 19:24:22,877 INFO L273 TraceCheckUtils]: 8: Hoare triple {8374#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8378#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-14 19:24:22,878 INFO L273 TraceCheckUtils]: 9: Hoare triple {8378#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8382#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 19:24:22,879 INFO L273 TraceCheckUtils]: 10: Hoare triple {8382#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8386#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 19:24:22,879 INFO L273 TraceCheckUtils]: 11: Hoare triple {8386#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8390#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 19:24:22,880 INFO L273 TraceCheckUtils]: 12: Hoare triple {8390#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8394#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 19:24:22,880 INFO L273 TraceCheckUtils]: 13: Hoare triple {8394#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8398#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 19:24:22,881 INFO L273 TraceCheckUtils]: 14: Hoare triple {8398#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8402#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 19:24:22,882 INFO L273 TraceCheckUtils]: 15: Hoare triple {8402#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8406#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 19:24:22,883 INFO L273 TraceCheckUtils]: 16: Hoare triple {8406#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8410#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 19:24:22,884 INFO L273 TraceCheckUtils]: 17: Hoare triple {8410#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8414#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 19:24:22,884 INFO L273 TraceCheckUtils]: 18: Hoare triple {8414#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8418#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 19:24:22,885 INFO L273 TraceCheckUtils]: 19: Hoare triple {8418#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8422#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 19:24:22,886 INFO L273 TraceCheckUtils]: 20: Hoare triple {8422#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8426#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 19:24:22,887 INFO L273 TraceCheckUtils]: 21: Hoare triple {8426#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8430#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 19:24:22,888 INFO L273 TraceCheckUtils]: 22: Hoare triple {8430#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8434#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 19:24:22,889 INFO L273 TraceCheckUtils]: 23: Hoare triple {8434#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8438#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 19:24:22,890 INFO L273 TraceCheckUtils]: 24: Hoare triple {8438#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8442#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 19:24:22,891 INFO L273 TraceCheckUtils]: 25: Hoare triple {8442#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8446#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 19:24:22,892 INFO L273 TraceCheckUtils]: 26: Hoare triple {8446#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8450#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 19:24:22,892 INFO L273 TraceCheckUtils]: 27: Hoare triple {8450#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8454#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 19:24:22,893 INFO L273 TraceCheckUtils]: 28: Hoare triple {8454#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8458#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 19:24:22,894 INFO L273 TraceCheckUtils]: 29: Hoare triple {8458#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8462#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-14 19:24:22,895 INFO L273 TraceCheckUtils]: 30: Hoare triple {8462#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8466#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-14 19:24:22,896 INFO L273 TraceCheckUtils]: 31: Hoare triple {8466#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8470#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-14 19:24:22,897 INFO L273 TraceCheckUtils]: 32: Hoare triple {8470#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8474#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-14 19:24:22,898 INFO L273 TraceCheckUtils]: 33: Hoare triple {8474#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8478#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-14 19:24:22,899 INFO L273 TraceCheckUtils]: 34: Hoare triple {8478#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8482#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-14 19:24:22,899 INFO L273 TraceCheckUtils]: 35: Hoare triple {8482#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8486#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-14 19:24:22,900 INFO L273 TraceCheckUtils]: 36: Hoare triple {8486#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8490#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-14 19:24:22,901 INFO L273 TraceCheckUtils]: 37: Hoare triple {8490#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8494#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-14 19:24:22,902 INFO L273 TraceCheckUtils]: 38: Hoare triple {8494#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8498#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-14 19:24:22,903 INFO L273 TraceCheckUtils]: 39: Hoare triple {8498#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8502#(and (<= 32 main_~main__n~0) (<= main_~main__i~0 33) (= main_~main__sum~0 528))} is VALID [2018-11-14 19:24:22,904 INFO L273 TraceCheckUtils]: 40: Hoare triple {8502#(and (<= 32 main_~main__n~0) (<= main_~main__i~0 33) (= main_~main__sum~0 528))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8506#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:24:22,905 INFO L273 TraceCheckUtils]: 41: Hoare triple {8506#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {8349#false} is VALID [2018-11-14 19:24:22,905 INFO L273 TraceCheckUtils]: 42: Hoare triple {8349#false} assume !false; {8349#false} is VALID [2018-11-14 19:24:22,909 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:24:22,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:24:22,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-11-14 19:24:22,930 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 43 [2018-11-14 19:24:22,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:24:22,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-14 19:24:22,985 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:22,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-14 19:24:22,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-14 19:24:22,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-11-14 19:24:22,987 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 36 states. [2018-11-14 19:24:26,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:26,100 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-11-14 19:24:26,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-14 19:24:26,100 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 43 [2018-11-14 19:24:26,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:24:26,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 19:24:26,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2018-11-14 19:24:26,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 19:24:26,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2018-11-14 19:24:26,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 48 transitions. [2018-11-14 19:24:26,147 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 19:24:26,147 INFO L225 Difference]: With dead ends: 48 [2018-11-14 19:24:26,148 INFO L226 Difference]: Without dead ends: 45 [2018-11-14 19:24:26,149 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=73, Invalid=1259, Unknown=0, NotChecked=0, Total=1332 [2018-11-14 19:24:26,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-14 19:24:26,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-14 19:24:26,244 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:24:26,244 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 45 states. [2018-11-14 19:24:26,244 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2018-11-14 19:24:26,245 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2018-11-14 19:24:26,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:26,246 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-14 19:24:26,246 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-11-14 19:24:26,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:26,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:26,247 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2018-11-14 19:24:26,247 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2018-11-14 19:24:26,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:26,247 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-14 19:24:26,248 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-11-14 19:24:26,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:26,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:26,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:24:26,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:24:26,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-14 19:24:26,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-11-14 19:24:26,249 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-11-14 19:24:26,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:24:26,249 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-11-14 19:24:26,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-14 19:24:26,249 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-11-14 19:24:26,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-14 19:24:26,250 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:24:26,250 INFO L375 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:24:26,250 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:24:26,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:24:26,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1416858576, now seen corresponding path program 33 times [2018-11-14 19:24:26,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:24:26,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:24:26,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:26,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:24:26,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:26,259 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:24:26,259 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:24:26,259 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 19:24:26,277 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 19:24:27,333 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-14 19:24:27,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:24:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:24:27,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:24:28,526 INFO L256 TraceCheckUtils]: 0: Hoare triple {8773#true} call ULTIMATE.init(); {8773#true} is VALID [2018-11-14 19:24:28,526 INFO L273 TraceCheckUtils]: 1: Hoare triple {8773#true} ~__return_main~0 := 0;~__return_80~0 := 0; {8773#true} is VALID [2018-11-14 19:24:28,527 INFO L273 TraceCheckUtils]: 2: Hoare triple {8773#true} assume true; {8773#true} is VALID [2018-11-14 19:24:28,527 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8773#true} {8773#true} #28#return; {8773#true} is VALID [2018-11-14 19:24:28,527 INFO L256 TraceCheckUtils]: 4: Hoare triple {8773#true} call #t~ret2 := main(); {8773#true} is VALID [2018-11-14 19:24:28,527 INFO L273 TraceCheckUtils]: 5: Hoare triple {8773#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {8773#true} is VALID [2018-11-14 19:24:28,528 INFO L273 TraceCheckUtils]: 6: Hoare triple {8773#true} assume !!(1 <= ~main__n~0); {8773#true} is VALID [2018-11-14 19:24:28,528 INFO L273 TraceCheckUtils]: 7: Hoare triple {8773#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {8799#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 19:24:28,529 INFO L273 TraceCheckUtils]: 8: Hoare triple {8799#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8803#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-14 19:24:28,529 INFO L273 TraceCheckUtils]: 9: Hoare triple {8803#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8807#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 19:24:28,530 INFO L273 TraceCheckUtils]: 10: Hoare triple {8807#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8811#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 19:24:28,530 INFO L273 TraceCheckUtils]: 11: Hoare triple {8811#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8815#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 19:24:28,531 INFO L273 TraceCheckUtils]: 12: Hoare triple {8815#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8819#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 19:24:28,532 INFO L273 TraceCheckUtils]: 13: Hoare triple {8819#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8823#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 19:24:28,533 INFO L273 TraceCheckUtils]: 14: Hoare triple {8823#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8827#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 19:24:28,533 INFO L273 TraceCheckUtils]: 15: Hoare triple {8827#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8831#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 19:24:28,534 INFO L273 TraceCheckUtils]: 16: Hoare triple {8831#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8835#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 19:24:28,535 INFO L273 TraceCheckUtils]: 17: Hoare triple {8835#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8839#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 19:24:28,536 INFO L273 TraceCheckUtils]: 18: Hoare triple {8839#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8843#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 19:24:28,537 INFO L273 TraceCheckUtils]: 19: Hoare triple {8843#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8847#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 19:24:28,538 INFO L273 TraceCheckUtils]: 20: Hoare triple {8847#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8851#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 19:24:28,539 INFO L273 TraceCheckUtils]: 21: Hoare triple {8851#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8855#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 19:24:28,540 INFO L273 TraceCheckUtils]: 22: Hoare triple {8855#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8859#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 19:24:28,541 INFO L273 TraceCheckUtils]: 23: Hoare triple {8859#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8863#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 19:24:28,541 INFO L273 TraceCheckUtils]: 24: Hoare triple {8863#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8867#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 19:24:28,542 INFO L273 TraceCheckUtils]: 25: Hoare triple {8867#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8871#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 19:24:28,543 INFO L273 TraceCheckUtils]: 26: Hoare triple {8871#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8875#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 19:24:28,544 INFO L273 TraceCheckUtils]: 27: Hoare triple {8875#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8879#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 19:24:28,545 INFO L273 TraceCheckUtils]: 28: Hoare triple {8879#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8883#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 19:24:28,546 INFO L273 TraceCheckUtils]: 29: Hoare triple {8883#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8887#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-14 19:24:28,547 INFO L273 TraceCheckUtils]: 30: Hoare triple {8887#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8891#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-14 19:24:28,548 INFO L273 TraceCheckUtils]: 31: Hoare triple {8891#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8895#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-14 19:24:28,548 INFO L273 TraceCheckUtils]: 32: Hoare triple {8895#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8899#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-14 19:24:28,549 INFO L273 TraceCheckUtils]: 33: Hoare triple {8899#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8903#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-14 19:24:28,550 INFO L273 TraceCheckUtils]: 34: Hoare triple {8903#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8907#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-14 19:24:28,551 INFO L273 TraceCheckUtils]: 35: Hoare triple {8907#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8911#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-14 19:24:28,552 INFO L273 TraceCheckUtils]: 36: Hoare triple {8911#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8915#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-14 19:24:28,553 INFO L273 TraceCheckUtils]: 37: Hoare triple {8915#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8919#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-14 19:24:28,554 INFO L273 TraceCheckUtils]: 38: Hoare triple {8919#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8923#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-14 19:24:28,555 INFO L273 TraceCheckUtils]: 39: Hoare triple {8923#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8927#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-14 19:24:28,556 INFO L273 TraceCheckUtils]: 40: Hoare triple {8927#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8931#(and (<= main_~main__i~0 34) (= main_~main__sum~0 561) (<= 33 main_~main__n~0))} is VALID [2018-11-14 19:24:28,557 INFO L273 TraceCheckUtils]: 41: Hoare triple {8931#(and (<= main_~main__i~0 34) (= main_~main__sum~0 561) (<= 33 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8935#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:24:28,558 INFO L273 TraceCheckUtils]: 42: Hoare triple {8935#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {8774#false} is VALID [2018-11-14 19:24:28,558 INFO L273 TraceCheckUtils]: 43: Hoare triple {8774#false} assume !false; {8774#false} is VALID [2018-11-14 19:24:28,565 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:24:28,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:24:28,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-11-14 19:24:28,587 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 44 [2018-11-14 19:24:28,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:24:28,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-14 19:24:28,627 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:28,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-14 19:24:28,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-14 19:24:28,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-11-14 19:24:28,629 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 37 states. [2018-11-14 19:24:31,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:31,859 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-11-14 19:24:31,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-14 19:24:31,859 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 44 [2018-11-14 19:24:31,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:24:31,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 19:24:31,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2018-11-14 19:24:31,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 19:24:31,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2018-11-14 19:24:31,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 49 transitions. [2018-11-14 19:24:31,916 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:31,917 INFO L225 Difference]: With dead ends: 49 [2018-11-14 19:24:31,917 INFO L226 Difference]: Without dead ends: 46 [2018-11-14 19:24:31,918 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=75, Invalid=1331, Unknown=0, NotChecked=0, Total=1406 [2018-11-14 19:24:31,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-14 19:24:32,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-14 19:24:32,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:24:32,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2018-11-14 19:24:32,011 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-14 19:24:32,011 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-14 19:24:32,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:32,012 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-14 19:24:32,013 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-14 19:24:32,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:32,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:32,013 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-14 19:24:32,013 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-14 19:24:32,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:32,014 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-14 19:24:32,014 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-14 19:24:32,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:32,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:32,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:24:32,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:24:32,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-14 19:24:32,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-11-14 19:24:32,016 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-11-14 19:24:32,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:24:32,017 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-11-14 19:24:32,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-14 19:24:32,017 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-14 19:24:32,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-14 19:24:32,017 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:24:32,017 INFO L375 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:24:32,018 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:24:32,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:24:32,018 INFO L82 PathProgramCache]: Analyzing trace with hash 972880423, now seen corresponding path program 34 times [2018-11-14 19:24:32,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:24:32,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:24:32,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:32,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:24:32,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:32,027 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:24:32,028 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:24:32,028 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 19:24:32,046 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 19:24:32,421 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 19:24:32,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:24:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:24:32,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:24:33,407 INFO L256 TraceCheckUtils]: 0: Hoare triple {9208#true} call ULTIMATE.init(); {9208#true} is VALID [2018-11-14 19:24:33,408 INFO L273 TraceCheckUtils]: 1: Hoare triple {9208#true} ~__return_main~0 := 0;~__return_80~0 := 0; {9208#true} is VALID [2018-11-14 19:24:33,408 INFO L273 TraceCheckUtils]: 2: Hoare triple {9208#true} assume true; {9208#true} is VALID [2018-11-14 19:24:33,408 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9208#true} {9208#true} #28#return; {9208#true} is VALID [2018-11-14 19:24:33,408 INFO L256 TraceCheckUtils]: 4: Hoare triple {9208#true} call #t~ret2 := main(); {9208#true} is VALID [2018-11-14 19:24:33,409 INFO L273 TraceCheckUtils]: 5: Hoare triple {9208#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {9208#true} is VALID [2018-11-14 19:24:33,409 INFO L273 TraceCheckUtils]: 6: Hoare triple {9208#true} assume !!(1 <= ~main__n~0); {9208#true} is VALID [2018-11-14 19:24:33,409 INFO L273 TraceCheckUtils]: 7: Hoare triple {9208#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {9234#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 19:24:33,410 INFO L273 TraceCheckUtils]: 8: Hoare triple {9234#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9238#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-14 19:24:33,411 INFO L273 TraceCheckUtils]: 9: Hoare triple {9238#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9242#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 19:24:33,411 INFO L273 TraceCheckUtils]: 10: Hoare triple {9242#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9246#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 19:24:33,412 INFO L273 TraceCheckUtils]: 11: Hoare triple {9246#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9250#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 19:24:33,412 INFO L273 TraceCheckUtils]: 12: Hoare triple {9250#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9254#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 19:24:33,413 INFO L273 TraceCheckUtils]: 13: Hoare triple {9254#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9258#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 19:24:33,413 INFO L273 TraceCheckUtils]: 14: Hoare triple {9258#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9262#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 19:24:33,414 INFO L273 TraceCheckUtils]: 15: Hoare triple {9262#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9266#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 19:24:33,415 INFO L273 TraceCheckUtils]: 16: Hoare triple {9266#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9270#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 19:24:33,416 INFO L273 TraceCheckUtils]: 17: Hoare triple {9270#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9274#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 19:24:33,417 INFO L273 TraceCheckUtils]: 18: Hoare triple {9274#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9278#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 19:24:33,418 INFO L273 TraceCheckUtils]: 19: Hoare triple {9278#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9282#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 19:24:33,419 INFO L273 TraceCheckUtils]: 20: Hoare triple {9282#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9286#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 19:24:33,419 INFO L273 TraceCheckUtils]: 21: Hoare triple {9286#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9290#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 19:24:33,420 INFO L273 TraceCheckUtils]: 22: Hoare triple {9290#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9294#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 19:24:33,421 INFO L273 TraceCheckUtils]: 23: Hoare triple {9294#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9298#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 19:24:33,422 INFO L273 TraceCheckUtils]: 24: Hoare triple {9298#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9302#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 19:24:33,423 INFO L273 TraceCheckUtils]: 25: Hoare triple {9302#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9306#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 19:24:33,424 INFO L273 TraceCheckUtils]: 26: Hoare triple {9306#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9310#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 19:24:33,425 INFO L273 TraceCheckUtils]: 27: Hoare triple {9310#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9314#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 19:24:33,426 INFO L273 TraceCheckUtils]: 28: Hoare triple {9314#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9318#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 19:24:33,427 INFO L273 TraceCheckUtils]: 29: Hoare triple {9318#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9322#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-14 19:24:33,427 INFO L273 TraceCheckUtils]: 30: Hoare triple {9322#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9326#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-14 19:24:33,428 INFO L273 TraceCheckUtils]: 31: Hoare triple {9326#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9330#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-14 19:24:33,429 INFO L273 TraceCheckUtils]: 32: Hoare triple {9330#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9334#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-14 19:24:33,430 INFO L273 TraceCheckUtils]: 33: Hoare triple {9334#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9338#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-14 19:24:33,431 INFO L273 TraceCheckUtils]: 34: Hoare triple {9338#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9342#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-14 19:24:33,432 INFO L273 TraceCheckUtils]: 35: Hoare triple {9342#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9346#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-14 19:24:33,433 INFO L273 TraceCheckUtils]: 36: Hoare triple {9346#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9350#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-14 19:24:33,434 INFO L273 TraceCheckUtils]: 37: Hoare triple {9350#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9354#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-14 19:24:33,435 INFO L273 TraceCheckUtils]: 38: Hoare triple {9354#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9358#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-14 19:24:33,435 INFO L273 TraceCheckUtils]: 39: Hoare triple {9358#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9362#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-14 19:24:33,436 INFO L273 TraceCheckUtils]: 40: Hoare triple {9362#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9366#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} is VALID [2018-11-14 19:24:33,437 INFO L273 TraceCheckUtils]: 41: Hoare triple {9366#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9370#(and (<= main_~main__i~0 35) (<= 34 main_~main__n~0) (= main_~main__sum~0 595))} is VALID [2018-11-14 19:24:33,439 INFO L273 TraceCheckUtils]: 42: Hoare triple {9370#(and (<= main_~main__i~0 35) (<= 34 main_~main__n~0) (= main_~main__sum~0 595))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9374#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:24:33,439 INFO L273 TraceCheckUtils]: 43: Hoare triple {9374#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {9209#false} is VALID [2018-11-14 19:24:33,440 INFO L273 TraceCheckUtils]: 44: Hoare triple {9209#false} assume !false; {9209#false} is VALID [2018-11-14 19:24:33,444 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:24:33,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:24:33,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-11-14 19:24:33,465 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 45 [2018-11-14 19:24:33,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:24:33,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-14 19:24:33,508 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 19:24:33,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-14 19:24:33,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-14 19:24:33,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-11-14 19:24:33,510 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 38 states.