java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-new/gauss_sum_true-unreach-call.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-19 00:08:03,330 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-19 00:08:03,335 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-19 00:08:03,352 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-19 00:08:03,352 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-19 00:08:03,353 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-19 00:08:03,354 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-19 00:08:03,356 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-19 00:08:03,358 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-19 00:08:03,359 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-19 00:08:03,360 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-19 00:08:03,360 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-19 00:08:03,361 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-19 00:08:03,362 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-19 00:08:03,363 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-19 00:08:03,364 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-19 00:08:03,365 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-19 00:08:03,367 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-19 00:08:03,368 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-19 00:08:03,370 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-19 00:08:03,371 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-19 00:08:03,372 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-19 00:08:03,375 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-19 00:08:03,375 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-19 00:08:03,375 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-19 00:08:03,376 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-19 00:08:03,377 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-19 00:08:03,378 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-19 00:08:03,379 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-19 00:08:03,380 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-19 00:08:03,380 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-19 00:08:03,381 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-19 00:08:03,381 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-19 00:08:03,382 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-19 00:08:03,387 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-19 00:08:03,387 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-19 00:08:03,388 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-19 00:08:03,408 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-19 00:08:03,409 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-19 00:08:03,410 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-19 00:08:03,410 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-19 00:08:03,411 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-19 00:08:03,411 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-19 00:08:03,411 INFO L133 SettingsManager]: * Use SBE=true [2018-11-19 00:08:03,411 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-19 00:08:03,411 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-19 00:08:03,414 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-19 00:08:03,414 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-19 00:08:03,414 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-19 00:08:03,414 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-19 00:08:03,415 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-19 00:08:03,415 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-19 00:08:03,415 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-19 00:08:03,415 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-19 00:08:03,415 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-19 00:08:03,416 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-19 00:08:03,416 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-19 00:08:03,416 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-19 00:08:03,416 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-19 00:08:03,416 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-19 00:08:03,416 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-19 00:08:03,418 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-19 00:08:03,418 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-19 00:08:03,419 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-19 00:08:03,419 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-19 00:08:03,419 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-19 00:08:03,419 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-19 00:08:03,419 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-19 00:08:03,464 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-19 00:08:03,477 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-19 00:08:03,482 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-19 00:08:03,483 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-19 00:08:03,484 INFO L276 PluginConnector]: CDTParser initialized [2018-11-19 00:08:03,485 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+lhb-reducer.c [2018-11-19 00:08:03,554 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27c9d390e/671401d5ce794a39baa87d3d0e985cdc/FLAG988cbbe8d [2018-11-19 00:08:04,065 INFO L307 CDTParser]: Found 1 translation units. [2018-11-19 00:08:04,068 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum_true-unreach-call.i.p+lhb-reducer.c [2018-11-19 00:08:04,076 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27c9d390e/671401d5ce794a39baa87d3d0e985cdc/FLAG988cbbe8d [2018-11-19 00:08:04,386 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27c9d390e/671401d5ce794a39baa87d3d0e985cdc [2018-11-19 00:08:04,395 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-19 00:08:04,397 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-19 00:08:04,398 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-19 00:08:04,398 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-19 00:08:04,402 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-19 00:08:04,404 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:08:04" (1/1) ... [2018-11-19 00:08:04,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26546aed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:08:04, skipping insertion in model container [2018-11-19 00:08:04,407 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:08:04" (1/1) ... [2018-11-19 00:08:04,418 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-19 00:08:04,444 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-19 00:08:04,670 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-19 00:08:04,678 INFO L191 MainTranslator]: Completed pre-run [2018-11-19 00:08:04,719 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-19 00:08:04,736 INFO L195 MainTranslator]: Completed translation [2018-11-19 00:08:04,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:08:04 WrapperNode [2018-11-19 00:08:04,737 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-19 00:08:04,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-19 00:08:04,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-19 00:08:04,738 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-19 00:08:04,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:08:04" (1/1) ... [2018-11-19 00:08:04,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:08:04" (1/1) ... [2018-11-19 00:08:04,758 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:08:04" (1/1) ... [2018-11-19 00:08:04,758 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:08:04" (1/1) ... [2018-11-19 00:08:04,764 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:08:04" (1/1) ... [2018-11-19 00:08:04,768 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:08:04" (1/1) ... [2018-11-19 00:08:04,769 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:08:04" (1/1) ... [2018-11-19 00:08:04,771 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-19 00:08:04,771 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-19 00:08:04,771 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-19 00:08:04,772 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-19 00:08:04,773 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:08:04" (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-19 00:08:04,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-19 00:08:04,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-19 00:08:04,904 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-19 00:08:04,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-19 00:08:04,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-19 00:08:04,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-19 00:08:04,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-19 00:08:04,904 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-19 00:08:04,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-19 00:08:04,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-19 00:08:05,422 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-19 00:08:05,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:08:05 BoogieIcfgContainer [2018-11-19 00:08:05,423 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-19 00:08:05,424 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-19 00:08:05,424 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-19 00:08:05,427 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-19 00:08:05,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:08:04" (1/3) ... [2018-11-19 00:08:05,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@256ae127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:08:05, skipping insertion in model container [2018-11-19 00:08:05,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:08:04" (2/3) ... [2018-11-19 00:08:05,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@256ae127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:08:05, skipping insertion in model container [2018-11-19 00:08:05,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:08:05" (3/3) ... [2018-11-19 00:08:05,433 INFO L112 eAbstractionObserver]: Analyzing ICFG gauss_sum_true-unreach-call.i.p+lhb-reducer.c [2018-11-19 00:08:05,443 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-19 00:08:05,451 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-19 00:08:05,469 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-19 00:08:05,500 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-19 00:08:05,501 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-19 00:08:05,501 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-19 00:08:05,501 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-19 00:08:05,501 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-19 00:08:05,502 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-19 00:08:05,502 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-19 00:08:05,502 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-19 00:08:05,502 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-19 00:08:05,521 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-19 00:08:05,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-19 00:08:05,528 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:08:05,529 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:08:05,532 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:08:05,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:08:05,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1720236422, now seen corresponding path program 1 times [2018-11-19 00:08:05,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:08:05,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:08:05,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:05,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:08:05,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:05,652 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:08:05,653 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:08:05,653 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-19 00:08:05,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:08:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:08:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:08:05,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:08:06,556 INFO L256 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2018-11-19 00:08:06,560 INFO L273 TraceCheckUtils]: 1: Hoare triple {24#true} ~__return_main~0 := 0;~__return_96~0 := 0; {24#true} is VALID [2018-11-19 00:08:06,560 INFO L273 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2018-11-19 00:08:06,560 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #48#return; {24#true} is VALID [2018-11-19 00:08:06,561 INFO L256 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret2 := main(); {24#true} is VALID [2018-11-19 00:08:06,561 INFO L273 TraceCheckUtils]: 5: Hoare triple {24#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; {24#true} is VALID [2018-11-19 00:08:06,561 INFO L273 TraceCheckUtils]: 6: Hoare triple {24#true} assume !!(1 <= ~main__n~0); {24#true} is VALID [2018-11-19 00:08:06,562 INFO L273 TraceCheckUtils]: 7: Hoare triple {24#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {50#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:08:06,563 INFO L273 TraceCheckUtils]: 8: Hoare triple {50#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {54#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-19 00:08:06,564 INFO L273 TraceCheckUtils]: 9: Hoare triple {54#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {58#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:08:06,565 INFO L273 TraceCheckUtils]: 10: Hoare triple {58#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {62#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:08:06,566 INFO L273 TraceCheckUtils]: 11: Hoare triple {62#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {66#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:08:06,571 INFO L273 TraceCheckUtils]: 12: Hoare triple {66#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {70#(and (<= main_~main__i~0 6) (= main_~main__sum~0 15) (<= 5 main_~main__n~0))} is VALID [2018-11-19 00:08:06,574 INFO L273 TraceCheckUtils]: 13: Hoare triple {70#(and (<= main_~main__i~0 6) (= main_~main__sum~0 15) (<= 5 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {74#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:08:06,576 INFO L273 TraceCheckUtils]: 14: Hoare triple {74#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {25#false} is VALID [2018-11-19 00:08:06,576 INFO L273 TraceCheckUtils]: 15: Hoare triple {25#false} assume !false; {25#false} is VALID [2018-11-19 00:08:06,581 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-19 00:08:06,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 00:08:06,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-19 00:08:06,608 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-11-19 00:08:06,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:08:06,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-19 00:08:06,689 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-19 00:08:06,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-19 00:08:06,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-19 00:08:06,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-19 00:08:06,704 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 9 states. [2018-11-19 00:08:07,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:07,971 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2018-11-19 00:08:07,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-19 00:08:07,971 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-11-19 00:08:07,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:08:07,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-19 00:08:07,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2018-11-19 00:08:07,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-19 00:08:07,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2018-11-19 00:08:07,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2018-11-19 00:08:08,126 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:08:08,138 INFO L225 Difference]: With dead ends: 41 [2018-11-19 00:08:08,138 INFO L226 Difference]: Without dead ends: 18 [2018-11-19 00:08:08,142 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-19 00:08:08,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-19 00:08:08,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-19 00:08:08,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:08:08,290 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-19 00:08:08,291 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-19 00:08:08,291 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-19 00:08:08,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:08,295 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-19 00:08:08,295 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-19 00:08:08,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:08,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:08,296 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-19 00:08:08,296 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-19 00:08:08,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:08,300 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-19 00:08:08,300 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-19 00:08:08,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:08,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:08,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:08:08,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:08:08,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-19 00:08:08,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-19 00:08:08,306 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-11-19 00:08:08,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:08:08,309 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-19 00:08:08,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-19 00:08:08,309 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-19 00:08:08,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-19 00:08:08,310 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:08:08,310 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:08:08,311 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:08:08,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:08:08,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1787659072, now seen corresponding path program 1 times [2018-11-19 00:08:08,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:08:08,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:08:08,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:08,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:08:08,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:08,346 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:08:08,346 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:08:08,346 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-19 00:08:08,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:08:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:08:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:08:08,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:08:08,959 INFO L256 TraceCheckUtils]: 0: Hoare triple {189#true} call ULTIMATE.init(); {189#true} is VALID [2018-11-19 00:08:08,960 INFO L273 TraceCheckUtils]: 1: Hoare triple {189#true} ~__return_main~0 := 0;~__return_96~0 := 0; {189#true} is VALID [2018-11-19 00:08:08,960 INFO L273 TraceCheckUtils]: 2: Hoare triple {189#true} assume true; {189#true} is VALID [2018-11-19 00:08:08,961 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {189#true} {189#true} #48#return; {189#true} is VALID [2018-11-19 00:08:08,961 INFO L256 TraceCheckUtils]: 4: Hoare triple {189#true} call #t~ret2 := main(); {189#true} is VALID [2018-11-19 00:08:08,961 INFO L273 TraceCheckUtils]: 5: Hoare triple {189#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; {189#true} is VALID [2018-11-19 00:08:08,962 INFO L273 TraceCheckUtils]: 6: Hoare triple {189#true} assume !!(1 <= ~main__n~0); {189#true} is VALID [2018-11-19 00:08:08,980 INFO L273 TraceCheckUtils]: 7: Hoare triple {189#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {215#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:08:08,981 INFO L273 TraceCheckUtils]: 8: Hoare triple {215#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {219#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-19 00:08:08,982 INFO L273 TraceCheckUtils]: 9: Hoare triple {219#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {223#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:08:08,999 INFO L273 TraceCheckUtils]: 10: Hoare triple {223#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {227#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:08:09,000 INFO L273 TraceCheckUtils]: 11: Hoare triple {227#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {231#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:08:09,001 INFO L273 TraceCheckUtils]: 12: Hoare triple {231#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {235#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:08:09,002 INFO L273 TraceCheckUtils]: 13: Hoare triple {235#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {239#(and (= main_~main__sum~0 21) (<= main_~main__i~0 7) (<= 6 main_~main__n~0))} is VALID [2018-11-19 00:08:09,003 INFO L273 TraceCheckUtils]: 14: Hoare triple {239#(and (= main_~main__sum~0 21) (<= main_~main__i~0 7) (<= 6 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {243#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:08:09,004 INFO L273 TraceCheckUtils]: 15: Hoare triple {243#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {190#false} is VALID [2018-11-19 00:08:09,004 INFO L273 TraceCheckUtils]: 16: Hoare triple {190#false} assume !false; {190#false} is VALID [2018-11-19 00:08:09,009 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-19 00:08:09,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:08:09,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-11-19 00:08:09,031 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-11-19 00:08:09,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:08:09,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-19 00:08:09,068 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-19 00:08:09,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-19 00:08:09,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-19 00:08:09,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-19 00:08:09,070 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 10 states. [2018-11-19 00:08:09,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:09,526 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-19 00:08:09,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-19 00:08:09,526 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-11-19 00:08:09,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:08:09,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-19 00:08:09,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 22 transitions. [2018-11-19 00:08:09,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-19 00:08:09,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 22 transitions. [2018-11-19 00:08:09,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 22 transitions. [2018-11-19 00:08:09,564 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-19 00:08:09,567 INFO L225 Difference]: With dead ends: 22 [2018-11-19 00:08:09,567 INFO L226 Difference]: Without dead ends: 19 [2018-11-19 00:08:09,568 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-19 00:08:09,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-19 00:08:09,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-19 00:08:09,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:08:09,586 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-19 00:08:09,586 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-19 00:08:09,586 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-19 00:08:09,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:09,589 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-19 00:08:09,589 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-19 00:08:09,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:09,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:09,589 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-19 00:08:09,590 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-19 00:08:09,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:09,592 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-19 00:08:09,592 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-19 00:08:09,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:09,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:09,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:08:09,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:08:09,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-19 00:08:09,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-19 00:08:09,595 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-11-19 00:08:09,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:08:09,595 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-11-19 00:08:09,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-19 00:08:09,595 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-19 00:08:09,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-19 00:08:09,596 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:08:09,597 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:08:09,597 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:08:09,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:08:09,597 INFO L82 PathProgramCache]: Analyzing trace with hash -417206074, now seen corresponding path program 2 times [2018-11-19 00:08:09,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:08:09,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:08:09,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:09,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:08:09,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:09,613 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:08:09,613 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:08:09,613 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-19 00:08:09,627 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-19 00:08:09,649 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-19 00:08:09,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:08:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:08:09,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:08:09,962 INFO L256 TraceCheckUtils]: 0: Hoare triple {344#true} call ULTIMATE.init(); {344#true} is VALID [2018-11-19 00:08:09,963 INFO L273 TraceCheckUtils]: 1: Hoare triple {344#true} ~__return_main~0 := 0;~__return_96~0 := 0; {344#true} is VALID [2018-11-19 00:08:09,963 INFO L273 TraceCheckUtils]: 2: Hoare triple {344#true} assume true; {344#true} is VALID [2018-11-19 00:08:09,964 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {344#true} {344#true} #48#return; {344#true} is VALID [2018-11-19 00:08:09,964 INFO L256 TraceCheckUtils]: 4: Hoare triple {344#true} call #t~ret2 := main(); {344#true} is VALID [2018-11-19 00:08:09,964 INFO L273 TraceCheckUtils]: 5: Hoare triple {344#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; {344#true} is VALID [2018-11-19 00:08:09,965 INFO L273 TraceCheckUtils]: 6: Hoare triple {344#true} assume !!(1 <= ~main__n~0); {344#true} is VALID [2018-11-19 00:08:09,966 INFO L273 TraceCheckUtils]: 7: Hoare triple {344#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {370#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:08:09,968 INFO L273 TraceCheckUtils]: 8: Hoare triple {370#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {374#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-19 00:08:09,969 INFO L273 TraceCheckUtils]: 9: Hoare triple {374#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {378#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:08:09,971 INFO L273 TraceCheckUtils]: 10: Hoare triple {378#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {382#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:08:09,972 INFO L273 TraceCheckUtils]: 11: Hoare triple {382#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {386#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:08:09,973 INFO L273 TraceCheckUtils]: 12: Hoare triple {386#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {390#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:08:09,974 INFO L273 TraceCheckUtils]: 13: Hoare triple {390#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {394#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:08:09,975 INFO L273 TraceCheckUtils]: 14: Hoare triple {394#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {398#(and (<= main_~main__i~0 8) (<= 7 main_~main__n~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:08:09,977 INFO L273 TraceCheckUtils]: 15: Hoare triple {398#(and (<= main_~main__i~0 8) (<= 7 main_~main__n~0) (= main_~main__sum~0 28))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {402#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:08:09,978 INFO L273 TraceCheckUtils]: 16: Hoare triple {402#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {345#false} is VALID [2018-11-19 00:08:09,979 INFO L273 TraceCheckUtils]: 17: Hoare triple {345#false} assume !false; {345#false} is VALID [2018-11-19 00:08:09,981 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-19 00:08:10,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:08:10,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-11-19 00:08:10,002 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-11-19 00:08:10,002 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:08:10,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-19 00:08:10,025 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-19 00:08:10,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-19 00:08:10,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-19 00:08:10,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-19 00:08:10,026 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 11 states. [2018-11-19 00:08:10,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:10,526 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-19 00:08:10,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-19 00:08:10,527 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-11-19 00:08:10,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:08:10,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-19 00:08:10,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2018-11-19 00:08:10,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-19 00:08:10,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2018-11-19 00:08:10,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 23 transitions. [2018-11-19 00:08:10,573 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-19 00:08:10,575 INFO L225 Difference]: With dead ends: 23 [2018-11-19 00:08:10,575 INFO L226 Difference]: Without dead ends: 20 [2018-11-19 00:08:10,576 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-19 00:08:10,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-19 00:08:10,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-19 00:08:10,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:08:10,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-19 00:08:10,605 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-19 00:08:10,606 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-19 00:08:10,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:10,607 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-19 00:08:10,608 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-19 00:08:10,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:10,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:10,609 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-19 00:08:10,609 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-19 00:08:10,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:10,611 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-19 00:08:10,611 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-19 00:08:10,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:10,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:10,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:08:10,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:08:10,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-19 00:08:10,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-19 00:08:10,614 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-11-19 00:08:10,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:08:10,614 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-19 00:08:10,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-19 00:08:10,614 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-19 00:08:10,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-19 00:08:10,615 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:08:10,615 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:08:10,616 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:08:10,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:08:10,616 INFO L82 PathProgramCache]: Analyzing trace with hash -48548864, now seen corresponding path program 3 times [2018-11-19 00:08:10,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:08:10,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:08:10,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:10,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:08:10,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:10,632 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:08:10,632 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:08:10,632 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-19 00:08:10,646 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-19 00:08:10,665 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-19 00:08:10,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:08:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:08:10,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:08:11,105 INFO L256 TraceCheckUtils]: 0: Hoare triple {509#true} call ULTIMATE.init(); {509#true} is VALID [2018-11-19 00:08:11,105 INFO L273 TraceCheckUtils]: 1: Hoare triple {509#true} ~__return_main~0 := 0;~__return_96~0 := 0; {509#true} is VALID [2018-11-19 00:08:11,105 INFO L273 TraceCheckUtils]: 2: Hoare triple {509#true} assume true; {509#true} is VALID [2018-11-19 00:08:11,106 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {509#true} {509#true} #48#return; {509#true} is VALID [2018-11-19 00:08:11,106 INFO L256 TraceCheckUtils]: 4: Hoare triple {509#true} call #t~ret2 := main(); {509#true} is VALID [2018-11-19 00:08:11,106 INFO L273 TraceCheckUtils]: 5: Hoare triple {509#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; {509#true} is VALID [2018-11-19 00:08:11,106 INFO L273 TraceCheckUtils]: 6: Hoare triple {509#true} assume !!(1 <= ~main__n~0); {509#true} is VALID [2018-11-19 00:08:11,113 INFO L273 TraceCheckUtils]: 7: Hoare triple {509#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {535#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:08:11,114 INFO L273 TraceCheckUtils]: 8: Hoare triple {535#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {539#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-19 00:08:11,115 INFO L273 TraceCheckUtils]: 9: Hoare triple {539#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {543#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:08:11,116 INFO L273 TraceCheckUtils]: 10: Hoare triple {543#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {547#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:08:11,119 INFO L273 TraceCheckUtils]: 11: Hoare triple {547#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {551#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:08:11,120 INFO L273 TraceCheckUtils]: 12: Hoare triple {551#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {555#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:08:11,121 INFO L273 TraceCheckUtils]: 13: Hoare triple {555#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {559#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:08:11,122 INFO L273 TraceCheckUtils]: 14: Hoare triple {559#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {563#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:08:11,123 INFO L273 TraceCheckUtils]: 15: Hoare triple {563#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {567#(and (<= main_~main__i~0 9) (<= 8 main_~main__n~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:08:11,145 INFO L273 TraceCheckUtils]: 16: Hoare triple {567#(and (<= main_~main__i~0 9) (<= 8 main_~main__n~0) (= main_~main__sum~0 36))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {571#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:08:11,159 INFO L273 TraceCheckUtils]: 17: Hoare triple {571#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {510#false} is VALID [2018-11-19 00:08:11,159 INFO L273 TraceCheckUtils]: 18: Hoare triple {510#false} assume !false; {510#false} is VALID [2018-11-19 00:08:11,161 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-19 00:08:11,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:08:11,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-11-19 00:08:11,186 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-11-19 00:08:11,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:08:11,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-19 00:08:11,212 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-19 00:08:11,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-19 00:08:11,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-19 00:08:11,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-19 00:08:11,214 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 12 states. [2018-11-19 00:08:11,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:11,625 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-19 00:08:11,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-19 00:08:11,625 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-11-19 00:08:11,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:08:11,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-19 00:08:11,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2018-11-19 00:08:11,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-19 00:08:11,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2018-11-19 00:08:11,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 24 transitions. [2018-11-19 00:08:11,658 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-19 00:08:11,660 INFO L225 Difference]: With dead ends: 24 [2018-11-19 00:08:11,660 INFO L226 Difference]: Without dead ends: 21 [2018-11-19 00:08:11,661 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-11-19 00:08:11,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-19 00:08:11,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-19 00:08:11,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:08:11,679 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-19 00:08:11,679 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-19 00:08:11,679 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-19 00:08:11,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:11,681 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-19 00:08:11,682 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-19 00:08:11,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:11,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:11,682 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-19 00:08:11,683 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-19 00:08:11,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:11,685 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-19 00:08:11,685 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-19 00:08:11,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:11,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:11,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:08:11,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:08:11,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-19 00:08:11,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-19 00:08:11,687 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-11-19 00:08:11,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:08:11,688 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-19 00:08:11,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-19 00:08:11,688 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-19 00:08:11,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-19 00:08:11,689 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:08:11,689 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:08:11,689 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:08:11,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:08:11,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1505077242, now seen corresponding path program 4 times [2018-11-19 00:08:11,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:08:11,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:08:11,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:11,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:08:11,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:11,705 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:08:11,706 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:08:11,706 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-19 00:08:11,722 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-19 00:08:11,794 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-19 00:08:11,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:08:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:08:11,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:08:12,133 INFO L256 TraceCheckUtils]: 0: Hoare triple {684#true} call ULTIMATE.init(); {684#true} is VALID [2018-11-19 00:08:12,134 INFO L273 TraceCheckUtils]: 1: Hoare triple {684#true} ~__return_main~0 := 0;~__return_96~0 := 0; {684#true} is VALID [2018-11-19 00:08:12,134 INFO L273 TraceCheckUtils]: 2: Hoare triple {684#true} assume true; {684#true} is VALID [2018-11-19 00:08:12,134 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {684#true} {684#true} #48#return; {684#true} is VALID [2018-11-19 00:08:12,135 INFO L256 TraceCheckUtils]: 4: Hoare triple {684#true} call #t~ret2 := main(); {684#true} is VALID [2018-11-19 00:08:12,135 INFO L273 TraceCheckUtils]: 5: Hoare triple {684#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; {684#true} is VALID [2018-11-19 00:08:12,135 INFO L273 TraceCheckUtils]: 6: Hoare triple {684#true} assume !!(1 <= ~main__n~0); {684#true} is VALID [2018-11-19 00:08:12,136 INFO L273 TraceCheckUtils]: 7: Hoare triple {684#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {710#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:08:12,137 INFO L273 TraceCheckUtils]: 8: Hoare triple {710#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {714#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-19 00:08:12,137 INFO L273 TraceCheckUtils]: 9: Hoare triple {714#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {718#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:08:12,138 INFO L273 TraceCheckUtils]: 10: Hoare triple {718#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {722#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:08:12,139 INFO L273 TraceCheckUtils]: 11: Hoare triple {722#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {726#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:08:12,140 INFO L273 TraceCheckUtils]: 12: Hoare triple {726#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {730#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:08:12,141 INFO L273 TraceCheckUtils]: 13: Hoare triple {730#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {734#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:08:12,142 INFO L273 TraceCheckUtils]: 14: Hoare triple {734#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {738#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:08:12,143 INFO L273 TraceCheckUtils]: 15: Hoare triple {738#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {742#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:08:12,145 INFO L273 TraceCheckUtils]: 16: Hoare triple {742#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {746#(and (= main_~main__sum~0 45) (<= 9 main_~main__n~0) (<= main_~main__i~0 10))} is VALID [2018-11-19 00:08:12,147 INFO L273 TraceCheckUtils]: 17: Hoare triple {746#(and (= main_~main__sum~0 45) (<= 9 main_~main__n~0) (<= main_~main__i~0 10))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {750#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:08:12,148 INFO L273 TraceCheckUtils]: 18: Hoare triple {750#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {685#false} is VALID [2018-11-19 00:08:12,148 INFO L273 TraceCheckUtils]: 19: Hoare triple {685#false} assume !false; {685#false} is VALID [2018-11-19 00:08:12,150 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-19 00:08:12,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:08:12,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-11-19 00:08:12,177 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-11-19 00:08:12,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:08:12,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-19 00:08:12,204 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-19 00:08:12,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-19 00:08:12,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-19 00:08:12,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-19 00:08:12,206 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 13 states. [2018-11-19 00:08:12,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:12,962 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-19 00:08:12,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-19 00:08:12,963 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-11-19 00:08:12,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:08:12,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-19 00:08:12,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2018-11-19 00:08:12,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-19 00:08:12,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2018-11-19 00:08:12,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 25 transitions. [2018-11-19 00:08:13,000 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-19 00:08:13,002 INFO L225 Difference]: With dead ends: 25 [2018-11-19 00:08:13,002 INFO L226 Difference]: Without dead ends: 22 [2018-11-19 00:08:13,003 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-19 00:08:13,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-19 00:08:13,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-19 00:08:13,025 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:08:13,025 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-19 00:08:13,026 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-19 00:08:13,026 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-19 00:08:13,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:13,028 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-19 00:08:13,028 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-19 00:08:13,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:13,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:13,029 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-19 00:08:13,029 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-19 00:08:13,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:13,031 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-19 00:08:13,031 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-19 00:08:13,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:13,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:13,032 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:08:13,032 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:08:13,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-19 00:08:13,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-19 00:08:13,033 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-11-19 00:08:13,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:08:13,034 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-19 00:08:13,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-19 00:08:13,034 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-19 00:08:13,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-19 00:08:13,035 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:08:13,035 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:08:13,035 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:08:13,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:08:13,036 INFO L82 PathProgramCache]: Analyzing trace with hash 587183296, now seen corresponding path program 5 times [2018-11-19 00:08:13,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:08:13,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:08:13,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:13,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:08:13,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:13,050 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:08:13,050 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:08:13,051 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-19 00:08:13,063 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-19 00:08:13,085 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-19 00:08:13,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:08:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:08:13,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:08:13,796 INFO L256 TraceCheckUtils]: 0: Hoare triple {869#true} call ULTIMATE.init(); {869#true} is VALID [2018-11-19 00:08:13,796 INFO L273 TraceCheckUtils]: 1: Hoare triple {869#true} ~__return_main~0 := 0;~__return_96~0 := 0; {869#true} is VALID [2018-11-19 00:08:13,796 INFO L273 TraceCheckUtils]: 2: Hoare triple {869#true} assume true; {869#true} is VALID [2018-11-19 00:08:13,797 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {869#true} {869#true} #48#return; {869#true} is VALID [2018-11-19 00:08:13,797 INFO L256 TraceCheckUtils]: 4: Hoare triple {869#true} call #t~ret2 := main(); {869#true} is VALID [2018-11-19 00:08:13,797 INFO L273 TraceCheckUtils]: 5: Hoare triple {869#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; {869#true} is VALID [2018-11-19 00:08:13,798 INFO L273 TraceCheckUtils]: 6: Hoare triple {869#true} assume !!(1 <= ~main__n~0); {869#true} is VALID [2018-11-19 00:08:13,798 INFO L273 TraceCheckUtils]: 7: Hoare triple {869#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {895#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:08:13,799 INFO L273 TraceCheckUtils]: 8: Hoare triple {895#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {899#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-19 00:08:13,800 INFO L273 TraceCheckUtils]: 9: Hoare triple {899#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {903#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:08:13,800 INFO L273 TraceCheckUtils]: 10: Hoare triple {903#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {907#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:08:13,801 INFO L273 TraceCheckUtils]: 11: Hoare triple {907#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {911#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:08:13,802 INFO L273 TraceCheckUtils]: 12: Hoare triple {911#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {915#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:08:13,803 INFO L273 TraceCheckUtils]: 13: Hoare triple {915#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {919#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:08:13,804 INFO L273 TraceCheckUtils]: 14: Hoare triple {919#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {923#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:08:13,805 INFO L273 TraceCheckUtils]: 15: Hoare triple {923#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {927#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:08:13,812 INFO L273 TraceCheckUtils]: 16: Hoare triple {927#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {931#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-19 00:08:13,813 INFO L273 TraceCheckUtils]: 17: Hoare triple {931#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {935#(and (= main_~main__sum~0 55) (<= main_~main__i~0 11) (<= 10 main_~main__n~0))} is VALID [2018-11-19 00:08:13,814 INFO L273 TraceCheckUtils]: 18: Hoare triple {935#(and (= main_~main__sum~0 55) (<= main_~main__i~0 11) (<= 10 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {939#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:08:13,815 INFO L273 TraceCheckUtils]: 19: Hoare triple {939#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {870#false} is VALID [2018-11-19 00:08:13,815 INFO L273 TraceCheckUtils]: 20: Hoare triple {870#false} assume !false; {870#false} is VALID [2018-11-19 00:08:13,816 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-19 00:08:13,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:08:13,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-11-19 00:08:13,835 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2018-11-19 00:08:13,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:08:13,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-19 00:08:13,859 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-19 00:08:13,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-19 00:08:13,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-19 00:08:13,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-19 00:08:13,860 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 14 states. [2018-11-19 00:08:14,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:14,403 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-19 00:08:14,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-19 00:08:14,404 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2018-11-19 00:08:14,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:08:14,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-19 00:08:14,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 26 transitions. [2018-11-19 00:08:14,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-19 00:08:14,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 26 transitions. [2018-11-19 00:08:14,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 26 transitions. [2018-11-19 00:08:14,437 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-19 00:08:14,438 INFO L225 Difference]: With dead ends: 26 [2018-11-19 00:08:14,438 INFO L226 Difference]: Without dead ends: 23 [2018-11-19 00:08:14,439 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-11-19 00:08:14,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-19 00:08:14,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-19 00:08:14,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:08:14,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2018-11-19 00:08:14,512 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-19 00:08:14,512 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-19 00:08:14,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:14,515 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-19 00:08:14,515 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-19 00:08:14,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:14,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:14,516 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-19 00:08:14,516 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-19 00:08:14,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:14,517 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-19 00:08:14,518 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-19 00:08:14,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:14,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:14,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:08:14,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:08:14,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-19 00:08:14,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-11-19 00:08:14,520 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-11-19 00:08:14,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:08:14,520 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-11-19 00:08:14,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-19 00:08:14,520 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-19 00:08:14,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-19 00:08:14,521 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:08:14,521 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:08:14,522 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:08:14,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:08:14,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1022750534, now seen corresponding path program 6 times [2018-11-19 00:08:14,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:08:14,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:08:14,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:14,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:08:14,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:14,535 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:08:14,536 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:08:14,536 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-19 00:08:14,562 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-19 00:08:14,587 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-19 00:08:14,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:08:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:08:14,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:08:14,917 INFO L256 TraceCheckUtils]: 0: Hoare triple {1064#true} call ULTIMATE.init(); {1064#true} is VALID [2018-11-19 00:08:14,918 INFO L273 TraceCheckUtils]: 1: Hoare triple {1064#true} ~__return_main~0 := 0;~__return_96~0 := 0; {1064#true} is VALID [2018-11-19 00:08:14,918 INFO L273 TraceCheckUtils]: 2: Hoare triple {1064#true} assume true; {1064#true} is VALID [2018-11-19 00:08:14,918 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1064#true} {1064#true} #48#return; {1064#true} is VALID [2018-11-19 00:08:14,919 INFO L256 TraceCheckUtils]: 4: Hoare triple {1064#true} call #t~ret2 := main(); {1064#true} is VALID [2018-11-19 00:08:14,919 INFO L273 TraceCheckUtils]: 5: Hoare triple {1064#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; {1064#true} is VALID [2018-11-19 00:08:14,919 INFO L273 TraceCheckUtils]: 6: Hoare triple {1064#true} assume !!(1 <= ~main__n~0); {1064#true} is VALID [2018-11-19 00:08:14,920 INFO L273 TraceCheckUtils]: 7: Hoare triple {1064#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1090#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:08:14,920 INFO L273 TraceCheckUtils]: 8: Hoare triple {1090#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1094#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-19 00:08:14,921 INFO L273 TraceCheckUtils]: 9: Hoare triple {1094#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1098#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:08:14,936 INFO L273 TraceCheckUtils]: 10: Hoare triple {1098#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1102#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:08:14,937 INFO L273 TraceCheckUtils]: 11: Hoare triple {1102#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1106#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:08:14,938 INFO L273 TraceCheckUtils]: 12: Hoare triple {1106#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1110#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:08:14,939 INFO L273 TraceCheckUtils]: 13: Hoare triple {1110#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1114#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:08:14,940 INFO L273 TraceCheckUtils]: 14: Hoare triple {1114#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1118#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:08:14,941 INFO L273 TraceCheckUtils]: 15: Hoare triple {1118#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1122#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:08:14,943 INFO L273 TraceCheckUtils]: 16: Hoare triple {1122#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1126#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-19 00:08:14,948 INFO L273 TraceCheckUtils]: 17: Hoare triple {1126#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1130#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-19 00:08:14,949 INFO L273 TraceCheckUtils]: 18: Hoare triple {1130#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1134#(and (= main_~main__sum~0 66) (<= main_~main__i~0 12) (<= 11 main_~main__n~0))} is VALID [2018-11-19 00:08:14,950 INFO L273 TraceCheckUtils]: 19: Hoare triple {1134#(and (= main_~main__sum~0 66) (<= main_~main__i~0 12) (<= 11 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1138#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:08:14,950 INFO L273 TraceCheckUtils]: 20: Hoare triple {1138#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {1065#false} is VALID [2018-11-19 00:08:14,950 INFO L273 TraceCheckUtils]: 21: Hoare triple {1065#false} assume !false; {1065#false} is VALID [2018-11-19 00:08:14,952 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-19 00:08:14,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:08:14,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-11-19 00:08:14,981 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-11-19 00:08:14,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:08:14,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-19 00:08:15,017 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-19 00:08:15,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-19 00:08:15,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-19 00:08:15,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-19 00:08:15,018 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 15 states. [2018-11-19 00:08:15,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:15,713 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-19 00:08:15,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-19 00:08:15,713 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-11-19 00:08:15,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:08:15,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-19 00:08:15,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-11-19 00:08:15,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-19 00:08:15,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-11-19 00:08:15,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 27 transitions. [2018-11-19 00:08:15,764 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-19 00:08:15,767 INFO L225 Difference]: With dead ends: 27 [2018-11-19 00:08:15,767 INFO L226 Difference]: Without dead ends: 24 [2018-11-19 00:08:15,768 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-11-19 00:08:15,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-19 00:08:15,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-19 00:08:15,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:08:15,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-19 00:08:15,874 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-19 00:08:15,874 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-19 00:08:15,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:15,876 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-19 00:08:15,876 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-19 00:08:15,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:15,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:15,877 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-19 00:08:15,877 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-19 00:08:15,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:15,878 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-19 00:08:15,878 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-19 00:08:15,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:15,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:15,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:08:15,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:08:15,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-19 00:08:15,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-19 00:08:15,880 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-11-19 00:08:15,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:08:15,880 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-19 00:08:15,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-19 00:08:15,881 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-19 00:08:15,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-19 00:08:15,881 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:08:15,882 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:08:15,882 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:08:15,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:08:15,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1640433024, now seen corresponding path program 7 times [2018-11-19 00:08:15,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:08:15,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:08:15,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:15,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:08:15,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:15,895 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:08:15,895 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:08:15,896 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-19 00:08:15,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:08:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:08:15,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:08:15,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:08:16,308 INFO L256 TraceCheckUtils]: 0: Hoare triple {1269#true} call ULTIMATE.init(); {1269#true} is VALID [2018-11-19 00:08:16,308 INFO L273 TraceCheckUtils]: 1: Hoare triple {1269#true} ~__return_main~0 := 0;~__return_96~0 := 0; {1269#true} is VALID [2018-11-19 00:08:16,308 INFO L273 TraceCheckUtils]: 2: Hoare triple {1269#true} assume true; {1269#true} is VALID [2018-11-19 00:08:16,309 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1269#true} {1269#true} #48#return; {1269#true} is VALID [2018-11-19 00:08:16,309 INFO L256 TraceCheckUtils]: 4: Hoare triple {1269#true} call #t~ret2 := main(); {1269#true} is VALID [2018-11-19 00:08:16,309 INFO L273 TraceCheckUtils]: 5: Hoare triple {1269#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; {1269#true} is VALID [2018-11-19 00:08:16,310 INFO L273 TraceCheckUtils]: 6: Hoare triple {1269#true} assume !!(1 <= ~main__n~0); {1269#true} is VALID [2018-11-19 00:08:16,310 INFO L273 TraceCheckUtils]: 7: Hoare triple {1269#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1295#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:08:16,311 INFO L273 TraceCheckUtils]: 8: Hoare triple {1295#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1299#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-19 00:08:16,312 INFO L273 TraceCheckUtils]: 9: Hoare triple {1299#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1303#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:08:16,313 INFO L273 TraceCheckUtils]: 10: Hoare triple {1303#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1307#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:08:16,313 INFO L273 TraceCheckUtils]: 11: Hoare triple {1307#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1311#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:08:16,314 INFO L273 TraceCheckUtils]: 12: Hoare triple {1311#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1315#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:08:16,315 INFO L273 TraceCheckUtils]: 13: Hoare triple {1315#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1319#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:08:16,316 INFO L273 TraceCheckUtils]: 14: Hoare triple {1319#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1323#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:08:16,317 INFO L273 TraceCheckUtils]: 15: Hoare triple {1323#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1327#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:08:16,318 INFO L273 TraceCheckUtils]: 16: Hoare triple {1327#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1331#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-19 00:08:16,319 INFO L273 TraceCheckUtils]: 17: Hoare triple {1331#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1335#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-19 00:08:16,320 INFO L273 TraceCheckUtils]: 18: Hoare triple {1335#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1339#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-19 00:08:16,321 INFO L273 TraceCheckUtils]: 19: Hoare triple {1339#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1343#(and (= main_~main__sum~0 78) (<= main_~main__i~0 13) (<= 12 main_~main__n~0))} is VALID [2018-11-19 00:08:16,322 INFO L273 TraceCheckUtils]: 20: Hoare triple {1343#(and (= main_~main__sum~0 78) (<= main_~main__i~0 13) (<= 12 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1347#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:08:16,323 INFO L273 TraceCheckUtils]: 21: Hoare triple {1347#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {1270#false} is VALID [2018-11-19 00:08:16,324 INFO L273 TraceCheckUtils]: 22: Hoare triple {1270#false} assume !false; {1270#false} is VALID [2018-11-19 00:08:16,325 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-19 00:08:16,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:08:16,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-11-19 00:08:16,346 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-11-19 00:08:16,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:08:16,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-19 00:08:16,372 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-19 00:08:16,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-19 00:08:16,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-19 00:08:16,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-11-19 00:08:16,373 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 16 states. [2018-11-19 00:08:17,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:17,131 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-19 00:08:17,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-19 00:08:17,132 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-11-19 00:08:17,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:08:17,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-19 00:08:17,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 28 transitions. [2018-11-19 00:08:17,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-19 00:08:17,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 28 transitions. [2018-11-19 00:08:17,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 28 transitions. [2018-11-19 00:08:17,172 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-19 00:08:17,174 INFO L225 Difference]: With dead ends: 28 [2018-11-19 00:08:17,174 INFO L226 Difference]: Without dead ends: 25 [2018-11-19 00:08:17,175 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-11-19 00:08:17,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-19 00:08:17,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-19 00:08:17,198 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:08:17,198 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-19 00:08:17,198 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-19 00:08:17,198 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-19 00:08:17,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:17,201 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-19 00:08:17,201 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-19 00:08:17,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:17,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:17,201 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-19 00:08:17,202 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-19 00:08:17,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:17,203 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-19 00:08:17,203 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-19 00:08:17,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:17,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:17,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:08:17,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:08:17,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-19 00:08:17,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-11-19 00:08:17,204 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-11-19 00:08:17,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:08:17,205 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-11-19 00:08:17,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-19 00:08:17,205 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-19 00:08:17,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-19 00:08:17,205 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:08:17,206 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:08:17,206 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:08:17,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:08:17,206 INFO L82 PathProgramCache]: Analyzing trace with hash -686246266, now seen corresponding path program 8 times [2018-11-19 00:08:17,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:08:17,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:08:17,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:17,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:08:17,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:17,219 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:08:17,219 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:08:17,219 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-19 00:08:17,233 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-19 00:08:17,256 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-19 00:08:17,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:08:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:08:17,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:08:17,612 INFO L256 TraceCheckUtils]: 0: Hoare triple {1484#true} call ULTIMATE.init(); {1484#true} is VALID [2018-11-19 00:08:17,613 INFO L273 TraceCheckUtils]: 1: Hoare triple {1484#true} ~__return_main~0 := 0;~__return_96~0 := 0; {1484#true} is VALID [2018-11-19 00:08:17,613 INFO L273 TraceCheckUtils]: 2: Hoare triple {1484#true} assume true; {1484#true} is VALID [2018-11-19 00:08:17,613 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1484#true} {1484#true} #48#return; {1484#true} is VALID [2018-11-19 00:08:17,614 INFO L256 TraceCheckUtils]: 4: Hoare triple {1484#true} call #t~ret2 := main(); {1484#true} is VALID [2018-11-19 00:08:17,614 INFO L273 TraceCheckUtils]: 5: Hoare triple {1484#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; {1484#true} is VALID [2018-11-19 00:08:17,614 INFO L273 TraceCheckUtils]: 6: Hoare triple {1484#true} assume !!(1 <= ~main__n~0); {1484#true} is VALID [2018-11-19 00:08:17,615 INFO L273 TraceCheckUtils]: 7: Hoare triple {1484#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1510#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:08:17,616 INFO L273 TraceCheckUtils]: 8: Hoare triple {1510#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1514#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-19 00:08:17,617 INFO L273 TraceCheckUtils]: 9: Hoare triple {1514#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1518#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:08:17,618 INFO L273 TraceCheckUtils]: 10: Hoare triple {1518#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1522#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:08:17,619 INFO L273 TraceCheckUtils]: 11: Hoare triple {1522#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1526#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:08:17,620 INFO L273 TraceCheckUtils]: 12: Hoare triple {1526#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1530#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:08:17,621 INFO L273 TraceCheckUtils]: 13: Hoare triple {1530#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1534#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:08:17,622 INFO L273 TraceCheckUtils]: 14: Hoare triple {1534#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1538#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:08:17,623 INFO L273 TraceCheckUtils]: 15: Hoare triple {1538#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1542#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:08:17,624 INFO L273 TraceCheckUtils]: 16: Hoare triple {1542#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1546#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-19 00:08:17,625 INFO L273 TraceCheckUtils]: 17: Hoare triple {1546#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1550#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-19 00:08:17,626 INFO L273 TraceCheckUtils]: 18: Hoare triple {1550#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1554#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-19 00:08:17,627 INFO L273 TraceCheckUtils]: 19: Hoare triple {1554#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1558#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-19 00:08:17,628 INFO L273 TraceCheckUtils]: 20: Hoare triple {1558#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1562#(and (<= main_~main__i~0 14) (= main_~main__sum~0 91) (<= 13 main_~main__n~0))} is VALID [2018-11-19 00:08:17,630 INFO L273 TraceCheckUtils]: 21: Hoare triple {1562#(and (<= main_~main__i~0 14) (= main_~main__sum~0 91) (<= 13 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1566#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:08:17,630 INFO L273 TraceCheckUtils]: 22: Hoare triple {1566#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {1485#false} is VALID [2018-11-19 00:08:17,631 INFO L273 TraceCheckUtils]: 23: Hoare triple {1485#false} assume !false; {1485#false} is VALID [2018-11-19 00:08:17,632 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-19 00:08:17,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:08:17,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-11-19 00:08:17,651 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2018-11-19 00:08:17,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:08:17,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-19 00:08:17,692 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-19 00:08:17,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-19 00:08:17,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-19 00:08:17,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-11-19 00:08:17,693 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 17 states. [2018-11-19 00:08:18,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:18,489 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-19 00:08:18,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-19 00:08:18,489 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2018-11-19 00:08:18,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:08:18,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-19 00:08:18,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. [2018-11-19 00:08:18,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-19 00:08:18,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. [2018-11-19 00:08:18,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 29 transitions. [2018-11-19 00:08:18,558 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-19 00:08:18,559 INFO L225 Difference]: With dead ends: 29 [2018-11-19 00:08:18,559 INFO L226 Difference]: Without dead ends: 26 [2018-11-19 00:08:18,560 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-19 00:08:18,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-19 00:08:18,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-19 00:08:18,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:08:18,586 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-19 00:08:18,587 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-19 00:08:18,587 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-19 00:08:18,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:18,588 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-19 00:08:18,588 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-19 00:08:18,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:18,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:18,589 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-19 00:08:18,589 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-19 00:08:18,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:18,590 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-19 00:08:18,590 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-19 00:08:18,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:18,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:18,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:08:18,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:08:18,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-19 00:08:18,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-11-19 00:08:18,593 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-11-19 00:08:18,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:08:18,593 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-11-19 00:08:18,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-19 00:08:18,593 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-19 00:08:18,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-19 00:08:18,594 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:08:18,594 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:08:18,594 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:08:18,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:08:18,595 INFO L82 PathProgramCache]: Analyzing trace with hash 201139776, now seen corresponding path program 9 times [2018-11-19 00:08:18,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:08:18,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:08:18,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:18,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:08:18,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:18,608 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:08:18,608 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:08:18,608 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-19 00:08:18,632 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-19 00:08:18,678 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-19 00:08:18,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:08:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:08:18,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:08:19,092 INFO L256 TraceCheckUtils]: 0: Hoare triple {1709#true} call ULTIMATE.init(); {1709#true} is VALID [2018-11-19 00:08:19,092 INFO L273 TraceCheckUtils]: 1: Hoare triple {1709#true} ~__return_main~0 := 0;~__return_96~0 := 0; {1709#true} is VALID [2018-11-19 00:08:19,093 INFO L273 TraceCheckUtils]: 2: Hoare triple {1709#true} assume true; {1709#true} is VALID [2018-11-19 00:08:19,093 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1709#true} {1709#true} #48#return; {1709#true} is VALID [2018-11-19 00:08:19,093 INFO L256 TraceCheckUtils]: 4: Hoare triple {1709#true} call #t~ret2 := main(); {1709#true} is VALID [2018-11-19 00:08:19,094 INFO L273 TraceCheckUtils]: 5: Hoare triple {1709#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; {1709#true} is VALID [2018-11-19 00:08:19,094 INFO L273 TraceCheckUtils]: 6: Hoare triple {1709#true} assume !!(1 <= ~main__n~0); {1709#true} is VALID [2018-11-19 00:08:19,095 INFO L273 TraceCheckUtils]: 7: Hoare triple {1709#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1735#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:08:19,096 INFO L273 TraceCheckUtils]: 8: Hoare triple {1735#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1739#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-19 00:08:19,097 INFO L273 TraceCheckUtils]: 9: Hoare triple {1739#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1743#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:08:19,098 INFO L273 TraceCheckUtils]: 10: Hoare triple {1743#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1747#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:08:19,098 INFO L273 TraceCheckUtils]: 11: Hoare triple {1747#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1751#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:08:19,100 INFO L273 TraceCheckUtils]: 12: Hoare triple {1751#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1755#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:08:19,101 INFO L273 TraceCheckUtils]: 13: Hoare triple {1755#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1759#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:08:19,101 INFO L273 TraceCheckUtils]: 14: Hoare triple {1759#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1763#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:08:19,102 INFO L273 TraceCheckUtils]: 15: Hoare triple {1763#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1767#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:08:19,103 INFO L273 TraceCheckUtils]: 16: Hoare triple {1767#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1771#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-19 00:08:19,104 INFO L273 TraceCheckUtils]: 17: Hoare triple {1771#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1775#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-19 00:08:19,105 INFO L273 TraceCheckUtils]: 18: Hoare triple {1775#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1779#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-19 00:08:19,106 INFO L273 TraceCheckUtils]: 19: Hoare triple {1779#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1783#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-19 00:08:19,107 INFO L273 TraceCheckUtils]: 20: Hoare triple {1783#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1787#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-19 00:08:19,108 INFO L273 TraceCheckUtils]: 21: Hoare triple {1787#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1791#(and (<= main_~main__i~0 15) (= main_~main__sum~0 105) (<= 14 main_~main__n~0))} is VALID [2018-11-19 00:08:19,110 INFO L273 TraceCheckUtils]: 22: Hoare triple {1791#(and (<= main_~main__i~0 15) (= main_~main__sum~0 105) (<= 14 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1795#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:08:19,117 INFO L273 TraceCheckUtils]: 23: Hoare triple {1795#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {1710#false} is VALID [2018-11-19 00:08:19,117 INFO L273 TraceCheckUtils]: 24: Hoare triple {1710#false} assume !false; {1710#false} is VALID [2018-11-19 00:08:19,119 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-19 00:08:19,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:08:19,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-11-19 00:08:19,138 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2018-11-19 00:08:19,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:08:19,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-19 00:08:19,168 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-19 00:08:19,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-19 00:08:19,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-19 00:08:19,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-11-19 00:08:19,169 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 18 states. [2018-11-19 00:08:20,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:20,038 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-19 00:08:20,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-19 00:08:20,038 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2018-11-19 00:08:20,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:08:20,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-19 00:08:20,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 30 transitions. [2018-11-19 00:08:20,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-19 00:08:20,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 30 transitions. [2018-11-19 00:08:20,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 30 transitions. [2018-11-19 00:08:20,091 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-19 00:08:20,093 INFO L225 Difference]: With dead ends: 30 [2018-11-19 00:08:20,093 INFO L226 Difference]: Without dead ends: 27 [2018-11-19 00:08:20,094 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2018-11-19 00:08:20,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-19 00:08:20,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-19 00:08:20,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:08:20,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-19 00:08:20,120 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-19 00:08:20,120 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-19 00:08:20,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:20,122 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-19 00:08:20,122 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-19 00:08:20,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:20,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:20,123 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-19 00:08:20,123 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-19 00:08:20,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:20,124 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-19 00:08:20,124 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-19 00:08:20,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:20,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:20,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:08:20,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:08:20,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-19 00:08:20,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-19 00:08:20,126 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-11-19 00:08:20,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:08:20,126 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-19 00:08:20,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-19 00:08:20,127 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-19 00:08:20,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-19 00:08:20,127 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:08:20,127 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:08:20,128 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:08:20,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:08:20,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1940303302, now seen corresponding path program 10 times [2018-11-19 00:08:20,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:08:20,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:08:20,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:20,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:08:20,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:20,142 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:08:20,142 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:08:20,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 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-19 00:08:20,169 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-19 00:08:20,347 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-19 00:08:20,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:08:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:08:20,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:08:22,113 INFO L256 TraceCheckUtils]: 0: Hoare triple {1944#true} call ULTIMATE.init(); {1944#true} is VALID [2018-11-19 00:08:22,113 INFO L273 TraceCheckUtils]: 1: Hoare triple {1944#true} ~__return_main~0 := 0;~__return_96~0 := 0; {1944#true} is VALID [2018-11-19 00:08:22,113 INFO L273 TraceCheckUtils]: 2: Hoare triple {1944#true} assume true; {1944#true} is VALID [2018-11-19 00:08:22,114 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1944#true} {1944#true} #48#return; {1944#true} is VALID [2018-11-19 00:08:22,114 INFO L256 TraceCheckUtils]: 4: Hoare triple {1944#true} call #t~ret2 := main(); {1944#true} is VALID [2018-11-19 00:08:22,114 INFO L273 TraceCheckUtils]: 5: Hoare triple {1944#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; {1944#true} is VALID [2018-11-19 00:08:22,115 INFO L273 TraceCheckUtils]: 6: Hoare triple {1944#true} assume !!(1 <= ~main__n~0); {1944#true} is VALID [2018-11-19 00:08:22,130 INFO L273 TraceCheckUtils]: 7: Hoare triple {1944#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1970#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:08:22,139 INFO L273 TraceCheckUtils]: 8: Hoare triple {1970#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1974#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-19 00:08:22,155 INFO L273 TraceCheckUtils]: 9: Hoare triple {1974#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1978#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:08:22,164 INFO L273 TraceCheckUtils]: 10: Hoare triple {1978#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1982#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:08:22,179 INFO L273 TraceCheckUtils]: 11: Hoare triple {1982#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1986#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:08:22,180 INFO L273 TraceCheckUtils]: 12: Hoare triple {1986#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1990#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:08:22,181 INFO L273 TraceCheckUtils]: 13: Hoare triple {1990#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1994#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:08:22,181 INFO L273 TraceCheckUtils]: 14: Hoare triple {1994#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1998#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:08:22,182 INFO L273 TraceCheckUtils]: 15: Hoare triple {1998#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2002#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:08:22,183 INFO L273 TraceCheckUtils]: 16: Hoare triple {2002#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2006#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-19 00:08:22,183 INFO L273 TraceCheckUtils]: 17: Hoare triple {2006#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2010#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-19 00:08:22,187 INFO L273 TraceCheckUtils]: 18: Hoare triple {2010#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2014#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-19 00:08:22,187 INFO L273 TraceCheckUtils]: 19: Hoare triple {2014#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2018#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-19 00:08:22,188 INFO L273 TraceCheckUtils]: 20: Hoare triple {2018#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2022#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-19 00:08:22,189 INFO L273 TraceCheckUtils]: 21: Hoare triple {2022#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2026#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-19 00:08:22,189 INFO L273 TraceCheckUtils]: 22: Hoare triple {2026#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2030#(and (<= 15 main_~main__n~0) (<= main_~main__i~0 16) (= main_~main__sum~0 120))} is VALID [2018-11-19 00:08:22,190 INFO L273 TraceCheckUtils]: 23: Hoare triple {2030#(and (<= 15 main_~main__n~0) (<= main_~main__i~0 16) (= main_~main__sum~0 120))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2034#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:08:22,190 INFO L273 TraceCheckUtils]: 24: Hoare triple {2034#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {1945#false} is VALID [2018-11-19 00:08:22,191 INFO L273 TraceCheckUtils]: 25: Hoare triple {1945#false} assume !false; {1945#false} is VALID [2018-11-19 00:08:22,192 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-19 00:08:22,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:08:22,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-11-19 00:08:22,212 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 26 [2018-11-19 00:08:22,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:08:22,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-19 00:08:22,239 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-19 00:08:22,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-19 00:08:22,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-19 00:08:22,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-11-19 00:08:22,240 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 19 states. [2018-11-19 00:08:23,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:23,115 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-19 00:08:23,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-19 00:08:23,115 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 26 [2018-11-19 00:08:23,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:08:23,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-19 00:08:23,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 31 transitions. [2018-11-19 00:08:23,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-19 00:08:23,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 31 transitions. [2018-11-19 00:08:23,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 31 transitions. [2018-11-19 00:08:23,151 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-19 00:08:23,152 INFO L225 Difference]: With dead ends: 31 [2018-11-19 00:08:23,152 INFO L226 Difference]: Without dead ends: 28 [2018-11-19 00:08:23,153 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2018-11-19 00:08:23,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-19 00:08:23,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-19 00:08:23,180 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:08:23,180 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-19 00:08:23,180 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-19 00:08:23,180 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-19 00:08:23,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:23,182 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-19 00:08:23,182 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-19 00:08:23,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:23,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:23,183 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-19 00:08:23,183 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-19 00:08:23,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:23,184 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-19 00:08:23,184 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-19 00:08:23,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:23,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:23,185 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:08:23,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:08:23,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-19 00:08:23,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-11-19 00:08:23,186 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-11-19 00:08:23,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:08:23,186 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-11-19 00:08:23,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-19 00:08:23,186 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-19 00:08:23,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-19 00:08:23,187 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:08:23,187 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:08:23,187 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:08:23,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:08:23,188 INFO L82 PathProgramCache]: Analyzing trace with hash 19797760, now seen corresponding path program 11 times [2018-11-19 00:08:23,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:08:23,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:08:23,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:23,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:08:23,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:23,200 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:08:23,200 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:08:23,201 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-19 00:08:23,212 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-19 00:08:23,238 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-19 00:08:23,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:08:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:08:23,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:08:23,685 INFO L256 TraceCheckUtils]: 0: Hoare triple {2189#true} call ULTIMATE.init(); {2189#true} is VALID [2018-11-19 00:08:23,685 INFO L273 TraceCheckUtils]: 1: Hoare triple {2189#true} ~__return_main~0 := 0;~__return_96~0 := 0; {2189#true} is VALID [2018-11-19 00:08:23,685 INFO L273 TraceCheckUtils]: 2: Hoare triple {2189#true} assume true; {2189#true} is VALID [2018-11-19 00:08:23,685 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2189#true} {2189#true} #48#return; {2189#true} is VALID [2018-11-19 00:08:23,686 INFO L256 TraceCheckUtils]: 4: Hoare triple {2189#true} call #t~ret2 := main(); {2189#true} is VALID [2018-11-19 00:08:23,686 INFO L273 TraceCheckUtils]: 5: Hoare triple {2189#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; {2189#true} is VALID [2018-11-19 00:08:23,686 INFO L273 TraceCheckUtils]: 6: Hoare triple {2189#true} assume !!(1 <= ~main__n~0); {2189#true} is VALID [2018-11-19 00:08:23,687 INFO L273 TraceCheckUtils]: 7: Hoare triple {2189#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2215#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:08:23,688 INFO L273 TraceCheckUtils]: 8: Hoare triple {2215#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2219#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-19 00:08:23,688 INFO L273 TraceCheckUtils]: 9: Hoare triple {2219#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2223#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:08:23,689 INFO L273 TraceCheckUtils]: 10: Hoare triple {2223#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2227#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:08:23,689 INFO L273 TraceCheckUtils]: 11: Hoare triple {2227#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2231#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:08:23,690 INFO L273 TraceCheckUtils]: 12: Hoare triple {2231#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2235#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:08:23,691 INFO L273 TraceCheckUtils]: 13: Hoare triple {2235#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2239#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:08:23,692 INFO L273 TraceCheckUtils]: 14: Hoare triple {2239#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2243#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:08:23,693 INFO L273 TraceCheckUtils]: 15: Hoare triple {2243#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2247#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:08:23,694 INFO L273 TraceCheckUtils]: 16: Hoare triple {2247#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2251#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-19 00:08:23,695 INFO L273 TraceCheckUtils]: 17: Hoare triple {2251#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2255#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-19 00:08:23,698 INFO L273 TraceCheckUtils]: 18: Hoare triple {2255#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2259#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-19 00:08:23,699 INFO L273 TraceCheckUtils]: 19: Hoare triple {2259#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2263#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-19 00:08:23,700 INFO L273 TraceCheckUtils]: 20: Hoare triple {2263#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2267#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-19 00:08:23,701 INFO L273 TraceCheckUtils]: 21: Hoare triple {2267#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2271#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-19 00:08:23,702 INFO L273 TraceCheckUtils]: 22: Hoare triple {2271#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2275#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-19 00:08:23,705 INFO L273 TraceCheckUtils]: 23: Hoare triple {2275#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2279#(and (= main_~main__sum~0 136) (<= 16 main_~main__n~0) (<= main_~main__i~0 17))} is VALID [2018-11-19 00:08:23,709 INFO L273 TraceCheckUtils]: 24: Hoare triple {2279#(and (= main_~main__sum~0 136) (<= 16 main_~main__n~0) (<= main_~main__i~0 17))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2283#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:08:23,710 INFO L273 TraceCheckUtils]: 25: Hoare triple {2283#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {2190#false} is VALID [2018-11-19 00:08:23,710 INFO L273 TraceCheckUtils]: 26: Hoare triple {2190#false} assume !false; {2190#false} is VALID [2018-11-19 00:08:23,711 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-19 00:08:23,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:08:23,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-11-19 00:08:23,731 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2018-11-19 00:08:23,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:08:23,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-19 00:08:23,758 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-19 00:08:23,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-19 00:08:23,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-19 00:08:23,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-11-19 00:08:23,759 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 20 states. [2018-11-19 00:08:25,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:25,155 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-19 00:08:25,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-19 00:08:25,155 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2018-11-19 00:08:25,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:08:25,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-19 00:08:25,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 32 transitions. [2018-11-19 00:08:25,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-19 00:08:25,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 32 transitions. [2018-11-19 00:08:25,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 32 transitions. [2018-11-19 00:08:25,190 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-19 00:08:25,191 INFO L225 Difference]: With dead ends: 32 [2018-11-19 00:08:25,191 INFO L226 Difference]: Without dead ends: 29 [2018-11-19 00:08:25,192 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-19 00:08:25,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-19 00:08:25,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-19 00:08:25,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:08:25,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-19 00:08:25,233 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-19 00:08:25,233 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-19 00:08:25,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:25,235 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-19 00:08:25,235 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-19 00:08:25,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:25,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:25,235 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-19 00:08:25,235 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-19 00:08:25,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:25,236 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-19 00:08:25,236 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-19 00:08:25,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:25,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:25,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:08:25,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:08:25,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-19 00:08:25,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-11-19 00:08:25,237 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-11-19 00:08:25,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:08:25,238 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-11-19 00:08:25,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-19 00:08:25,238 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-19 00:08:25,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-19 00:08:25,238 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:08:25,239 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:08:25,239 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:08:25,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:08:25,239 INFO L82 PathProgramCache]: Analyzing trace with hash 613668102, now seen corresponding path program 12 times [2018-11-19 00:08:25,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:08:25,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:08:25,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:25,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:08:25,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:25,250 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:08:25,251 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:08:25,251 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-19 00:08:25,267 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-19 00:08:25,317 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-19 00:08:25,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:08:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:08:25,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:08:26,020 INFO L256 TraceCheckUtils]: 0: Hoare triple {2444#true} call ULTIMATE.init(); {2444#true} is VALID [2018-11-19 00:08:26,020 INFO L273 TraceCheckUtils]: 1: Hoare triple {2444#true} ~__return_main~0 := 0;~__return_96~0 := 0; {2444#true} is VALID [2018-11-19 00:08:26,021 INFO L273 TraceCheckUtils]: 2: Hoare triple {2444#true} assume true; {2444#true} is VALID [2018-11-19 00:08:26,021 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2444#true} {2444#true} #48#return; {2444#true} is VALID [2018-11-19 00:08:26,021 INFO L256 TraceCheckUtils]: 4: Hoare triple {2444#true} call #t~ret2 := main(); {2444#true} is VALID [2018-11-19 00:08:26,022 INFO L273 TraceCheckUtils]: 5: Hoare triple {2444#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; {2444#true} is VALID [2018-11-19 00:08:26,023 INFO L273 TraceCheckUtils]: 6: Hoare triple {2444#true} assume !!(1 <= ~main__n~0); {2467#(<= 1 main_~main__n~0)} is VALID [2018-11-19 00:08:26,024 INFO L273 TraceCheckUtils]: 7: Hoare triple {2467#(<= 1 main_~main__n~0)} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2471#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0) (<= 1 main_~main__n~0))} is VALID [2018-11-19 00:08:26,025 INFO L273 TraceCheckUtils]: 8: Hoare triple {2471#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2475#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0) (<= 1 main_~main__n~0))} is VALID [2018-11-19 00:08:26,027 INFO L273 TraceCheckUtils]: 9: Hoare triple {2475#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2479#(and (= main_~main__sum~0 3) (<= 1 main_~main__n~0) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:08:26,028 INFO L273 TraceCheckUtils]: 10: Hoare triple {2479#(and (= main_~main__sum~0 3) (<= 1 main_~main__n~0) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2483#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6) (<= 1 main_~main__n~0))} is VALID [2018-11-19 00:08:26,033 INFO L273 TraceCheckUtils]: 11: Hoare triple {2483#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2487#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10) (<= 1 main_~main__n~0))} is VALID [2018-11-19 00:08:26,033 INFO L273 TraceCheckUtils]: 12: Hoare triple {2487#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2491#(and (<= 1 main_~main__n~0) (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:08:26,035 INFO L273 TraceCheckUtils]: 13: Hoare triple {2491#(and (<= 1 main_~main__n~0) (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2495#(and (= main_~main__sum~0 21) (<= 1 main_~main__n~0) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:08:26,035 INFO L273 TraceCheckUtils]: 14: Hoare triple {2495#(and (= main_~main__sum~0 21) (<= 1 main_~main__n~0) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2499#(and (= 8 main_~main__i~0) (<= 1 main_~main__n~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:08:26,037 INFO L273 TraceCheckUtils]: 15: Hoare triple {2499#(and (= 8 main_~main__i~0) (<= 1 main_~main__n~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2503#(and (<= 1 main_~main__n~0) (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:08:26,038 INFO L273 TraceCheckUtils]: 16: Hoare triple {2503#(and (<= 1 main_~main__n~0) (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2507#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45) (<= 1 main_~main__n~0))} is VALID [2018-11-19 00:08:26,039 INFO L273 TraceCheckUtils]: 17: Hoare triple {2507#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2511#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0) (<= 1 main_~main__n~0))} is VALID [2018-11-19 00:08:26,040 INFO L273 TraceCheckUtils]: 18: Hoare triple {2511#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2515#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66) (<= 1 main_~main__n~0))} is VALID [2018-11-19 00:08:26,041 INFO L273 TraceCheckUtils]: 19: Hoare triple {2515#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2519#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78) (<= 1 main_~main__n~0))} is VALID [2018-11-19 00:08:26,042 INFO L273 TraceCheckUtils]: 20: Hoare triple {2519#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2523#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0) (<= 1 main_~main__n~0))} is VALID [2018-11-19 00:08:26,043 INFO L273 TraceCheckUtils]: 21: Hoare triple {2523#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2527#(and (= main_~main__sum~0 105) (<= 1 main_~main__n~0) (= 15 main_~main__i~0))} is VALID [2018-11-19 00:08:26,047 INFO L273 TraceCheckUtils]: 22: Hoare triple {2527#(and (= main_~main__sum~0 105) (<= 1 main_~main__n~0) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2531#(and (= main_~main__sum~0 120) (<= 1 main_~main__n~0) (= 16 main_~main__i~0))} is VALID [2018-11-19 00:08:26,048 INFO L273 TraceCheckUtils]: 23: Hoare triple {2531#(and (= main_~main__sum~0 120) (<= 1 main_~main__n~0) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2535#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0) (<= 1 main_~main__n~0))} is VALID [2018-11-19 00:08:26,049 INFO L273 TraceCheckUtils]: 24: Hoare triple {2535#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2539#(and (= main_~main__sum~0 153) (<= 17 main_~main__n~0) (= 18 main_~main__i~0))} is VALID [2018-11-19 00:08:26,049 INFO L273 TraceCheckUtils]: 25: Hoare triple {2539#(and (= main_~main__sum~0 153) (<= 17 main_~main__n~0) (= 18 main_~main__i~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2543#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:08:26,051 INFO L273 TraceCheckUtils]: 26: Hoare triple {2543#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {2445#false} is VALID [2018-11-19 00:08:26,051 INFO L273 TraceCheckUtils]: 27: Hoare triple {2445#false} assume !false; {2445#false} is VALID [2018-11-19 00:08:26,053 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-19 00:08:26,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:08:26,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-11-19 00:08:26,083 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2018-11-19 00:08:26,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:08:26,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-19 00:08:26,117 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-19 00:08:26,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-19 00:08:26,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-19 00:08:26,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2018-11-19 00:08:26,118 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 22 states. [2018-11-19 00:08:27,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:27,368 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-19 00:08:27,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-19 00:08:27,369 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2018-11-19 00:08:27,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:08:27,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-19 00:08:27,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 33 transitions. [2018-11-19 00:08:27,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-19 00:08:27,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 33 transitions. [2018-11-19 00:08:27,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 33 transitions. [2018-11-19 00:08:27,415 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-19 00:08:27,416 INFO L225 Difference]: With dead ends: 33 [2018-11-19 00:08:27,417 INFO L226 Difference]: Without dead ends: 30 [2018-11-19 00:08:27,418 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2018-11-19 00:08:27,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-19 00:08:27,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-19 00:08:27,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:08:27,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2018-11-19 00:08:27,467 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-19 00:08:27,467 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-19 00:08:27,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:27,469 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-19 00:08:27,469 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-19 00:08:27,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:27,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:27,469 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-19 00:08:27,470 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-19 00:08:27,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:27,471 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-19 00:08:27,471 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-19 00:08:27,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:27,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:27,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:08:27,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:08:27,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-19 00:08:27,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-19 00:08:27,472 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-11-19 00:08:27,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:08:27,473 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-19 00:08:27,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-19 00:08:27,473 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-19 00:08:27,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-19 00:08:27,473 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:08:27,474 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:08:27,474 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:08:27,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:08:27,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1843779520, now seen corresponding path program 13 times [2018-11-19 00:08:27,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:08:27,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:08:27,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:27,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:08:27,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:27,488 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:08:27,488 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:08:27,488 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-19 00:08:27,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:08:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:08:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:08:27,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:08:28,218 INFO L256 TraceCheckUtils]: 0: Hoare triple {2710#true} call ULTIMATE.init(); {2710#true} is VALID [2018-11-19 00:08:28,218 INFO L273 TraceCheckUtils]: 1: Hoare triple {2710#true} ~__return_main~0 := 0;~__return_96~0 := 0; {2710#true} is VALID [2018-11-19 00:08:28,218 INFO L273 TraceCheckUtils]: 2: Hoare triple {2710#true} assume true; {2710#true} is VALID [2018-11-19 00:08:28,219 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2710#true} {2710#true} #48#return; {2710#true} is VALID [2018-11-19 00:08:28,219 INFO L256 TraceCheckUtils]: 4: Hoare triple {2710#true} call #t~ret2 := main(); {2710#true} is VALID [2018-11-19 00:08:28,219 INFO L273 TraceCheckUtils]: 5: Hoare triple {2710#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; {2710#true} is VALID [2018-11-19 00:08:28,219 INFO L273 TraceCheckUtils]: 6: Hoare triple {2710#true} assume !!(1 <= ~main__n~0); {2710#true} is VALID [2018-11-19 00:08:28,220 INFO L273 TraceCheckUtils]: 7: Hoare triple {2710#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2736#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:08:28,220 INFO L273 TraceCheckUtils]: 8: Hoare triple {2736#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2740#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-19 00:08:28,221 INFO L273 TraceCheckUtils]: 9: Hoare triple {2740#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2744#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:08:28,222 INFO L273 TraceCheckUtils]: 10: Hoare triple {2744#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2748#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:08:28,222 INFO L273 TraceCheckUtils]: 11: Hoare triple {2748#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2752#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:08:28,225 INFO L273 TraceCheckUtils]: 12: Hoare triple {2752#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2756#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:08:28,226 INFO L273 TraceCheckUtils]: 13: Hoare triple {2756#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2760#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:08:28,227 INFO L273 TraceCheckUtils]: 14: Hoare triple {2760#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2764#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:08:28,228 INFO L273 TraceCheckUtils]: 15: Hoare triple {2764#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2768#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:08:28,228 INFO L273 TraceCheckUtils]: 16: Hoare triple {2768#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2772#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-19 00:08:28,229 INFO L273 TraceCheckUtils]: 17: Hoare triple {2772#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2776#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-19 00:08:28,229 INFO L273 TraceCheckUtils]: 18: Hoare triple {2776#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2780#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-19 00:08:28,230 INFO L273 TraceCheckUtils]: 19: Hoare triple {2780#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2784#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-19 00:08:28,231 INFO L273 TraceCheckUtils]: 20: Hoare triple {2784#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2788#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-19 00:08:28,233 INFO L273 TraceCheckUtils]: 21: Hoare triple {2788#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2792#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-19 00:08:28,234 INFO L273 TraceCheckUtils]: 22: Hoare triple {2792#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2796#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-19 00:08:28,235 INFO L273 TraceCheckUtils]: 23: Hoare triple {2796#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2800#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-19 00:08:28,236 INFO L273 TraceCheckUtils]: 24: Hoare triple {2800#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2804#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-19 00:08:28,237 INFO L273 TraceCheckUtils]: 25: Hoare triple {2804#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2808#(and (<= main_~main__i~0 19) (<= 18 main_~main__n~0) (= main_~main__sum~0 171))} is VALID [2018-11-19 00:08:28,238 INFO L273 TraceCheckUtils]: 26: Hoare triple {2808#(and (<= main_~main__i~0 19) (<= 18 main_~main__n~0) (= main_~main__sum~0 171))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2812#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:08:28,239 INFO L273 TraceCheckUtils]: 27: Hoare triple {2812#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {2711#false} is VALID [2018-11-19 00:08:28,239 INFO L273 TraceCheckUtils]: 28: Hoare triple {2711#false} assume !false; {2711#false} is VALID [2018-11-19 00:08:28,241 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-19 00:08:28,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:08:28,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-11-19 00:08:28,261 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2018-11-19 00:08:28,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:08:28,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-19 00:08:28,290 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-19 00:08:28,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-19 00:08:28,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-19 00:08:28,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-11-19 00:08:28,291 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 22 states. [2018-11-19 00:08:29,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:29,490 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-19 00:08:29,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-19 00:08:29,490 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2018-11-19 00:08:29,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:08:29,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-19 00:08:29,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 34 transitions. [2018-11-19 00:08:29,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-19 00:08:29,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 34 transitions. [2018-11-19 00:08:29,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 34 transitions. [2018-11-19 00:08:29,525 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-19 00:08:29,526 INFO L225 Difference]: With dead ends: 34 [2018-11-19 00:08:29,526 INFO L226 Difference]: Without dead ends: 31 [2018-11-19 00:08:29,527 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-19 00:08:29,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-19 00:08:29,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-19 00:08:29,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:08:29,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-19 00:08:29,569 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-19 00:08:29,570 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-19 00:08:29,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:29,571 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-19 00:08:29,571 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-19 00:08:29,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:29,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:29,572 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-19 00:08:29,572 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-19 00:08:29,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:29,573 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-19 00:08:29,573 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-19 00:08:29,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:29,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:29,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:08:29,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:08:29,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-19 00:08:29,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-11-19 00:08:29,574 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-11-19 00:08:29,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:08:29,575 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-11-19 00:08:29,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-19 00:08:29,575 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-19 00:08:29,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-19 00:08:29,575 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:08:29,575 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:08:29,576 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:08:29,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:08:29,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1322527814, now seen corresponding path program 14 times [2018-11-19 00:08:29,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:08:29,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:08:29,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:29,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:08:29,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:29,589 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:08:29,589 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:08:29,589 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-19 00:08:29,602 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-19 00:08:29,630 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-19 00:08:29,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:08:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:08:29,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:08:30,143 INFO L256 TraceCheckUtils]: 0: Hoare triple {2985#true} call ULTIMATE.init(); {2985#true} is VALID [2018-11-19 00:08:30,143 INFO L273 TraceCheckUtils]: 1: Hoare triple {2985#true} ~__return_main~0 := 0;~__return_96~0 := 0; {2985#true} is VALID [2018-11-19 00:08:30,144 INFO L273 TraceCheckUtils]: 2: Hoare triple {2985#true} assume true; {2985#true} is VALID [2018-11-19 00:08:30,144 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2985#true} {2985#true} #48#return; {2985#true} is VALID [2018-11-19 00:08:30,144 INFO L256 TraceCheckUtils]: 4: Hoare triple {2985#true} call #t~ret2 := main(); {2985#true} is VALID [2018-11-19 00:08:30,144 INFO L273 TraceCheckUtils]: 5: Hoare triple {2985#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; {2985#true} is VALID [2018-11-19 00:08:30,145 INFO L273 TraceCheckUtils]: 6: Hoare triple {2985#true} assume !!(1 <= ~main__n~0); {2985#true} is VALID [2018-11-19 00:08:30,150 INFO L273 TraceCheckUtils]: 7: Hoare triple {2985#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {3011#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:08:30,151 INFO L273 TraceCheckUtils]: 8: Hoare triple {3011#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3015#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-19 00:08:30,152 INFO L273 TraceCheckUtils]: 9: Hoare triple {3015#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3019#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:08:30,152 INFO L273 TraceCheckUtils]: 10: Hoare triple {3019#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3023#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:08:30,153 INFO L273 TraceCheckUtils]: 11: Hoare triple {3023#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3027#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:08:30,153 INFO L273 TraceCheckUtils]: 12: Hoare triple {3027#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3031#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:08:30,154 INFO L273 TraceCheckUtils]: 13: Hoare triple {3031#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3035#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:08:30,155 INFO L273 TraceCheckUtils]: 14: Hoare triple {3035#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3039#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:08:30,155 INFO L273 TraceCheckUtils]: 15: Hoare triple {3039#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3043#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:08:30,161 INFO L273 TraceCheckUtils]: 16: Hoare triple {3043#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3047#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-19 00:08:30,162 INFO L273 TraceCheckUtils]: 17: Hoare triple {3047#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3051#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-19 00:08:30,162 INFO L273 TraceCheckUtils]: 18: Hoare triple {3051#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3055#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-19 00:08:30,163 INFO L273 TraceCheckUtils]: 19: Hoare triple {3055#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3059#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-19 00:08:30,163 INFO L273 TraceCheckUtils]: 20: Hoare triple {3059#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3063#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-19 00:08:30,164 INFO L273 TraceCheckUtils]: 21: Hoare triple {3063#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3067#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-19 00:08:30,165 INFO L273 TraceCheckUtils]: 22: Hoare triple {3067#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3071#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-19 00:08:30,165 INFO L273 TraceCheckUtils]: 23: Hoare triple {3071#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3075#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-19 00:08:30,166 INFO L273 TraceCheckUtils]: 24: Hoare triple {3075#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3079#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-19 00:08:30,167 INFO L273 TraceCheckUtils]: 25: Hoare triple {3079#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3083#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-19 00:08:30,168 INFO L273 TraceCheckUtils]: 26: Hoare triple {3083#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3087#(and (<= main_~main__i~0 20) (= main_~main__sum~0 190) (<= 19 main_~main__n~0))} is VALID [2018-11-19 00:08:30,169 INFO L273 TraceCheckUtils]: 27: Hoare triple {3087#(and (<= main_~main__i~0 20) (= main_~main__sum~0 190) (<= 19 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3091#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:08:30,170 INFO L273 TraceCheckUtils]: 28: Hoare triple {3091#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {2986#false} is VALID [2018-11-19 00:08:30,170 INFO L273 TraceCheckUtils]: 29: Hoare triple {2986#false} assume !false; {2986#false} is VALID [2018-11-19 00:08:30,173 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-19 00:08:30,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:08:30,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-11-19 00:08:30,192 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-11-19 00:08:30,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:08:30,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-19 00:08:30,225 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-19 00:08:30,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-19 00:08:30,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-19 00:08:30,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-11-19 00:08:30,227 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 23 states. [2018-11-19 00:08:32,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:32,087 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-19 00:08:32,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-19 00:08:32,087 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-11-19 00:08:32,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:08:32,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-19 00:08:32,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2018-11-19 00:08:32,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-19 00:08:32,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2018-11-19 00:08:32,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 35 transitions. [2018-11-19 00:08:32,194 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-19 00:08:32,195 INFO L225 Difference]: With dead ends: 35 [2018-11-19 00:08:32,195 INFO L226 Difference]: Without dead ends: 32 [2018-11-19 00:08:32,196 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-19 00:08:32,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-19 00:08:32,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-19 00:08:32,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:08:32,239 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2018-11-19 00:08:32,239 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-19 00:08:32,240 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-19 00:08:32,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:32,241 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-19 00:08:32,241 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-19 00:08:32,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:32,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:32,242 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-19 00:08:32,242 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-19 00:08:32,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:32,243 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-19 00:08:32,243 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-19 00:08:32,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:32,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:32,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:08:32,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:08:32,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-19 00:08:32,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-11-19 00:08:32,244 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-11-19 00:08:32,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:08:32,244 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-11-19 00:08:32,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-19 00:08:32,244 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-19 00:08:32,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-19 00:08:32,245 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:08:32,245 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:08:32,245 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:08:32,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:08:32,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1951373184, now seen corresponding path program 15 times [2018-11-19 00:08:32,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:08:32,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:08:32,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:32,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:08:32,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:32,257 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:08:32,257 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:08:32,257 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-19 00:08:32,277 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-19 00:08:32,396 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-19 00:08:32,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:08:32,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:08:32,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:08:32,903 INFO L256 TraceCheckUtils]: 0: Hoare triple {3270#true} call ULTIMATE.init(); {3270#true} is VALID [2018-11-19 00:08:32,903 INFO L273 TraceCheckUtils]: 1: Hoare triple {3270#true} ~__return_main~0 := 0;~__return_96~0 := 0; {3270#true} is VALID [2018-11-19 00:08:32,903 INFO L273 TraceCheckUtils]: 2: Hoare triple {3270#true} assume true; {3270#true} is VALID [2018-11-19 00:08:32,903 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3270#true} {3270#true} #48#return; {3270#true} is VALID [2018-11-19 00:08:32,904 INFO L256 TraceCheckUtils]: 4: Hoare triple {3270#true} call #t~ret2 := main(); {3270#true} is VALID [2018-11-19 00:08:32,904 INFO L273 TraceCheckUtils]: 5: Hoare triple {3270#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; {3270#true} is VALID [2018-11-19 00:08:32,904 INFO L273 TraceCheckUtils]: 6: Hoare triple {3270#true} assume !!(1 <= ~main__n~0); {3270#true} is VALID [2018-11-19 00:08:32,905 INFO L273 TraceCheckUtils]: 7: Hoare triple {3270#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {3296#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:08:32,905 INFO L273 TraceCheckUtils]: 8: Hoare triple {3296#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3300#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-19 00:08:32,906 INFO L273 TraceCheckUtils]: 9: Hoare triple {3300#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3304#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:08:32,906 INFO L273 TraceCheckUtils]: 10: Hoare triple {3304#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3308#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:08:32,907 INFO L273 TraceCheckUtils]: 11: Hoare triple {3308#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3312#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:08:32,908 INFO L273 TraceCheckUtils]: 12: Hoare triple {3312#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3316#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:08:32,909 INFO L273 TraceCheckUtils]: 13: Hoare triple {3316#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3320#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:08:32,910 INFO L273 TraceCheckUtils]: 14: Hoare triple {3320#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3324#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:08:32,911 INFO L273 TraceCheckUtils]: 15: Hoare triple {3324#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3328#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:08:32,918 INFO L273 TraceCheckUtils]: 16: Hoare triple {3328#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3332#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-19 00:08:32,919 INFO L273 TraceCheckUtils]: 17: Hoare triple {3332#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3336#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-19 00:08:32,920 INFO L273 TraceCheckUtils]: 18: Hoare triple {3336#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3340#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-19 00:08:32,920 INFO L273 TraceCheckUtils]: 19: Hoare triple {3340#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3344#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-19 00:08:32,921 INFO L273 TraceCheckUtils]: 20: Hoare triple {3344#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3348#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-19 00:08:32,921 INFO L273 TraceCheckUtils]: 21: Hoare triple {3348#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3352#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-19 00:08:32,922 INFO L273 TraceCheckUtils]: 22: Hoare triple {3352#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3356#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-19 00:08:32,922 INFO L273 TraceCheckUtils]: 23: Hoare triple {3356#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3360#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-19 00:08:32,923 INFO L273 TraceCheckUtils]: 24: Hoare triple {3360#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3364#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-19 00:08:32,924 INFO L273 TraceCheckUtils]: 25: Hoare triple {3364#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3368#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-19 00:08:32,925 INFO L273 TraceCheckUtils]: 26: Hoare triple {3368#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3372#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-19 00:08:32,926 INFO L273 TraceCheckUtils]: 27: Hoare triple {3372#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3376#(and (<= 20 main_~main__n~0) (<= main_~main__i~0 21) (= main_~main__sum~0 210))} is VALID [2018-11-19 00:08:32,927 INFO L273 TraceCheckUtils]: 28: Hoare triple {3376#(and (<= 20 main_~main__n~0) (<= main_~main__i~0 21) (= main_~main__sum~0 210))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3380#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:08:32,928 INFO L273 TraceCheckUtils]: 29: Hoare triple {3380#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {3271#false} is VALID [2018-11-19 00:08:32,928 INFO L273 TraceCheckUtils]: 30: Hoare triple {3271#false} assume !false; {3271#false} is VALID [2018-11-19 00:08:32,930 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-19 00:08:32,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:08:32,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-11-19 00:08:32,950 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2018-11-19 00:08:32,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:08:32,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-19 00:08:32,980 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-19 00:08:32,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-19 00:08:32,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-19 00:08:32,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-11-19 00:08:32,982 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 24 states. [2018-11-19 00:08:34,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:34,616 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-19 00:08:34,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-19 00:08:34,616 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2018-11-19 00:08:34,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:08:34,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-19 00:08:34,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 36 transitions. [2018-11-19 00:08:34,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-19 00:08:34,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 36 transitions. [2018-11-19 00:08:34,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 36 transitions. [2018-11-19 00:08:34,660 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-19 00:08:34,661 INFO L225 Difference]: With dead ends: 36 [2018-11-19 00:08:34,661 INFO L226 Difference]: Without dead ends: 33 [2018-11-19 00:08:34,662 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-11-19 00:08:34,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-19 00:08:34,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-19 00:08:34,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:08:34,762 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-19 00:08:34,762 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-19 00:08:34,763 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-19 00:08:34,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:34,764 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-19 00:08:34,764 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-19 00:08:34,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:34,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:34,765 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-19 00:08:34,765 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-19 00:08:34,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:34,766 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-19 00:08:34,766 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-19 00:08:34,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:34,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:34,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:08:34,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:08:34,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-19 00:08:34,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-19 00:08:34,767 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-11-19 00:08:34,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:08:34,768 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-19 00:08:34,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-19 00:08:34,768 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-19 00:08:34,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-19 00:08:34,768 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:08:34,768 INFO L375 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:08:34,769 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:08:34,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:08:34,769 INFO L82 PathProgramCache]: Analyzing trace with hash -363089018, now seen corresponding path program 16 times [2018-11-19 00:08:34,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:08:34,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:08:34,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:34,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:08:34,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:34,780 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:08:34,781 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:08:34,781 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-19 00:08:34,792 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-19 00:08:34,959 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-19 00:08:34,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:08:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:08:34,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:08:35,626 INFO L256 TraceCheckUtils]: 0: Hoare triple {3565#true} call ULTIMATE.init(); {3565#true} is VALID [2018-11-19 00:08:35,627 INFO L273 TraceCheckUtils]: 1: Hoare triple {3565#true} ~__return_main~0 := 0;~__return_96~0 := 0; {3565#true} is VALID [2018-11-19 00:08:35,627 INFO L273 TraceCheckUtils]: 2: Hoare triple {3565#true} assume true; {3565#true} is VALID [2018-11-19 00:08:35,627 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3565#true} {3565#true} #48#return; {3565#true} is VALID [2018-11-19 00:08:35,628 INFO L256 TraceCheckUtils]: 4: Hoare triple {3565#true} call #t~ret2 := main(); {3565#true} is VALID [2018-11-19 00:08:35,628 INFO L273 TraceCheckUtils]: 5: Hoare triple {3565#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; {3565#true} is VALID [2018-11-19 00:08:35,628 INFO L273 TraceCheckUtils]: 6: Hoare triple {3565#true} assume !!(1 <= ~main__n~0); {3565#true} is VALID [2018-11-19 00:08:35,629 INFO L273 TraceCheckUtils]: 7: Hoare triple {3565#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {3591#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:08:35,632 INFO L273 TraceCheckUtils]: 8: Hoare triple {3591#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3595#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-19 00:08:35,632 INFO L273 TraceCheckUtils]: 9: Hoare triple {3595#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3599#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:08:35,633 INFO L273 TraceCheckUtils]: 10: Hoare triple {3599#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3603#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:08:35,633 INFO L273 TraceCheckUtils]: 11: Hoare triple {3603#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3607#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:08:35,634 INFO L273 TraceCheckUtils]: 12: Hoare triple {3607#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3611#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:08:35,635 INFO L273 TraceCheckUtils]: 13: Hoare triple {3611#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3615#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:08:35,636 INFO L273 TraceCheckUtils]: 14: Hoare triple {3615#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3619#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:08:35,637 INFO L273 TraceCheckUtils]: 15: Hoare triple {3619#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3623#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:08:35,638 INFO L273 TraceCheckUtils]: 16: Hoare triple {3623#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3627#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-19 00:08:35,639 INFO L273 TraceCheckUtils]: 17: Hoare triple {3627#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3631#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-19 00:08:35,640 INFO L273 TraceCheckUtils]: 18: Hoare triple {3631#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3635#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-19 00:08:35,640 INFO L273 TraceCheckUtils]: 19: Hoare triple {3635#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3639#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-19 00:08:35,641 INFO L273 TraceCheckUtils]: 20: Hoare triple {3639#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3643#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-19 00:08:35,642 INFO L273 TraceCheckUtils]: 21: Hoare triple {3643#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3647#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-19 00:08:35,643 INFO L273 TraceCheckUtils]: 22: Hoare triple {3647#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3651#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-19 00:08:35,644 INFO L273 TraceCheckUtils]: 23: Hoare triple {3651#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3655#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-19 00:08:35,645 INFO L273 TraceCheckUtils]: 24: Hoare triple {3655#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3659#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-19 00:08:35,646 INFO L273 TraceCheckUtils]: 25: Hoare triple {3659#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3663#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-19 00:08:35,647 INFO L273 TraceCheckUtils]: 26: Hoare triple {3663#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3667#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-19 00:08:35,647 INFO L273 TraceCheckUtils]: 27: Hoare triple {3667#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3671#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-19 00:08:35,648 INFO L273 TraceCheckUtils]: 28: Hoare triple {3671#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3675#(and (<= 21 main_~main__n~0) (= main_~main__sum~0 231) (<= main_~main__i~0 22))} is VALID [2018-11-19 00:08:35,650 INFO L273 TraceCheckUtils]: 29: Hoare triple {3675#(and (<= 21 main_~main__n~0) (= main_~main__sum~0 231) (<= main_~main__i~0 22))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3679#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:08:35,650 INFO L273 TraceCheckUtils]: 30: Hoare triple {3679#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {3566#false} is VALID [2018-11-19 00:08:35,650 INFO L273 TraceCheckUtils]: 31: Hoare triple {3566#false} assume !false; {3566#false} is VALID [2018-11-19 00:08:35,653 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-19 00:08:35,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:08:35,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-11-19 00:08:35,671 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 32 [2018-11-19 00:08:35,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:08:35,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-19 00:08:35,703 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-19 00:08:35,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-19 00:08:35,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-19 00:08:35,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-11-19 00:08:35,704 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 25 states. [2018-11-19 00:08:37,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:37,426 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-11-19 00:08:37,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-19 00:08:37,426 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 32 [2018-11-19 00:08:37,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:08:37,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-19 00:08:37,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2018-11-19 00:08:37,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-19 00:08:37,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2018-11-19 00:08:37,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 37 transitions. [2018-11-19 00:08:37,904 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-19 00:08:37,905 INFO L225 Difference]: With dead ends: 37 [2018-11-19 00:08:37,905 INFO L226 Difference]: Without dead ends: 34 [2018-11-19 00:08:37,906 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-19 00:08:37,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-19 00:08:37,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-19 00:08:37,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:08:37,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2018-11-19 00:08:37,965 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-19 00:08:37,965 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-19 00:08:37,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:37,966 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-19 00:08:37,967 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-19 00:08:37,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:37,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:37,967 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-19 00:08:37,967 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-19 00:08:37,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:37,968 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-19 00:08:37,968 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-19 00:08:37,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:37,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:37,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:08:37,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:08:37,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-19 00:08:37,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-11-19 00:08:37,969 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-11-19 00:08:37,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:08:37,970 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-11-19 00:08:37,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-19 00:08:37,970 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-19 00:08:37,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-19 00:08:37,970 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:08:37,970 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:08:37,971 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:08:37,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:08:37,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1629079872, now seen corresponding path program 17 times [2018-11-19 00:08:37,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:08:37,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:08:37,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:37,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:08:37,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:37,981 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:08:37,981 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:08:37,982 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-19 00:08:38,005 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-19 00:08:38,042 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-11-19 00:08:38,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:08:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:08:38,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:08:38,582 INFO L256 TraceCheckUtils]: 0: Hoare triple {3870#true} call ULTIMATE.init(); {3870#true} is VALID [2018-11-19 00:08:38,582 INFO L273 TraceCheckUtils]: 1: Hoare triple {3870#true} ~__return_main~0 := 0;~__return_96~0 := 0; {3870#true} is VALID [2018-11-19 00:08:38,583 INFO L273 TraceCheckUtils]: 2: Hoare triple {3870#true} assume true; {3870#true} is VALID [2018-11-19 00:08:38,583 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3870#true} {3870#true} #48#return; {3870#true} is VALID [2018-11-19 00:08:38,583 INFO L256 TraceCheckUtils]: 4: Hoare triple {3870#true} call #t~ret2 := main(); {3870#true} is VALID [2018-11-19 00:08:38,583 INFO L273 TraceCheckUtils]: 5: Hoare triple {3870#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; {3870#true} is VALID [2018-11-19 00:08:38,583 INFO L273 TraceCheckUtils]: 6: Hoare triple {3870#true} assume !!(1 <= ~main__n~0); {3870#true} is VALID [2018-11-19 00:08:38,584 INFO L273 TraceCheckUtils]: 7: Hoare triple {3870#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {3896#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:08:38,584 INFO L273 TraceCheckUtils]: 8: Hoare triple {3896#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3900#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-19 00:08:38,585 INFO L273 TraceCheckUtils]: 9: Hoare triple {3900#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3904#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:08:38,585 INFO L273 TraceCheckUtils]: 10: Hoare triple {3904#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3908#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:08:38,586 INFO L273 TraceCheckUtils]: 11: Hoare triple {3908#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3912#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:08:38,587 INFO L273 TraceCheckUtils]: 12: Hoare triple {3912#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3916#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:08:38,588 INFO L273 TraceCheckUtils]: 13: Hoare triple {3916#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3920#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:08:38,588 INFO L273 TraceCheckUtils]: 14: Hoare triple {3920#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3924#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:08:38,589 INFO L273 TraceCheckUtils]: 15: Hoare triple {3924#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3928#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:08:38,590 INFO L273 TraceCheckUtils]: 16: Hoare triple {3928#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3932#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-19 00:08:38,591 INFO L273 TraceCheckUtils]: 17: Hoare triple {3932#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3936#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-19 00:08:38,592 INFO L273 TraceCheckUtils]: 18: Hoare triple {3936#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3940#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-19 00:08:38,593 INFO L273 TraceCheckUtils]: 19: Hoare triple {3940#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3944#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-19 00:08:38,594 INFO L273 TraceCheckUtils]: 20: Hoare triple {3944#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3948#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-19 00:08:38,595 INFO L273 TraceCheckUtils]: 21: Hoare triple {3948#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3952#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-19 00:08:38,596 INFO L273 TraceCheckUtils]: 22: Hoare triple {3952#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3956#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-19 00:08:38,597 INFO L273 TraceCheckUtils]: 23: Hoare triple {3956#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3960#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-19 00:08:38,597 INFO L273 TraceCheckUtils]: 24: Hoare triple {3960#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3964#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-19 00:08:38,598 INFO L273 TraceCheckUtils]: 25: Hoare triple {3964#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3968#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-19 00:08:38,599 INFO L273 TraceCheckUtils]: 26: Hoare triple {3968#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3972#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-19 00:08:38,600 INFO L273 TraceCheckUtils]: 27: Hoare triple {3972#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3976#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-19 00:08:38,601 INFO L273 TraceCheckUtils]: 28: Hoare triple {3976#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3980#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-19 00:08:38,602 INFO L273 TraceCheckUtils]: 29: Hoare triple {3980#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3984#(and (<= 22 main_~main__n~0) (<= main_~main__i~0 23) (= main_~main__sum~0 253))} is VALID [2018-11-19 00:08:38,603 INFO L273 TraceCheckUtils]: 30: Hoare triple {3984#(and (<= 22 main_~main__n~0) (<= main_~main__i~0 23) (= main_~main__sum~0 253))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3988#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:08:38,604 INFO L273 TraceCheckUtils]: 31: Hoare triple {3988#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {3871#false} is VALID [2018-11-19 00:08:38,604 INFO L273 TraceCheckUtils]: 32: Hoare triple {3871#false} assume !false; {3871#false} is VALID [2018-11-19 00:08:38,606 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-19 00:08:38,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:08:38,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-11-19 00:08:38,626 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 33 [2018-11-19 00:08:38,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:08:38,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-19 00:08:38,661 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-19 00:08:38,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-19 00:08:38,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-19 00:08:38,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-11-19 00:08:38,662 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 26 states. [2018-11-19 00:08:40,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:40,268 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-19 00:08:40,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-19 00:08:40,268 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 33 [2018-11-19 00:08:40,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:08:40,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-19 00:08:40,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2018-11-19 00:08:40,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-19 00:08:40,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2018-11-19 00:08:40,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 38 transitions. [2018-11-19 00:08:40,755 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-19 00:08:40,756 INFO L225 Difference]: With dead ends: 38 [2018-11-19 00:08:40,756 INFO L226 Difference]: Without dead ends: 35 [2018-11-19 00:08:40,757 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2018-11-19 00:08:40,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-19 00:08:40,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-19 00:08:40,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:08:40,823 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2018-11-19 00:08:40,823 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-19 00:08:40,823 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-19 00:08:40,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:40,825 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-19 00:08:40,825 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-19 00:08:40,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:40,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:40,825 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-19 00:08:40,825 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-19 00:08:40,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:40,826 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-19 00:08:40,826 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-19 00:08:40,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:40,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:40,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:08:40,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:08:40,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-19 00:08:40,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-11-19 00:08:40,827 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-11-19 00:08:40,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:08:40,828 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-11-19 00:08:40,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-19 00:08:40,828 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-19 00:08:40,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-19 00:08:40,828 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:08:40,828 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:08:40,829 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:08:40,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:08:40,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1038193978, now seen corresponding path program 18 times [2018-11-19 00:08:40,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:08:40,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:08:40,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:40,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:08:40,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:40,838 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:08:40,838 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:08:40,839 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-19 00:08:40,867 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-19 00:08:40,951 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-11-19 00:08:40,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:08:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:08:40,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:08:42,063 INFO L256 TraceCheckUtils]: 0: Hoare triple {4185#true} call ULTIMATE.init(); {4185#true} is VALID [2018-11-19 00:08:42,064 INFO L273 TraceCheckUtils]: 1: Hoare triple {4185#true} ~__return_main~0 := 0;~__return_96~0 := 0; {4185#true} is VALID [2018-11-19 00:08:42,064 INFO L273 TraceCheckUtils]: 2: Hoare triple {4185#true} assume true; {4185#true} is VALID [2018-11-19 00:08:42,064 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4185#true} {4185#true} #48#return; {4185#true} is VALID [2018-11-19 00:08:42,065 INFO L256 TraceCheckUtils]: 4: Hoare triple {4185#true} call #t~ret2 := main(); {4185#true} is VALID [2018-11-19 00:08:42,065 INFO L273 TraceCheckUtils]: 5: Hoare triple {4185#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; {4185#true} is VALID [2018-11-19 00:08:42,065 INFO L273 TraceCheckUtils]: 6: Hoare triple {4185#true} assume !!(1 <= ~main__n~0); {4185#true} is VALID [2018-11-19 00:08:42,066 INFO L273 TraceCheckUtils]: 7: Hoare triple {4185#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {4211#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:08:42,066 INFO L273 TraceCheckUtils]: 8: Hoare triple {4211#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4215#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-19 00:08:42,067 INFO L273 TraceCheckUtils]: 9: Hoare triple {4215#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4219#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:08:42,067 INFO L273 TraceCheckUtils]: 10: Hoare triple {4219#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4223#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:08:42,068 INFO L273 TraceCheckUtils]: 11: Hoare triple {4223#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4227#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:08:42,069 INFO L273 TraceCheckUtils]: 12: Hoare triple {4227#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4231#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:08:42,070 INFO L273 TraceCheckUtils]: 13: Hoare triple {4231#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4235#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:08:42,071 INFO L273 TraceCheckUtils]: 14: Hoare triple {4235#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4239#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:08:42,073 INFO L273 TraceCheckUtils]: 15: Hoare triple {4239#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4243#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:08:42,074 INFO L273 TraceCheckUtils]: 16: Hoare triple {4243#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4247#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-19 00:08:42,075 INFO L273 TraceCheckUtils]: 17: Hoare triple {4247#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4251#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-19 00:08:42,076 INFO L273 TraceCheckUtils]: 18: Hoare triple {4251#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4255#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-19 00:08:42,077 INFO L273 TraceCheckUtils]: 19: Hoare triple {4255#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4259#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-19 00:08:42,078 INFO L273 TraceCheckUtils]: 20: Hoare triple {4259#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4263#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-19 00:08:42,079 INFO L273 TraceCheckUtils]: 21: Hoare triple {4263#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4267#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-19 00:08:42,080 INFO L273 TraceCheckUtils]: 22: Hoare triple {4267#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4271#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-19 00:08:42,081 INFO L273 TraceCheckUtils]: 23: Hoare triple {4271#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4275#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-19 00:08:42,082 INFO L273 TraceCheckUtils]: 24: Hoare triple {4275#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4279#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-19 00:08:42,083 INFO L273 TraceCheckUtils]: 25: Hoare triple {4279#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4283#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-19 00:08:42,084 INFO L273 TraceCheckUtils]: 26: Hoare triple {4283#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4287#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-19 00:08:42,085 INFO L273 TraceCheckUtils]: 27: Hoare triple {4287#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4291#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-19 00:08:42,086 INFO L273 TraceCheckUtils]: 28: Hoare triple {4291#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4295#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-19 00:08:42,087 INFO L273 TraceCheckUtils]: 29: Hoare triple {4295#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4299#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-19 00:08:42,088 INFO L273 TraceCheckUtils]: 30: Hoare triple {4299#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4303#(and (<= main_~main__i~0 24) (= main_~main__sum~0 276) (<= 23 main_~main__n~0))} is VALID [2018-11-19 00:08:42,089 INFO L273 TraceCheckUtils]: 31: Hoare triple {4303#(and (<= main_~main__i~0 24) (= main_~main__sum~0 276) (<= 23 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4307#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:08:42,090 INFO L273 TraceCheckUtils]: 32: Hoare triple {4307#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {4186#false} is VALID [2018-11-19 00:08:42,090 INFO L273 TraceCheckUtils]: 33: Hoare triple {4186#false} assume !false; {4186#false} is VALID [2018-11-19 00:08:42,094 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-19 00:08:42,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:08:42,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-11-19 00:08:42,113 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 34 [2018-11-19 00:08:42,113 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:08:42,113 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-19 00:08:42,153 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-19 00:08:42,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-19 00:08:42,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-19 00:08:42,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-11-19 00:08:42,154 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 27 states. [2018-11-19 00:08:43,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:43,889 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-19 00:08:43,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-19 00:08:43,890 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 34 [2018-11-19 00:08:43,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:08:43,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-19 00:08:43,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2018-11-19 00:08:43,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-19 00:08:43,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2018-11-19 00:08:43,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 39 transitions. [2018-11-19 00:08:44,397 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-19 00:08:44,398 INFO L225 Difference]: With dead ends: 39 [2018-11-19 00:08:44,398 INFO L226 Difference]: Without dead ends: 36 [2018-11-19 00:08:44,399 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2018-11-19 00:08:44,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-19 00:08:44,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-19 00:08:44,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:08:44,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2018-11-19 00:08:44,464 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-19 00:08:44,464 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-19 00:08:44,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:44,468 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-19 00:08:44,468 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-19 00:08:44,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:44,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:44,469 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-19 00:08:44,469 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-19 00:08:44,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:44,470 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-19 00:08:44,470 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-19 00:08:44,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:44,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:44,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:08:44,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:08:44,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-19 00:08:44,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-11-19 00:08:44,472 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-11-19 00:08:44,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:08:44,472 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-11-19 00:08:44,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-19 00:08:44,472 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-19 00:08:44,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-19 00:08:44,473 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:08:44,473 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:08:44,473 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:08:44,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:08:44,473 INFO L82 PathProgramCache]: Analyzing trace with hash -2119304704, now seen corresponding path program 19 times [2018-11-19 00:08:44,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:08:44,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:08:44,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:44,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:08:44,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:44,483 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:08:44,483 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:08:44,483 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-19 00:08:44,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:08:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:08:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:08:44,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:08:45,174 INFO L256 TraceCheckUtils]: 0: Hoare triple {4510#true} call ULTIMATE.init(); {4510#true} is VALID [2018-11-19 00:08:45,175 INFO L273 TraceCheckUtils]: 1: Hoare triple {4510#true} ~__return_main~0 := 0;~__return_96~0 := 0; {4510#true} is VALID [2018-11-19 00:08:45,175 INFO L273 TraceCheckUtils]: 2: Hoare triple {4510#true} assume true; {4510#true} is VALID [2018-11-19 00:08:45,175 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4510#true} {4510#true} #48#return; {4510#true} is VALID [2018-11-19 00:08:45,175 INFO L256 TraceCheckUtils]: 4: Hoare triple {4510#true} call #t~ret2 := main(); {4510#true} is VALID [2018-11-19 00:08:45,175 INFO L273 TraceCheckUtils]: 5: Hoare triple {4510#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; {4510#true} is VALID [2018-11-19 00:08:45,175 INFO L273 TraceCheckUtils]: 6: Hoare triple {4510#true} assume !!(1 <= ~main__n~0); {4510#true} is VALID [2018-11-19 00:08:45,176 INFO L273 TraceCheckUtils]: 7: Hoare triple {4510#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {4536#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:08:45,176 INFO L273 TraceCheckUtils]: 8: Hoare triple {4536#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4540#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-19 00:08:45,177 INFO L273 TraceCheckUtils]: 9: Hoare triple {4540#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4544#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:08:45,178 INFO L273 TraceCheckUtils]: 10: Hoare triple {4544#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4548#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:08:45,178 INFO L273 TraceCheckUtils]: 11: Hoare triple {4548#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4552#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:08:45,179 INFO L273 TraceCheckUtils]: 12: Hoare triple {4552#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4556#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:08:45,180 INFO L273 TraceCheckUtils]: 13: Hoare triple {4556#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4560#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:08:45,181 INFO L273 TraceCheckUtils]: 14: Hoare triple {4560#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4564#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:08:45,181 INFO L273 TraceCheckUtils]: 15: Hoare triple {4564#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4568#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:08:45,182 INFO L273 TraceCheckUtils]: 16: Hoare triple {4568#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4572#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-19 00:08:45,183 INFO L273 TraceCheckUtils]: 17: Hoare triple {4572#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4576#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-19 00:08:45,184 INFO L273 TraceCheckUtils]: 18: Hoare triple {4576#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4580#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-19 00:08:45,185 INFO L273 TraceCheckUtils]: 19: Hoare triple {4580#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4584#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-19 00:08:45,186 INFO L273 TraceCheckUtils]: 20: Hoare triple {4584#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4588#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-19 00:08:45,187 INFO L273 TraceCheckUtils]: 21: Hoare triple {4588#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4592#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-19 00:08:45,188 INFO L273 TraceCheckUtils]: 22: Hoare triple {4592#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4596#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-19 00:08:45,189 INFO L273 TraceCheckUtils]: 23: Hoare triple {4596#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4600#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-19 00:08:45,189 INFO L273 TraceCheckUtils]: 24: Hoare triple {4600#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4604#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-19 00:08:45,190 INFO L273 TraceCheckUtils]: 25: Hoare triple {4604#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4608#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-19 00:08:45,191 INFO L273 TraceCheckUtils]: 26: Hoare triple {4608#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4612#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-19 00:08:45,192 INFO L273 TraceCheckUtils]: 27: Hoare triple {4612#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4616#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-19 00:08:45,193 INFO L273 TraceCheckUtils]: 28: Hoare triple {4616#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4620#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-19 00:08:45,194 INFO L273 TraceCheckUtils]: 29: Hoare triple {4620#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4624#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-19 00:08:45,195 INFO L273 TraceCheckUtils]: 30: Hoare triple {4624#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4628#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-19 00:08:45,196 INFO L273 TraceCheckUtils]: 31: Hoare triple {4628#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4632#(and (<= 24 main_~main__n~0) (= main_~main__sum~0 300) (<= main_~main__i~0 25))} is VALID [2018-11-19 00:08:45,197 INFO L273 TraceCheckUtils]: 32: Hoare triple {4632#(and (<= 24 main_~main__n~0) (= main_~main__sum~0 300) (<= main_~main__i~0 25))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4636#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:08:45,197 INFO L273 TraceCheckUtils]: 33: Hoare triple {4636#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {4511#false} is VALID [2018-11-19 00:08:45,198 INFO L273 TraceCheckUtils]: 34: Hoare triple {4511#false} assume !false; {4511#false} is VALID [2018-11-19 00:08:45,201 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-19 00:08:45,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:08:45,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-11-19 00:08:45,221 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 35 [2018-11-19 00:08:45,221 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:08:45,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-19 00:08:45,257 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-19 00:08:45,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-19 00:08:45,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-19 00:08:45,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-11-19 00:08:45,258 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 28 states. [2018-11-19 00:08:47,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:47,236 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-11-19 00:08:47,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-19 00:08:47,236 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 35 [2018-11-19 00:08:47,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:08:47,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-19 00:08:47,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-11-19 00:08:47,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-19 00:08:47,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-11-19 00:08:47,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 40 transitions. [2018-11-19 00:08:47,753 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-19 00:08:47,754 INFO L225 Difference]: With dead ends: 40 [2018-11-19 00:08:47,754 INFO L226 Difference]: Without dead ends: 37 [2018-11-19 00:08:47,755 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=755, Unknown=0, NotChecked=0, Total=812 [2018-11-19 00:08:47,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-19 00:08:47,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-19 00:08:47,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:08:47,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-19 00:08:47,877 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-19 00:08:47,877 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-19 00:08:47,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:47,879 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-11-19 00:08:47,879 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-11-19 00:08:47,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:47,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:47,879 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-19 00:08:47,879 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-19 00:08:47,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:47,880 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-11-19 00:08:47,880 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-11-19 00:08:47,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:47,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:47,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:08:47,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:08:47,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-19 00:08:47,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-11-19 00:08:47,881 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-11-19 00:08:47,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:08:47,881 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-11-19 00:08:47,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-19 00:08:47,881 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-11-19 00:08:47,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-19 00:08:47,882 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:08:47,882 INFO L375 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:08:47,882 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:08:47,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:08:47,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1273998842, now seen corresponding path program 20 times [2018-11-19 00:08:47,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:08:47,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:08:47,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:47,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:08:47,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:47,891 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:08:47,891 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:08:47,892 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-19 00:08:47,913 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-19 00:08:47,961 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-19 00:08:47,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:08:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:08:47,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:08:48,622 INFO L256 TraceCheckUtils]: 0: Hoare triple {4845#true} call ULTIMATE.init(); {4845#true} is VALID [2018-11-19 00:08:48,623 INFO L273 TraceCheckUtils]: 1: Hoare triple {4845#true} ~__return_main~0 := 0;~__return_96~0 := 0; {4845#true} is VALID [2018-11-19 00:08:48,624 INFO L273 TraceCheckUtils]: 2: Hoare triple {4845#true} assume true; {4845#true} is VALID [2018-11-19 00:08:48,624 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4845#true} {4845#true} #48#return; {4845#true} is VALID [2018-11-19 00:08:48,624 INFO L256 TraceCheckUtils]: 4: Hoare triple {4845#true} call #t~ret2 := main(); {4845#true} is VALID [2018-11-19 00:08:48,625 INFO L273 TraceCheckUtils]: 5: Hoare triple {4845#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; {4845#true} is VALID [2018-11-19 00:08:48,625 INFO L273 TraceCheckUtils]: 6: Hoare triple {4845#true} assume !!(1 <= ~main__n~0); {4845#true} is VALID [2018-11-19 00:08:48,638 INFO L273 TraceCheckUtils]: 7: Hoare triple {4845#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {4871#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:08:48,639 INFO L273 TraceCheckUtils]: 8: Hoare triple {4871#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4875#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-19 00:08:48,639 INFO L273 TraceCheckUtils]: 9: Hoare triple {4875#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4879#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:08:48,640 INFO L273 TraceCheckUtils]: 10: Hoare triple {4879#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4883#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:08:48,640 INFO L273 TraceCheckUtils]: 11: Hoare triple {4883#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4887#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:08:48,641 INFO L273 TraceCheckUtils]: 12: Hoare triple {4887#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4891#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:08:48,642 INFO L273 TraceCheckUtils]: 13: Hoare triple {4891#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4895#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:08:48,643 INFO L273 TraceCheckUtils]: 14: Hoare triple {4895#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4899#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:08:48,644 INFO L273 TraceCheckUtils]: 15: Hoare triple {4899#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4903#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:08:48,645 INFO L273 TraceCheckUtils]: 16: Hoare triple {4903#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4907#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-19 00:08:48,646 INFO L273 TraceCheckUtils]: 17: Hoare triple {4907#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4911#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-19 00:08:48,647 INFO L273 TraceCheckUtils]: 18: Hoare triple {4911#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4915#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-19 00:08:48,648 INFO L273 TraceCheckUtils]: 19: Hoare triple {4915#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4919#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-19 00:08:48,649 INFO L273 TraceCheckUtils]: 20: Hoare triple {4919#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4923#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-19 00:08:48,650 INFO L273 TraceCheckUtils]: 21: Hoare triple {4923#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4927#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-19 00:08:48,650 INFO L273 TraceCheckUtils]: 22: Hoare triple {4927#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4931#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-19 00:08:48,651 INFO L273 TraceCheckUtils]: 23: Hoare triple {4931#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4935#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-19 00:08:48,652 INFO L273 TraceCheckUtils]: 24: Hoare triple {4935#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4939#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-19 00:08:48,653 INFO L273 TraceCheckUtils]: 25: Hoare triple {4939#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4943#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-19 00:08:48,654 INFO L273 TraceCheckUtils]: 26: Hoare triple {4943#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4947#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-19 00:08:48,655 INFO L273 TraceCheckUtils]: 27: Hoare triple {4947#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4951#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-19 00:08:48,656 INFO L273 TraceCheckUtils]: 28: Hoare triple {4951#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4955#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-19 00:08:48,657 INFO L273 TraceCheckUtils]: 29: Hoare triple {4955#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4959#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-19 00:08:48,658 INFO L273 TraceCheckUtils]: 30: Hoare triple {4959#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4963#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-19 00:08:48,659 INFO L273 TraceCheckUtils]: 31: Hoare triple {4963#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4967#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-19 00:08:48,660 INFO L273 TraceCheckUtils]: 32: Hoare triple {4967#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4971#(and (= main_~main__sum~0 325) (<= main_~main__i~0 26) (<= 25 main_~main__n~0))} is VALID [2018-11-19 00:08:48,661 INFO L273 TraceCheckUtils]: 33: Hoare triple {4971#(and (= main_~main__sum~0 325) (<= main_~main__i~0 26) (<= 25 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4975#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:08:48,661 INFO L273 TraceCheckUtils]: 34: Hoare triple {4975#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {4846#false} is VALID [2018-11-19 00:08:48,662 INFO L273 TraceCheckUtils]: 35: Hoare triple {4846#false} assume !false; {4846#false} is VALID [2018-11-19 00:08:48,665 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-19 00:08:48,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:08:48,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-11-19 00:08:48,691 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 36 [2018-11-19 00:08:48,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:08:48,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-19 00:08:48,730 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-19 00:08:48,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-19 00:08:48,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-19 00:08:48,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-11-19 00:08:48,731 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 29 states. [2018-11-19 00:08:50,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:50,709 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-11-19 00:08:50,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-19 00:08:50,709 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 36 [2018-11-19 00:08:50,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:08:50,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-19 00:08:50,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2018-11-19 00:08:50,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-19 00:08:50,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2018-11-19 00:08:50,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 41 transitions. [2018-11-19 00:08:50,759 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-19 00:08:50,760 INFO L225 Difference]: With dead ends: 41 [2018-11-19 00:08:50,760 INFO L226 Difference]: Without dead ends: 38 [2018-11-19 00:08:50,761 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=811, Unknown=0, NotChecked=0, Total=870 [2018-11-19 00:08:50,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-19 00:08:50,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-19 00:08:50,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:08:50,829 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2018-11-19 00:08:50,829 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-19 00:08:50,830 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-19 00:08:50,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:50,830 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-19 00:08:50,831 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-19 00:08:50,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:50,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:50,831 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-19 00:08:50,831 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-19 00:08:50,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:50,832 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-19 00:08:50,832 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-19 00:08:50,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:50,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:50,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:08:50,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:08:50,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-19 00:08:50,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-11-19 00:08:50,834 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-11-19 00:08:50,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:08:50,834 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-11-19 00:08:50,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-19 00:08:50,834 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-19 00:08:50,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-19 00:08:50,835 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:08:50,835 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:08:50,835 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:08:50,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:08:50,836 INFO L82 PathProgramCache]: Analyzing trace with hash -839320896, now seen corresponding path program 21 times [2018-11-19 00:08:50,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:08:50,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:08:50,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:50,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:08:50,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:50,845 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:08:50,845 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:08:50,845 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-19 00:08:50,863 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-19 00:08:51,117 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-19 00:08:51,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:08:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:08:51,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:08:52,043 INFO L256 TraceCheckUtils]: 0: Hoare triple {5190#true} call ULTIMATE.init(); {5190#true} is VALID [2018-11-19 00:08:52,044 INFO L273 TraceCheckUtils]: 1: Hoare triple {5190#true} ~__return_main~0 := 0;~__return_96~0 := 0; {5190#true} is VALID [2018-11-19 00:08:52,044 INFO L273 TraceCheckUtils]: 2: Hoare triple {5190#true} assume true; {5190#true} is VALID [2018-11-19 00:08:52,044 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5190#true} {5190#true} #48#return; {5190#true} is VALID [2018-11-19 00:08:52,045 INFO L256 TraceCheckUtils]: 4: Hoare triple {5190#true} call #t~ret2 := main(); {5190#true} is VALID [2018-11-19 00:08:52,045 INFO L273 TraceCheckUtils]: 5: Hoare triple {5190#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; {5190#true} is VALID [2018-11-19 00:08:52,045 INFO L273 TraceCheckUtils]: 6: Hoare triple {5190#true} assume !!(1 <= ~main__n~0); {5190#true} is VALID [2018-11-19 00:08:52,046 INFO L273 TraceCheckUtils]: 7: Hoare triple {5190#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {5216#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:08:52,046 INFO L273 TraceCheckUtils]: 8: Hoare triple {5216#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5220#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-19 00:08:52,047 INFO L273 TraceCheckUtils]: 9: Hoare triple {5220#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5224#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:08:52,048 INFO L273 TraceCheckUtils]: 10: Hoare triple {5224#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5228#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:08:52,048 INFO L273 TraceCheckUtils]: 11: Hoare triple {5228#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5232#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:08:52,049 INFO L273 TraceCheckUtils]: 12: Hoare triple {5232#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5236#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:08:52,050 INFO L273 TraceCheckUtils]: 13: Hoare triple {5236#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5240#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:08:52,051 INFO L273 TraceCheckUtils]: 14: Hoare triple {5240#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5244#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:08:52,052 INFO L273 TraceCheckUtils]: 15: Hoare triple {5244#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5248#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:08:52,053 INFO L273 TraceCheckUtils]: 16: Hoare triple {5248#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5252#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-19 00:08:52,054 INFO L273 TraceCheckUtils]: 17: Hoare triple {5252#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5256#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-19 00:08:52,055 INFO L273 TraceCheckUtils]: 18: Hoare triple {5256#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5260#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-19 00:08:52,056 INFO L273 TraceCheckUtils]: 19: Hoare triple {5260#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5264#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-19 00:08:52,057 INFO L273 TraceCheckUtils]: 20: Hoare triple {5264#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5268#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-19 00:08:52,057 INFO L273 TraceCheckUtils]: 21: Hoare triple {5268#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5272#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-19 00:08:52,058 INFO L273 TraceCheckUtils]: 22: Hoare triple {5272#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5276#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-19 00:08:52,059 INFO L273 TraceCheckUtils]: 23: Hoare triple {5276#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5280#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-19 00:08:52,060 INFO L273 TraceCheckUtils]: 24: Hoare triple {5280#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5284#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-19 00:08:52,061 INFO L273 TraceCheckUtils]: 25: Hoare triple {5284#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5288#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-19 00:08:52,062 INFO L273 TraceCheckUtils]: 26: Hoare triple {5288#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5292#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-19 00:08:52,063 INFO L273 TraceCheckUtils]: 27: Hoare triple {5292#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5296#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-19 00:08:52,064 INFO L273 TraceCheckUtils]: 28: Hoare triple {5296#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5300#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-19 00:08:52,064 INFO L273 TraceCheckUtils]: 29: Hoare triple {5300#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5304#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-19 00:08:52,065 INFO L273 TraceCheckUtils]: 30: Hoare triple {5304#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5308#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-19 00:08:52,066 INFO L273 TraceCheckUtils]: 31: Hoare triple {5308#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5312#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-19 00:08:52,067 INFO L273 TraceCheckUtils]: 32: Hoare triple {5312#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5316#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-19 00:08:52,068 INFO L273 TraceCheckUtils]: 33: Hoare triple {5316#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5320#(and (= main_~main__sum~0 351) (<= main_~main__i~0 27) (<= 26 main_~main__n~0))} is VALID [2018-11-19 00:08:52,069 INFO L273 TraceCheckUtils]: 34: Hoare triple {5320#(and (= main_~main__sum~0 351) (<= main_~main__i~0 27) (<= 26 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5324#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:08:52,070 INFO L273 TraceCheckUtils]: 35: Hoare triple {5324#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {5191#false} is VALID [2018-11-19 00:08:52,070 INFO L273 TraceCheckUtils]: 36: Hoare triple {5191#false} assume !false; {5191#false} is VALID [2018-11-19 00:08:52,073 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-19 00:08:52,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:08:52,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-11-19 00:08:52,093 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 37 [2018-11-19 00:08:52,093 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:08:52,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-19 00:08:52,131 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-19 00:08:52,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-19 00:08:52,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-19 00:08:52,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-11-19 00:08:52,132 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 30 states. [2018-11-19 00:08:54,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:54,235 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-19 00:08:54,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-19 00:08:54,236 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 37 [2018-11-19 00:08:54,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:08:54,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-19 00:08:54,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2018-11-19 00:08:54,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-19 00:08:54,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2018-11-19 00:08:54,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 42 transitions. [2018-11-19 00:08:54,281 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-19 00:08:54,282 INFO L225 Difference]: With dead ends: 42 [2018-11-19 00:08:54,283 INFO L226 Difference]: Without dead ends: 39 [2018-11-19 00:08:54,284 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=869, Unknown=0, NotChecked=0, Total=930 [2018-11-19 00:08:54,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-19 00:08:54,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-19 00:08:54,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:08:54,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2018-11-19 00:08:54,392 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-19 00:08:54,393 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-19 00:08:54,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:54,394 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-19 00:08:54,394 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-19 00:08:54,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:54,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:54,395 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-19 00:08:54,395 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-19 00:08:54,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:54,396 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-19 00:08:54,396 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-19 00:08:54,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:54,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:54,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:08:54,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:08:54,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-19 00:08:54,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-11-19 00:08:54,397 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-11-19 00:08:54,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:08:54,397 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-11-19 00:08:54,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-19 00:08:54,398 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-19 00:08:54,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-19 00:08:54,398 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:08:54,398 INFO L375 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:08:54,399 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:08:54,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:08:54,399 INFO L82 PathProgramCache]: Analyzing trace with hash -249206458, now seen corresponding path program 22 times [2018-11-19 00:08:54,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:08:54,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:08:54,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:54,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:08:54,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:54,408 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:08:54,408 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:08:54,408 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-19 00:08:54,421 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-19 00:08:54,645 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-19 00:08:54,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:08:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:08:54,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:08:55,577 INFO L256 TraceCheckUtils]: 0: Hoare triple {5545#true} call ULTIMATE.init(); {5545#true} is VALID [2018-11-19 00:08:55,577 INFO L273 TraceCheckUtils]: 1: Hoare triple {5545#true} ~__return_main~0 := 0;~__return_96~0 := 0; {5545#true} is VALID [2018-11-19 00:08:55,578 INFO L273 TraceCheckUtils]: 2: Hoare triple {5545#true} assume true; {5545#true} is VALID [2018-11-19 00:08:55,578 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5545#true} {5545#true} #48#return; {5545#true} is VALID [2018-11-19 00:08:55,578 INFO L256 TraceCheckUtils]: 4: Hoare triple {5545#true} call #t~ret2 := main(); {5545#true} is VALID [2018-11-19 00:08:55,578 INFO L273 TraceCheckUtils]: 5: Hoare triple {5545#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; {5545#true} is VALID [2018-11-19 00:08:55,578 INFO L273 TraceCheckUtils]: 6: Hoare triple {5545#true} assume !!(1 <= ~main__n~0); {5545#true} is VALID [2018-11-19 00:08:55,579 INFO L273 TraceCheckUtils]: 7: Hoare triple {5545#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {5571#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:08:55,580 INFO L273 TraceCheckUtils]: 8: Hoare triple {5571#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5575#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-19 00:08:55,581 INFO L273 TraceCheckUtils]: 9: Hoare triple {5575#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5579#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:08:55,581 INFO L273 TraceCheckUtils]: 10: Hoare triple {5579#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5583#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:08:55,582 INFO L273 TraceCheckUtils]: 11: Hoare triple {5583#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5587#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:08:55,582 INFO L273 TraceCheckUtils]: 12: Hoare triple {5587#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5591#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:08:55,583 INFO L273 TraceCheckUtils]: 13: Hoare triple {5591#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5595#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:08:55,584 INFO L273 TraceCheckUtils]: 14: Hoare triple {5595#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5599#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:08:55,585 INFO L273 TraceCheckUtils]: 15: Hoare triple {5599#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5603#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:08:55,586 INFO L273 TraceCheckUtils]: 16: Hoare triple {5603#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5607#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-19 00:08:55,587 INFO L273 TraceCheckUtils]: 17: Hoare triple {5607#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5611#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-19 00:08:55,588 INFO L273 TraceCheckUtils]: 18: Hoare triple {5611#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5615#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-19 00:08:55,589 INFO L273 TraceCheckUtils]: 19: Hoare triple {5615#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5619#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-19 00:08:55,589 INFO L273 TraceCheckUtils]: 20: Hoare triple {5619#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5623#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-19 00:08:55,590 INFO L273 TraceCheckUtils]: 21: Hoare triple {5623#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5627#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-19 00:08:55,591 INFO L273 TraceCheckUtils]: 22: Hoare triple {5627#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5631#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-19 00:08:55,592 INFO L273 TraceCheckUtils]: 23: Hoare triple {5631#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5635#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-19 00:08:55,593 INFO L273 TraceCheckUtils]: 24: Hoare triple {5635#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5639#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-19 00:08:55,594 INFO L273 TraceCheckUtils]: 25: Hoare triple {5639#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5643#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-19 00:08:55,595 INFO L273 TraceCheckUtils]: 26: Hoare triple {5643#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5647#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-19 00:08:55,595 INFO L273 TraceCheckUtils]: 27: Hoare triple {5647#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5651#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-19 00:08:55,596 INFO L273 TraceCheckUtils]: 28: Hoare triple {5651#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5655#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-19 00:08:55,597 INFO L273 TraceCheckUtils]: 29: Hoare triple {5655#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5659#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-19 00:08:55,598 INFO L273 TraceCheckUtils]: 30: Hoare triple {5659#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5663#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-19 00:08:55,599 INFO L273 TraceCheckUtils]: 31: Hoare triple {5663#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5667#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-19 00:08:55,600 INFO L273 TraceCheckUtils]: 32: Hoare triple {5667#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5671#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-19 00:08:55,601 INFO L273 TraceCheckUtils]: 33: Hoare triple {5671#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5675#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-19 00:08:55,602 INFO L273 TraceCheckUtils]: 34: Hoare triple {5675#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5679#(and (<= 27 main_~main__n~0) (= main_~main__sum~0 378) (<= main_~main__i~0 28))} is VALID [2018-11-19 00:08:55,603 INFO L273 TraceCheckUtils]: 35: Hoare triple {5679#(and (<= 27 main_~main__n~0) (= main_~main__sum~0 378) (<= main_~main__i~0 28))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5683#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:08:55,604 INFO L273 TraceCheckUtils]: 36: Hoare triple {5683#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {5546#false} is VALID [2018-11-19 00:08:55,604 INFO L273 TraceCheckUtils]: 37: Hoare triple {5546#false} assume !false; {5546#false} is VALID [2018-11-19 00:08:55,607 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-19 00:08:55,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:08:55,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-11-19 00:08:55,626 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 38 [2018-11-19 00:08:55,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:08:55,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-19 00:08:55,664 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-19 00:08:55,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-19 00:08:55,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-19 00:08:55,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-11-19 00:08:55,665 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 31 states. [2018-11-19 00:08:58,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:58,008 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-11-19 00:08:58,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-19 00:08:58,009 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 38 [2018-11-19 00:08:58,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:08:58,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-19 00:08:58,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-11-19 00:08:58,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-19 00:08:58,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-11-19 00:08:58,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 43 transitions. [2018-11-19 00:08:58,058 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-19 00:08:58,059 INFO L225 Difference]: With dead ends: 43 [2018-11-19 00:08:58,059 INFO L226 Difference]: Without dead ends: 40 [2018-11-19 00:08:58,060 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=63, Invalid=929, Unknown=0, NotChecked=0, Total=992 [2018-11-19 00:08:58,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-19 00:08:58,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-19 00:08:58,161 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:08:58,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-19 00:08:58,161 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-19 00:08:58,161 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-19 00:08:58,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:58,162 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-11-19 00:08:58,162 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-11-19 00:08:58,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:58,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:58,163 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-19 00:08:58,163 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-19 00:08:58,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:08:58,164 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-11-19 00:08:58,164 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-11-19 00:08:58,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:08:58,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:08:58,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:08:58,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:08:58,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-19 00:08:58,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-11-19 00:08:58,165 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-11-19 00:08:58,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:08:58,166 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-11-19 00:08:58,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-19 00:08:58,166 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-11-19 00:08:58,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-19 00:08:58,166 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:08:58,166 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:08:58,166 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:08:58,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:08:58,166 INFO L82 PathProgramCache]: Analyzing trace with hash 864471936, now seen corresponding path program 23 times [2018-11-19 00:08:58,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:08:58,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:08:58,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:58,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:08:58,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:08:58,175 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:08:58,175 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:08:58,175 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-19 00:08:58,191 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-19 00:08:58,244 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-11-19 00:08:58,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:08:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:08:58,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:08:59,044 INFO L256 TraceCheckUtils]: 0: Hoare triple {5910#true} call ULTIMATE.init(); {5910#true} is VALID [2018-11-19 00:08:59,044 INFO L273 TraceCheckUtils]: 1: Hoare triple {5910#true} ~__return_main~0 := 0;~__return_96~0 := 0; {5910#true} is VALID [2018-11-19 00:08:59,044 INFO L273 TraceCheckUtils]: 2: Hoare triple {5910#true} assume true; {5910#true} is VALID [2018-11-19 00:08:59,045 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5910#true} {5910#true} #48#return; {5910#true} is VALID [2018-11-19 00:08:59,045 INFO L256 TraceCheckUtils]: 4: Hoare triple {5910#true} call #t~ret2 := main(); {5910#true} is VALID [2018-11-19 00:08:59,045 INFO L273 TraceCheckUtils]: 5: Hoare triple {5910#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; {5910#true} is VALID [2018-11-19 00:08:59,045 INFO L273 TraceCheckUtils]: 6: Hoare triple {5910#true} assume !!(1 <= ~main__n~0); {5910#true} is VALID [2018-11-19 00:08:59,045 INFO L273 TraceCheckUtils]: 7: Hoare triple {5910#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {5936#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:08:59,046 INFO L273 TraceCheckUtils]: 8: Hoare triple {5936#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5940#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-19 00:08:59,046 INFO L273 TraceCheckUtils]: 9: Hoare triple {5940#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5944#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:08:59,047 INFO L273 TraceCheckUtils]: 10: Hoare triple {5944#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5948#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:08:59,047 INFO L273 TraceCheckUtils]: 11: Hoare triple {5948#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5952#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:08:59,048 INFO L273 TraceCheckUtils]: 12: Hoare triple {5952#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5956#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:08:59,049 INFO L273 TraceCheckUtils]: 13: Hoare triple {5956#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5960#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:08:59,050 INFO L273 TraceCheckUtils]: 14: Hoare triple {5960#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5964#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:08:59,051 INFO L273 TraceCheckUtils]: 15: Hoare triple {5964#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5968#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:08:59,052 INFO L273 TraceCheckUtils]: 16: Hoare triple {5968#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5972#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-19 00:08:59,052 INFO L273 TraceCheckUtils]: 17: Hoare triple {5972#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5976#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-19 00:08:59,053 INFO L273 TraceCheckUtils]: 18: Hoare triple {5976#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5980#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-19 00:08:59,054 INFO L273 TraceCheckUtils]: 19: Hoare triple {5980#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5984#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-19 00:08:59,055 INFO L273 TraceCheckUtils]: 20: Hoare triple {5984#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5988#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-19 00:08:59,056 INFO L273 TraceCheckUtils]: 21: Hoare triple {5988#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5992#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-19 00:08:59,057 INFO L273 TraceCheckUtils]: 22: Hoare triple {5992#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5996#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-19 00:08:59,058 INFO L273 TraceCheckUtils]: 23: Hoare triple {5996#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6000#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-19 00:08:59,058 INFO L273 TraceCheckUtils]: 24: Hoare triple {6000#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6004#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-19 00:08:59,059 INFO L273 TraceCheckUtils]: 25: Hoare triple {6004#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6008#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-19 00:08:59,060 INFO L273 TraceCheckUtils]: 26: Hoare triple {6008#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6012#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-19 00:08:59,061 INFO L273 TraceCheckUtils]: 27: Hoare triple {6012#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6016#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-19 00:08:59,062 INFO L273 TraceCheckUtils]: 28: Hoare triple {6016#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6020#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-19 00:08:59,063 INFO L273 TraceCheckUtils]: 29: Hoare triple {6020#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6024#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-19 00:08:59,064 INFO L273 TraceCheckUtils]: 30: Hoare triple {6024#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6028#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-19 00:08:59,064 INFO L273 TraceCheckUtils]: 31: Hoare triple {6028#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6032#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-19 00:08:59,065 INFO L273 TraceCheckUtils]: 32: Hoare triple {6032#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6036#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-19 00:08:59,066 INFO L273 TraceCheckUtils]: 33: Hoare triple {6036#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6040#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-19 00:08:59,067 INFO L273 TraceCheckUtils]: 34: Hoare triple {6040#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6044#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-19 00:08:59,068 INFO L273 TraceCheckUtils]: 35: Hoare triple {6044#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6048#(and (<= 28 main_~main__n~0) (<= main_~main__i~0 29) (= main_~main__sum~0 406))} is VALID [2018-11-19 00:08:59,069 INFO L273 TraceCheckUtils]: 36: Hoare triple {6048#(and (<= 28 main_~main__n~0) (<= main_~main__i~0 29) (= main_~main__sum~0 406))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6052#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:08:59,070 INFO L273 TraceCheckUtils]: 37: Hoare triple {6052#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {5911#false} is VALID [2018-11-19 00:08:59,070 INFO L273 TraceCheckUtils]: 38: Hoare triple {5911#false} assume !false; {5911#false} is VALID [2018-11-19 00:08:59,073 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-19 00:08:59,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:08:59,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-11-19 00:08:59,095 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 39 [2018-11-19 00:08:59,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:08:59,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-19 00:08:59,133 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-19 00:08:59,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-19 00:08:59,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-19 00:08:59,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-11-19 00:08:59,135 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 32 states. [2018-11-19 00:09:01,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:09:01,521 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-11-19 00:09:01,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-19 00:09:01,521 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 39 [2018-11-19 00:09:01,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:09:01,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-19 00:09:01,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2018-11-19 00:09:01,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-19 00:09:01,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2018-11-19 00:09:01,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 44 transitions. [2018-11-19 00:09:01,947 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-19 00:09:01,947 INFO L225 Difference]: With dead ends: 44 [2018-11-19 00:09:01,948 INFO L226 Difference]: Without dead ends: 41 [2018-11-19 00:09:01,948 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-19 00:09:01,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-19 00:09:02,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-19 00:09:02,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:09:02,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 41 states. [2018-11-19 00:09:02,155 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-19 00:09:02,155 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-19 00:09:02,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:09:02,156 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-11-19 00:09:02,156 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-11-19 00:09:02,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:09:02,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:09:02,156 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-19 00:09:02,156 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-19 00:09:02,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:09:02,157 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-11-19 00:09:02,157 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-11-19 00:09:02,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:09:02,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:09:02,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:09:02,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:09:02,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-19 00:09:02,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-11-19 00:09:02,159 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-11-19 00:09:02,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:09:02,159 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-11-19 00:09:02,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-19 00:09:02,159 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-11-19 00:09:02,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-19 00:09:02,160 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:09:02,160 INFO L375 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:09:02,160 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:09:02,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:09:02,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1028763782, now seen corresponding path program 24 times [2018-11-19 00:09:02,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:09:02,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:09:02,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:09:02,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:09:02,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:09:02,168 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:09:02,168 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:09:02,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 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-19 00:09:02,185 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-19 00:09:02,328 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-19 00:09:02,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:09:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:09:02,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:09:03,435 INFO L256 TraceCheckUtils]: 0: Hoare triple {6285#true} call ULTIMATE.init(); {6285#true} is VALID [2018-11-19 00:09:03,436 INFO L273 TraceCheckUtils]: 1: Hoare triple {6285#true} ~__return_main~0 := 0;~__return_96~0 := 0; {6285#true} is VALID [2018-11-19 00:09:03,436 INFO L273 TraceCheckUtils]: 2: Hoare triple {6285#true} assume true; {6285#true} is VALID [2018-11-19 00:09:03,436 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6285#true} {6285#true} #48#return; {6285#true} is VALID [2018-11-19 00:09:03,436 INFO L256 TraceCheckUtils]: 4: Hoare triple {6285#true} call #t~ret2 := main(); {6285#true} is VALID [2018-11-19 00:09:03,436 INFO L273 TraceCheckUtils]: 5: Hoare triple {6285#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; {6285#true} is VALID [2018-11-19 00:09:03,437 INFO L273 TraceCheckUtils]: 6: Hoare triple {6285#true} assume !!(1 <= ~main__n~0); {6285#true} is VALID [2018-11-19 00:09:03,454 INFO L273 TraceCheckUtils]: 7: Hoare triple {6285#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {6311#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:09:03,460 INFO L273 TraceCheckUtils]: 8: Hoare triple {6311#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6315#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-19 00:09:03,461 INFO L273 TraceCheckUtils]: 9: Hoare triple {6315#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6319#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:09:03,461 INFO L273 TraceCheckUtils]: 10: Hoare triple {6319#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6323#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:09:03,462 INFO L273 TraceCheckUtils]: 11: Hoare triple {6323#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6327#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:09:03,462 INFO L273 TraceCheckUtils]: 12: Hoare triple {6327#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6331#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:09:03,463 INFO L273 TraceCheckUtils]: 13: Hoare triple {6331#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6335#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:09:03,463 INFO L273 TraceCheckUtils]: 14: Hoare triple {6335#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6339#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:09:03,464 INFO L273 TraceCheckUtils]: 15: Hoare triple {6339#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6343#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:09:03,465 INFO L273 TraceCheckUtils]: 16: Hoare triple {6343#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6347#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-19 00:09:03,466 INFO L273 TraceCheckUtils]: 17: Hoare triple {6347#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6351#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-19 00:09:03,467 INFO L273 TraceCheckUtils]: 18: Hoare triple {6351#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6355#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-19 00:09:03,468 INFO L273 TraceCheckUtils]: 19: Hoare triple {6355#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6359#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-19 00:09:03,469 INFO L273 TraceCheckUtils]: 20: Hoare triple {6359#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6363#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-19 00:09:03,470 INFO L273 TraceCheckUtils]: 21: Hoare triple {6363#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6367#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-19 00:09:03,471 INFO L273 TraceCheckUtils]: 22: Hoare triple {6367#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6371#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-19 00:09:03,472 INFO L273 TraceCheckUtils]: 23: Hoare triple {6371#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6375#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-19 00:09:03,473 INFO L273 TraceCheckUtils]: 24: Hoare triple {6375#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6379#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-19 00:09:03,474 INFO L273 TraceCheckUtils]: 25: Hoare triple {6379#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6383#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-19 00:09:03,475 INFO L273 TraceCheckUtils]: 26: Hoare triple {6383#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6387#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-19 00:09:03,475 INFO L273 TraceCheckUtils]: 27: Hoare triple {6387#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6391#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-19 00:09:03,476 INFO L273 TraceCheckUtils]: 28: Hoare triple {6391#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6395#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-19 00:09:03,477 INFO L273 TraceCheckUtils]: 29: Hoare triple {6395#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6399#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-19 00:09:03,478 INFO L273 TraceCheckUtils]: 30: Hoare triple {6399#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6403#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-19 00:09:03,479 INFO L273 TraceCheckUtils]: 31: Hoare triple {6403#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6407#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-19 00:09:03,480 INFO L273 TraceCheckUtils]: 32: Hoare triple {6407#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6411#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-19 00:09:03,481 INFO L273 TraceCheckUtils]: 33: Hoare triple {6411#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6415#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-19 00:09:03,482 INFO L273 TraceCheckUtils]: 34: Hoare triple {6415#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6419#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-19 00:09:03,483 INFO L273 TraceCheckUtils]: 35: Hoare triple {6419#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6423#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-19 00:09:03,484 INFO L273 TraceCheckUtils]: 36: Hoare triple {6423#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6427#(and (= main_~main__sum~0 435) (<= main_~main__i~0 30) (<= 29 main_~main__n~0))} is VALID [2018-11-19 00:09:03,485 INFO L273 TraceCheckUtils]: 37: Hoare triple {6427#(and (= main_~main__sum~0 435) (<= main_~main__i~0 30) (<= 29 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6431#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:09:03,486 INFO L273 TraceCheckUtils]: 38: Hoare triple {6431#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {6286#false} is VALID [2018-11-19 00:09:03,486 INFO L273 TraceCheckUtils]: 39: Hoare triple {6286#false} assume !false; {6286#false} is VALID [2018-11-19 00:09:03,490 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-19 00:09:03,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:09:03,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-11-19 00:09:03,510 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 40 [2018-11-19 00:09:03,510 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:09:03,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-19 00:09:03,553 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-19 00:09:03,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-19 00:09:03,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-19 00:09:03,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-11-19 00:09:03,555 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 33 states. [2018-11-19 00:09:06,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:09:06,090 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-19 00:09:06,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-19 00:09:06,091 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 40 [2018-11-19 00:09:06,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:09:06,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-19 00:09:06,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2018-11-19 00:09:06,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-19 00:09:06,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2018-11-19 00:09:06,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 45 transitions. [2018-11-19 00:09:06,134 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-19 00:09:06,135 INFO L225 Difference]: With dead ends: 45 [2018-11-19 00:09:06,135 INFO L226 Difference]: Without dead ends: 42 [2018-11-19 00:09:06,136 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=67, Invalid=1055, Unknown=0, NotChecked=0, Total=1122 [2018-11-19 00:09:06,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-19 00:09:06,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-19 00:09:06,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:09:06,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-19 00:09:06,198 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-19 00:09:06,198 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-19 00:09:06,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:09:06,199 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-19 00:09:06,199 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-19 00:09:06,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:09:06,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:09:06,200 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-19 00:09:06,200 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-19 00:09:06,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:09:06,201 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-19 00:09:06,201 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-19 00:09:06,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:09:06,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:09:06,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:09:06,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:09:06,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-19 00:09:06,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-11-19 00:09:06,202 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-11-19 00:09:06,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:09:06,203 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-11-19 00:09:06,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-19 00:09:06,203 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-19 00:09:06,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-19 00:09:06,203 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:09:06,203 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:09:06,204 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:09:06,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:09:06,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1826843712, now seen corresponding path program 25 times [2018-11-19 00:09:06,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:09:06,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:09:06,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:09:06,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:09:06,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:09:06,213 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:09:06,213 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:09:06,213 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-19 00:09:06,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:09:06,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:09:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:09:06,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:09:07,355 INFO L256 TraceCheckUtils]: 0: Hoare triple {6670#true} call ULTIMATE.init(); {6670#true} is VALID [2018-11-19 00:09:07,355 INFO L273 TraceCheckUtils]: 1: Hoare triple {6670#true} ~__return_main~0 := 0;~__return_96~0 := 0; {6670#true} is VALID [2018-11-19 00:09:07,355 INFO L273 TraceCheckUtils]: 2: Hoare triple {6670#true} assume true; {6670#true} is VALID [2018-11-19 00:09:07,356 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6670#true} {6670#true} #48#return; {6670#true} is VALID [2018-11-19 00:09:07,356 INFO L256 TraceCheckUtils]: 4: Hoare triple {6670#true} call #t~ret2 := main(); {6670#true} is VALID [2018-11-19 00:09:07,356 INFO L273 TraceCheckUtils]: 5: Hoare triple {6670#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; {6670#true} is VALID [2018-11-19 00:09:07,356 INFO L273 TraceCheckUtils]: 6: Hoare triple {6670#true} assume !!(1 <= ~main__n~0); {6670#true} is VALID [2018-11-19 00:09:07,358 INFO L273 TraceCheckUtils]: 7: Hoare triple {6670#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {6696#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:09:07,358 INFO L273 TraceCheckUtils]: 8: Hoare triple {6696#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6700#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-19 00:09:07,360 INFO L273 TraceCheckUtils]: 9: Hoare triple {6700#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6704#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:09:07,361 INFO L273 TraceCheckUtils]: 10: Hoare triple {6704#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6708#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:09:07,362 INFO L273 TraceCheckUtils]: 11: Hoare triple {6708#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6712#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:09:07,363 INFO L273 TraceCheckUtils]: 12: Hoare triple {6712#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6716#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:09:07,364 INFO L273 TraceCheckUtils]: 13: Hoare triple {6716#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6720#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:09:07,365 INFO L273 TraceCheckUtils]: 14: Hoare triple {6720#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6724#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:09:07,366 INFO L273 TraceCheckUtils]: 15: Hoare triple {6724#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6728#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:09:07,367 INFO L273 TraceCheckUtils]: 16: Hoare triple {6728#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6732#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-19 00:09:07,368 INFO L273 TraceCheckUtils]: 17: Hoare triple {6732#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6736#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-19 00:09:07,369 INFO L273 TraceCheckUtils]: 18: Hoare triple {6736#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6740#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-19 00:09:07,370 INFO L273 TraceCheckUtils]: 19: Hoare triple {6740#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6744#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-19 00:09:07,371 INFO L273 TraceCheckUtils]: 20: Hoare triple {6744#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6748#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-19 00:09:07,372 INFO L273 TraceCheckUtils]: 21: Hoare triple {6748#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6752#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-19 00:09:07,373 INFO L273 TraceCheckUtils]: 22: Hoare triple {6752#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6756#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-19 00:09:07,373 INFO L273 TraceCheckUtils]: 23: Hoare triple {6756#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6760#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-19 00:09:07,374 INFO L273 TraceCheckUtils]: 24: Hoare triple {6760#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6764#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-19 00:09:07,378 INFO L273 TraceCheckUtils]: 25: Hoare triple {6764#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6768#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-19 00:09:07,379 INFO L273 TraceCheckUtils]: 26: Hoare triple {6768#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6772#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-19 00:09:07,380 INFO L273 TraceCheckUtils]: 27: Hoare triple {6772#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6776#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-19 00:09:07,380 INFO L273 TraceCheckUtils]: 28: Hoare triple {6776#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6780#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-19 00:09:07,382 INFO L273 TraceCheckUtils]: 29: Hoare triple {6780#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6784#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-19 00:09:07,382 INFO L273 TraceCheckUtils]: 30: Hoare triple {6784#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6788#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-19 00:09:07,384 INFO L273 TraceCheckUtils]: 31: Hoare triple {6788#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6792#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-19 00:09:07,385 INFO L273 TraceCheckUtils]: 32: Hoare triple {6792#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6796#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-19 00:09:07,386 INFO L273 TraceCheckUtils]: 33: Hoare triple {6796#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6800#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-19 00:09:07,387 INFO L273 TraceCheckUtils]: 34: Hoare triple {6800#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6804#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-19 00:09:07,388 INFO L273 TraceCheckUtils]: 35: Hoare triple {6804#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6808#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-19 00:09:07,389 INFO L273 TraceCheckUtils]: 36: Hoare triple {6808#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6812#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-19 00:09:07,390 INFO L273 TraceCheckUtils]: 37: Hoare triple {6812#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6816#(and (<= main_~main__i~0 31) (= main_~main__sum~0 465) (<= 30 main_~main__n~0))} is VALID [2018-11-19 00:09:07,391 INFO L273 TraceCheckUtils]: 38: Hoare triple {6816#(and (<= main_~main__i~0 31) (= main_~main__sum~0 465) (<= 30 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6820#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:09:07,392 INFO L273 TraceCheckUtils]: 39: Hoare triple {6820#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {6671#false} is VALID [2018-11-19 00:09:07,392 INFO L273 TraceCheckUtils]: 40: Hoare triple {6671#false} assume !false; {6671#false} is VALID [2018-11-19 00:09:07,396 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-19 00:09:07,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:09:07,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-11-19 00:09:07,415 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 41 [2018-11-19 00:09:07,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:09:07,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-19 00:09:07,460 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-19 00:09:07,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-19 00:09:07,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-19 00:09:07,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-11-19 00:09:07,462 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 34 states. [2018-11-19 00:09:10,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:09:10,112 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-19 00:09:10,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-19 00:09:10,112 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 41 [2018-11-19 00:09:10,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:09:10,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-19 00:09:10,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2018-11-19 00:09:10,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-19 00:09:10,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2018-11-19 00:09:10,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 46 transitions. [2018-11-19 00:09:10,160 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-19 00:09:10,161 INFO L225 Difference]: With dead ends: 46 [2018-11-19 00:09:10,161 INFO L226 Difference]: Without dead ends: 43 [2018-11-19 00:09:10,162 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=69, Invalid=1121, Unknown=0, NotChecked=0, Total=1190 [2018-11-19 00:09:10,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-19 00:09:10,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-19 00:09:10,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:09:10,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2018-11-19 00:09:10,234 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-19 00:09:10,234 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-19 00:09:10,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:09:10,236 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-11-19 00:09:10,236 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-11-19 00:09:10,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:09:10,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:09:10,237 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-19 00:09:10,237 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-19 00:09:10,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:09:10,238 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-11-19 00:09:10,238 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-11-19 00:09:10,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:09:10,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:09:10,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:09:10,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:09:10,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-19 00:09:10,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-11-19 00:09:10,240 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-11-19 00:09:10,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:09:10,240 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-11-19 00:09:10,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-19 00:09:10,240 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-11-19 00:09:10,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-19 00:09:10,241 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:09:10,241 INFO L375 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:09:10,241 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:09:10,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:09:10,241 INFO L82 PathProgramCache]: Analyzing trace with hash 797517766, now seen corresponding path program 26 times [2018-11-19 00:09:10,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:09:10,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:09:10,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:09:10,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:09:10,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:09:10,250 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:09:10,250 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:09:10,250 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-19 00:09:10,271 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-19 00:09:10,330 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-19 00:09:10,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:09:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:09:10,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:09:11,428 INFO L256 TraceCheckUtils]: 0: Hoare triple {7065#true} call ULTIMATE.init(); {7065#true} is VALID [2018-11-19 00:09:11,429 INFO L273 TraceCheckUtils]: 1: Hoare triple {7065#true} ~__return_main~0 := 0;~__return_96~0 := 0; {7065#true} is VALID [2018-11-19 00:09:11,429 INFO L273 TraceCheckUtils]: 2: Hoare triple {7065#true} assume true; {7065#true} is VALID [2018-11-19 00:09:11,429 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7065#true} {7065#true} #48#return; {7065#true} is VALID [2018-11-19 00:09:11,430 INFO L256 TraceCheckUtils]: 4: Hoare triple {7065#true} call #t~ret2 := main(); {7065#true} is VALID [2018-11-19 00:09:11,430 INFO L273 TraceCheckUtils]: 5: Hoare triple {7065#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; {7065#true} is VALID [2018-11-19 00:09:11,430 INFO L273 TraceCheckUtils]: 6: Hoare triple {7065#true} assume !!(1 <= ~main__n~0); {7065#true} is VALID [2018-11-19 00:09:11,430 INFO L273 TraceCheckUtils]: 7: Hoare triple {7065#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {7091#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:09:11,431 INFO L273 TraceCheckUtils]: 8: Hoare triple {7091#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7095#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-19 00:09:11,432 INFO L273 TraceCheckUtils]: 9: Hoare triple {7095#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7099#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:09:11,432 INFO L273 TraceCheckUtils]: 10: Hoare triple {7099#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7103#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:09:11,433 INFO L273 TraceCheckUtils]: 11: Hoare triple {7103#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7107#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:09:11,433 INFO L273 TraceCheckUtils]: 12: Hoare triple {7107#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7111#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:09:11,434 INFO L273 TraceCheckUtils]: 13: Hoare triple {7111#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7115#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:09:11,435 INFO L273 TraceCheckUtils]: 14: Hoare triple {7115#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7119#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:09:11,436 INFO L273 TraceCheckUtils]: 15: Hoare triple {7119#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7123#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:09:11,437 INFO L273 TraceCheckUtils]: 16: Hoare triple {7123#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7127#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-19 00:09:11,438 INFO L273 TraceCheckUtils]: 17: Hoare triple {7127#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7131#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-19 00:09:11,439 INFO L273 TraceCheckUtils]: 18: Hoare triple {7131#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7135#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-19 00:09:11,440 INFO L273 TraceCheckUtils]: 19: Hoare triple {7135#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7139#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-19 00:09:11,441 INFO L273 TraceCheckUtils]: 20: Hoare triple {7139#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7143#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-19 00:09:11,442 INFO L273 TraceCheckUtils]: 21: Hoare triple {7143#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7147#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-19 00:09:11,442 INFO L273 TraceCheckUtils]: 22: Hoare triple {7147#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7151#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-19 00:09:11,443 INFO L273 TraceCheckUtils]: 23: Hoare triple {7151#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7155#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-19 00:09:11,444 INFO L273 TraceCheckUtils]: 24: Hoare triple {7155#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7159#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-19 00:09:11,445 INFO L273 TraceCheckUtils]: 25: Hoare triple {7159#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7163#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-19 00:09:11,446 INFO L273 TraceCheckUtils]: 26: Hoare triple {7163#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7167#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-19 00:09:11,447 INFO L273 TraceCheckUtils]: 27: Hoare triple {7167#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7171#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-19 00:09:11,448 INFO L273 TraceCheckUtils]: 28: Hoare triple {7171#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7175#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-19 00:09:11,448 INFO L273 TraceCheckUtils]: 29: Hoare triple {7175#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7179#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-19 00:09:11,449 INFO L273 TraceCheckUtils]: 30: Hoare triple {7179#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7183#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-19 00:09:11,450 INFO L273 TraceCheckUtils]: 31: Hoare triple {7183#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7187#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-19 00:09:11,451 INFO L273 TraceCheckUtils]: 32: Hoare triple {7187#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7191#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-19 00:09:11,452 INFO L273 TraceCheckUtils]: 33: Hoare triple {7191#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7195#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-19 00:09:11,453 INFO L273 TraceCheckUtils]: 34: Hoare triple {7195#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7199#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-19 00:09:11,454 INFO L273 TraceCheckUtils]: 35: Hoare triple {7199#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7203#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-19 00:09:11,472 INFO L273 TraceCheckUtils]: 36: Hoare triple {7203#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7207#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-19 00:09:11,481 INFO L273 TraceCheckUtils]: 37: Hoare triple {7207#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7211#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-19 00:09:11,494 INFO L273 TraceCheckUtils]: 38: Hoare triple {7211#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7215#(and (<= 31 main_~main__n~0) (= main_~main__sum~0 496) (<= main_~main__i~0 32))} is VALID [2018-11-19 00:09:11,503 INFO L273 TraceCheckUtils]: 39: Hoare triple {7215#(and (<= 31 main_~main__n~0) (= main_~main__sum~0 496) (<= main_~main__i~0 32))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7219#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:09:11,517 INFO L273 TraceCheckUtils]: 40: Hoare triple {7219#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {7066#false} is VALID [2018-11-19 00:09:11,517 INFO L273 TraceCheckUtils]: 41: Hoare triple {7066#false} assume !false; {7066#false} is VALID [2018-11-19 00:09:11,520 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-19 00:09:11,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:09:11,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-11-19 00:09:11,550 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 42 [2018-11-19 00:09:11,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:09:11,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-19 00:09:11,668 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-19 00:09:11,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-19 00:09:11,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-19 00:09:11,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-11-19 00:09:11,670 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 35 states. [2018-11-19 00:09:14,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:09:14,699 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-11-19 00:09:14,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-19 00:09:14,699 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 42 [2018-11-19 00:09:14,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:09:14,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-19 00:09:14,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2018-11-19 00:09:14,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-19 00:09:14,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2018-11-19 00:09:14,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 47 transitions. [2018-11-19 00:09:14,760 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-19 00:09:14,761 INFO L225 Difference]: With dead ends: 47 [2018-11-19 00:09:14,761 INFO L226 Difference]: Without dead ends: 44 [2018-11-19 00:09:14,762 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=71, Invalid=1189, Unknown=0, NotChecked=0, Total=1260 [2018-11-19 00:09:14,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-19 00:09:14,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-19 00:09:14,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:09:14,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2018-11-19 00:09:14,828 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-19 00:09:14,828 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-19 00:09:14,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:09:14,829 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-11-19 00:09:14,830 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-19 00:09:14,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:09:14,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:09:14,830 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-19 00:09:14,830 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-19 00:09:14,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:09:14,831 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-11-19 00:09:14,831 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-19 00:09:14,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:09:14,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:09:14,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:09:14,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:09:14,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-19 00:09:14,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-11-19 00:09:14,833 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-11-19 00:09:14,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:09:14,833 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-11-19 00:09:14,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-19 00:09:14,833 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-19 00:09:14,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-19 00:09:14,834 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:09:14,834 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:09:14,834 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:09:14,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:09:14,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1046815488, now seen corresponding path program 27 times [2018-11-19 00:09:14,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:09:14,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:09:14,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:09:14,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:09:14,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:09:14,843 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:09:14,843 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:09:14,843 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-19 00:09:14,866 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-19 00:09:15,445 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-19 00:09:15,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:09:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:09:15,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:09:16,307 INFO L256 TraceCheckUtils]: 0: Hoare triple {7470#true} call ULTIMATE.init(); {7470#true} is VALID [2018-11-19 00:09:16,307 INFO L273 TraceCheckUtils]: 1: Hoare triple {7470#true} ~__return_main~0 := 0;~__return_96~0 := 0; {7470#true} is VALID [2018-11-19 00:09:16,307 INFO L273 TraceCheckUtils]: 2: Hoare triple {7470#true} assume true; {7470#true} is VALID [2018-11-19 00:09:16,308 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7470#true} {7470#true} #48#return; {7470#true} is VALID [2018-11-19 00:09:16,308 INFO L256 TraceCheckUtils]: 4: Hoare triple {7470#true} call #t~ret2 := main(); {7470#true} is VALID [2018-11-19 00:09:16,308 INFO L273 TraceCheckUtils]: 5: Hoare triple {7470#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; {7470#true} is VALID [2018-11-19 00:09:16,308 INFO L273 TraceCheckUtils]: 6: Hoare triple {7470#true} assume !!(1 <= ~main__n~0); {7470#true} is VALID [2018-11-19 00:09:16,309 INFO L273 TraceCheckUtils]: 7: Hoare triple {7470#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {7496#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:09:16,309 INFO L273 TraceCheckUtils]: 8: Hoare triple {7496#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7500#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-19 00:09:16,310 INFO L273 TraceCheckUtils]: 9: Hoare triple {7500#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7504#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:09:16,310 INFO L273 TraceCheckUtils]: 10: Hoare triple {7504#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7508#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:09:16,311 INFO L273 TraceCheckUtils]: 11: Hoare triple {7508#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7512#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:09:16,312 INFO L273 TraceCheckUtils]: 12: Hoare triple {7512#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7516#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:09:16,313 INFO L273 TraceCheckUtils]: 13: Hoare triple {7516#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7520#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:09:16,314 INFO L273 TraceCheckUtils]: 14: Hoare triple {7520#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7524#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:09:16,315 INFO L273 TraceCheckUtils]: 15: Hoare triple {7524#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7528#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:09:16,316 INFO L273 TraceCheckUtils]: 16: Hoare triple {7528#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7532#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-19 00:09:16,317 INFO L273 TraceCheckUtils]: 17: Hoare triple {7532#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7536#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-19 00:09:16,318 INFO L273 TraceCheckUtils]: 18: Hoare triple {7536#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7540#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-19 00:09:16,319 INFO L273 TraceCheckUtils]: 19: Hoare triple {7540#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7544#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-19 00:09:16,320 INFO L273 TraceCheckUtils]: 20: Hoare triple {7544#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7548#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-19 00:09:16,320 INFO L273 TraceCheckUtils]: 21: Hoare triple {7548#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7552#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-19 00:09:16,321 INFO L273 TraceCheckUtils]: 22: Hoare triple {7552#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7556#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-19 00:09:16,322 INFO L273 TraceCheckUtils]: 23: Hoare triple {7556#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7560#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-19 00:09:16,323 INFO L273 TraceCheckUtils]: 24: Hoare triple {7560#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7564#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-19 00:09:16,324 INFO L273 TraceCheckUtils]: 25: Hoare triple {7564#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7568#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-19 00:09:16,325 INFO L273 TraceCheckUtils]: 26: Hoare triple {7568#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7572#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-19 00:09:16,326 INFO L273 TraceCheckUtils]: 27: Hoare triple {7572#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7576#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-19 00:09:16,327 INFO L273 TraceCheckUtils]: 28: Hoare triple {7576#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7580#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-19 00:09:16,328 INFO L273 TraceCheckUtils]: 29: Hoare triple {7580#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7584#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-19 00:09:16,329 INFO L273 TraceCheckUtils]: 30: Hoare triple {7584#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7588#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-19 00:09:16,330 INFO L273 TraceCheckUtils]: 31: Hoare triple {7588#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7592#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-19 00:09:16,331 INFO L273 TraceCheckUtils]: 32: Hoare triple {7592#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7596#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-19 00:09:16,331 INFO L273 TraceCheckUtils]: 33: Hoare triple {7596#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7600#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-19 00:09:16,332 INFO L273 TraceCheckUtils]: 34: Hoare triple {7600#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7604#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-19 00:09:16,333 INFO L273 TraceCheckUtils]: 35: Hoare triple {7604#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7608#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-19 00:09:16,334 INFO L273 TraceCheckUtils]: 36: Hoare triple {7608#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7612#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-19 00:09:16,335 INFO L273 TraceCheckUtils]: 37: Hoare triple {7612#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7616#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-19 00:09:16,336 INFO L273 TraceCheckUtils]: 38: Hoare triple {7616#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7620#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-19 00:09:16,337 INFO L273 TraceCheckUtils]: 39: Hoare triple {7620#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7624#(and (<= 32 main_~main__n~0) (<= main_~main__i~0 33) (= main_~main__sum~0 528))} is VALID [2018-11-19 00:09:16,338 INFO L273 TraceCheckUtils]: 40: Hoare triple {7624#(and (<= 32 main_~main__n~0) (<= main_~main__i~0 33) (= main_~main__sum~0 528))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7628#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:09:16,339 INFO L273 TraceCheckUtils]: 41: Hoare triple {7628#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {7471#false} is VALID [2018-11-19 00:09:16,339 INFO L273 TraceCheckUtils]: 42: Hoare triple {7471#false} assume !false; {7471#false} is VALID [2018-11-19 00:09:16,342 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-19 00:09:16,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:09:16,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-11-19 00:09:16,361 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 43 [2018-11-19 00:09:16,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:09:16,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-19 00:09:16,405 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-19 00:09:16,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-19 00:09:16,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-19 00:09:16,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-11-19 00:09:16,406 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 36 states. [2018-11-19 00:09:19,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:09:19,529 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-11-19 00:09:19,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-19 00:09:19,529 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 43 [2018-11-19 00:09:19,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:09:19,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-19 00:09:19,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2018-11-19 00:09:19,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-19 00:09:19,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2018-11-19 00:09:19,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 48 transitions. [2018-11-19 00:09:20,025 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-19 00:09:20,025 INFO L225 Difference]: With dead ends: 48 [2018-11-19 00:09:20,026 INFO L226 Difference]: Without dead ends: 45 [2018-11-19 00:09:20,027 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=1259, Unknown=0, NotChecked=0, Total=1332 [2018-11-19 00:09:20,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-19 00:09:20,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-19 00:09:20,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:09:20,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 45 states. [2018-11-19 00:09:20,319 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2018-11-19 00:09:20,319 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2018-11-19 00:09:20,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:09:20,320 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-19 00:09:20,321 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-11-19 00:09:20,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:09:20,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:09:20,322 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2018-11-19 00:09:20,322 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2018-11-19 00:09:20,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:09:20,323 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-19 00:09:20,323 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-11-19 00:09:20,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:09:20,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:09:20,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:09:20,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:09:20,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-19 00:09:20,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-11-19 00:09:20,325 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-11-19 00:09:20,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:09:20,325 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-11-19 00:09:20,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-19 00:09:20,325 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-11-19 00:09:20,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-19 00:09:20,325 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:09:20,326 INFO L375 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:09:20,326 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:09:20,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:09:20,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1908395782, now seen corresponding path program 28 times [2018-11-19 00:09:20,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:09:20,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:09:20,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:09:20,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:09:20,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:09:20,334 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:09:20,334 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:09:20,335 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-19 00:09:20,352 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-19 00:09:20,668 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-19 00:09:20,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:09:20,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:09:20,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:09:22,118 INFO L256 TraceCheckUtils]: 0: Hoare triple {7885#true} call ULTIMATE.init(); {7885#true} is VALID [2018-11-19 00:09:22,119 INFO L273 TraceCheckUtils]: 1: Hoare triple {7885#true} ~__return_main~0 := 0;~__return_96~0 := 0; {7885#true} is VALID [2018-11-19 00:09:22,119 INFO L273 TraceCheckUtils]: 2: Hoare triple {7885#true} assume true; {7885#true} is VALID [2018-11-19 00:09:22,119 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7885#true} {7885#true} #48#return; {7885#true} is VALID [2018-11-19 00:09:22,119 INFO L256 TraceCheckUtils]: 4: Hoare triple {7885#true} call #t~ret2 := main(); {7885#true} is VALID [2018-11-19 00:09:22,119 INFO L273 TraceCheckUtils]: 5: Hoare triple {7885#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; {7885#true} is VALID [2018-11-19 00:09:22,119 INFO L273 TraceCheckUtils]: 6: Hoare triple {7885#true} assume !!(1 <= ~main__n~0); {7885#true} is VALID [2018-11-19 00:09:22,120 INFO L273 TraceCheckUtils]: 7: Hoare triple {7885#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {7911#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:09:22,120 INFO L273 TraceCheckUtils]: 8: Hoare triple {7911#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7915#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-19 00:09:22,121 INFO L273 TraceCheckUtils]: 9: Hoare triple {7915#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7919#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:09:22,121 INFO L273 TraceCheckUtils]: 10: Hoare triple {7919#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7923#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:09:22,122 INFO L273 TraceCheckUtils]: 11: Hoare triple {7923#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7927#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:09:22,122 INFO L273 TraceCheckUtils]: 12: Hoare triple {7927#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7931#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:09:22,123 INFO L273 TraceCheckUtils]: 13: Hoare triple {7931#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7935#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:09:22,124 INFO L273 TraceCheckUtils]: 14: Hoare triple {7935#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7939#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:09:22,125 INFO L273 TraceCheckUtils]: 15: Hoare triple {7939#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7943#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:09:22,126 INFO L273 TraceCheckUtils]: 16: Hoare triple {7943#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7947#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-19 00:09:22,127 INFO L273 TraceCheckUtils]: 17: Hoare triple {7947#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7951#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-19 00:09:22,128 INFO L273 TraceCheckUtils]: 18: Hoare triple {7951#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7955#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-19 00:09:22,128 INFO L273 TraceCheckUtils]: 19: Hoare triple {7955#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7959#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-19 00:09:22,129 INFO L273 TraceCheckUtils]: 20: Hoare triple {7959#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7963#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-19 00:09:22,130 INFO L273 TraceCheckUtils]: 21: Hoare triple {7963#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7967#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-19 00:09:22,131 INFO L273 TraceCheckUtils]: 22: Hoare triple {7967#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7971#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-19 00:09:22,132 INFO L273 TraceCheckUtils]: 23: Hoare triple {7971#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7975#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-19 00:09:22,133 INFO L273 TraceCheckUtils]: 24: Hoare triple {7975#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7979#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-19 00:09:22,134 INFO L273 TraceCheckUtils]: 25: Hoare triple {7979#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7983#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-19 00:09:22,135 INFO L273 TraceCheckUtils]: 26: Hoare triple {7983#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7987#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-19 00:09:22,135 INFO L273 TraceCheckUtils]: 27: Hoare triple {7987#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7991#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-19 00:09:22,136 INFO L273 TraceCheckUtils]: 28: Hoare triple {7991#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7995#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-19 00:09:22,137 INFO L273 TraceCheckUtils]: 29: Hoare triple {7995#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7999#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-19 00:09:22,138 INFO L273 TraceCheckUtils]: 30: Hoare triple {7999#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8003#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-19 00:09:22,139 INFO L273 TraceCheckUtils]: 31: Hoare triple {8003#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8007#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-19 00:09:22,140 INFO L273 TraceCheckUtils]: 32: Hoare triple {8007#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8011#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-19 00:09:22,141 INFO L273 TraceCheckUtils]: 33: Hoare triple {8011#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8015#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-19 00:09:22,141 INFO L273 TraceCheckUtils]: 34: Hoare triple {8015#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8019#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-19 00:09:22,142 INFO L273 TraceCheckUtils]: 35: Hoare triple {8019#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8023#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-19 00:09:22,143 INFO L273 TraceCheckUtils]: 36: Hoare triple {8023#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8027#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-19 00:09:22,144 INFO L273 TraceCheckUtils]: 37: Hoare triple {8027#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8031#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-19 00:09:22,145 INFO L273 TraceCheckUtils]: 38: Hoare triple {8031#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8035#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-19 00:09:22,146 INFO L273 TraceCheckUtils]: 39: Hoare triple {8035#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8039#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-19 00:09:22,146 INFO L273 TraceCheckUtils]: 40: Hoare triple {8039#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8043#(and (<= main_~main__i~0 34) (= main_~main__sum~0 561) (<= 33 main_~main__n~0))} is VALID [2018-11-19 00:09:22,148 INFO L273 TraceCheckUtils]: 41: Hoare triple {8043#(and (<= main_~main__i~0 34) (= main_~main__sum~0 561) (<= 33 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8047#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:09:22,149 INFO L273 TraceCheckUtils]: 42: Hoare triple {8047#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {7886#false} is VALID [2018-11-19 00:09:22,149 INFO L273 TraceCheckUtils]: 43: Hoare triple {7886#false} assume !false; {7886#false} is VALID [2018-11-19 00:09:22,154 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-19 00:09:22,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:09:22,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-11-19 00:09:22,175 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 44 [2018-11-19 00:09:22,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:09:22,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-19 00:09:22,228 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-19 00:09:22,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-19 00:09:22,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-19 00:09:22,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-11-19 00:09:22,229 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 37 states. [2018-11-19 00:09:25,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:09:25,591 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-11-19 00:09:25,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-19 00:09:25,591 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 44 [2018-11-19 00:09:25,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:09:25,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-19 00:09:25,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2018-11-19 00:09:25,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-19 00:09:25,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2018-11-19 00:09:25,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 49 transitions. [2018-11-19 00:09:25,740 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-19 00:09:25,741 INFO L225 Difference]: With dead ends: 49 [2018-11-19 00:09:25,742 INFO L226 Difference]: Without dead ends: 46 [2018-11-19 00:09:25,743 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=75, Invalid=1331, Unknown=0, NotChecked=0, Total=1406 [2018-11-19 00:09:25,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-19 00:09:25,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-19 00:09:25,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:09:25,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2018-11-19 00:09:25,816 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-19 00:09:25,816 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-19 00:09:25,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:09:25,817 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-19 00:09:25,817 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-19 00:09:25,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:09:25,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:09:25,818 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-19 00:09:25,818 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-19 00:09:25,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:09:25,819 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-19 00:09:25,819 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-19 00:09:25,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:09:25,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:09:25,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:09:25,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:09:25,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-19 00:09:25,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-11-19 00:09:25,821 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-11-19 00:09:25,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:09:25,821 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-11-19 00:09:25,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-19 00:09:25,821 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-19 00:09:25,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-19 00:09:25,822 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:09:25,822 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:09:25,822 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:09:25,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:09:25,823 INFO L82 PathProgramCache]: Analyzing trace with hash -969335360, now seen corresponding path program 29 times [2018-11-19 00:09:25,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:09:25,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:09:25,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:09:25,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:09:25,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:09:25,831 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:09:25,831 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:09:25,831 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-19 00:09:25,847 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-19 00:09:25,906 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-11-19 00:09:25,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:09:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:09:25,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:09:26,851 INFO L256 TraceCheckUtils]: 0: Hoare triple {8310#true} call ULTIMATE.init(); {8310#true} is VALID [2018-11-19 00:09:26,851 INFO L273 TraceCheckUtils]: 1: Hoare triple {8310#true} ~__return_main~0 := 0;~__return_96~0 := 0; {8310#true} is VALID [2018-11-19 00:09:26,852 INFO L273 TraceCheckUtils]: 2: Hoare triple {8310#true} assume true; {8310#true} is VALID [2018-11-19 00:09:26,852 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8310#true} {8310#true} #48#return; {8310#true} is VALID [2018-11-19 00:09:26,852 INFO L256 TraceCheckUtils]: 4: Hoare triple {8310#true} call #t~ret2 := main(); {8310#true} is VALID [2018-11-19 00:09:26,852 INFO L273 TraceCheckUtils]: 5: Hoare triple {8310#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; {8310#true} is VALID [2018-11-19 00:09:26,853 INFO L273 TraceCheckUtils]: 6: Hoare triple {8310#true} assume !!(1 <= ~main__n~0); {8310#true} is VALID [2018-11-19 00:09:26,853 INFO L273 TraceCheckUtils]: 7: Hoare triple {8310#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {8336#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:09:26,854 INFO L273 TraceCheckUtils]: 8: Hoare triple {8336#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8340#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-19 00:09:26,854 INFO L273 TraceCheckUtils]: 9: Hoare triple {8340#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8344#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:09:26,855 INFO L273 TraceCheckUtils]: 10: Hoare triple {8344#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8348#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:09:26,855 INFO L273 TraceCheckUtils]: 11: Hoare triple {8348#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8352#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:09:26,856 INFO L273 TraceCheckUtils]: 12: Hoare triple {8352#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8356#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:09:26,857 INFO L273 TraceCheckUtils]: 13: Hoare triple {8356#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8360#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:09:26,858 INFO L273 TraceCheckUtils]: 14: Hoare triple {8360#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8364#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:09:26,859 INFO L273 TraceCheckUtils]: 15: Hoare triple {8364#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8368#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:09:26,860 INFO L273 TraceCheckUtils]: 16: Hoare triple {8368#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8372#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-19 00:09:26,861 INFO L273 TraceCheckUtils]: 17: Hoare triple {8372#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8376#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-19 00:09:26,861 INFO L273 TraceCheckUtils]: 18: Hoare triple {8376#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8380#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-19 00:09:26,862 INFO L273 TraceCheckUtils]: 19: Hoare triple {8380#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8384#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-19 00:09:26,863 INFO L273 TraceCheckUtils]: 20: Hoare triple {8384#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8388#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-19 00:09:26,864 INFO L273 TraceCheckUtils]: 21: Hoare triple {8388#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8392#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-19 00:09:26,865 INFO L273 TraceCheckUtils]: 22: Hoare triple {8392#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8396#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-19 00:09:26,866 INFO L273 TraceCheckUtils]: 23: Hoare triple {8396#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8400#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-19 00:09:26,867 INFO L273 TraceCheckUtils]: 24: Hoare triple {8400#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8404#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-19 00:09:26,868 INFO L273 TraceCheckUtils]: 25: Hoare triple {8404#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8408#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-19 00:09:26,869 INFO L273 TraceCheckUtils]: 26: Hoare triple {8408#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8412#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-19 00:09:26,869 INFO L273 TraceCheckUtils]: 27: Hoare triple {8412#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8416#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-19 00:09:26,870 INFO L273 TraceCheckUtils]: 28: Hoare triple {8416#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8420#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-19 00:09:26,871 INFO L273 TraceCheckUtils]: 29: Hoare triple {8420#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8424#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-19 00:09:26,872 INFO L273 TraceCheckUtils]: 30: Hoare triple {8424#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8428#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-19 00:09:26,873 INFO L273 TraceCheckUtils]: 31: Hoare triple {8428#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8432#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-19 00:09:26,874 INFO L273 TraceCheckUtils]: 32: Hoare triple {8432#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8436#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-19 00:09:26,875 INFO L273 TraceCheckUtils]: 33: Hoare triple {8436#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8440#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-19 00:09:26,876 INFO L273 TraceCheckUtils]: 34: Hoare triple {8440#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8444#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-19 00:09:26,877 INFO L273 TraceCheckUtils]: 35: Hoare triple {8444#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8448#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-19 00:09:26,878 INFO L273 TraceCheckUtils]: 36: Hoare triple {8448#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8452#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-19 00:09:26,879 INFO L273 TraceCheckUtils]: 37: Hoare triple {8452#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8456#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-19 00:09:26,880 INFO L273 TraceCheckUtils]: 38: Hoare triple {8456#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8460#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-19 00:09:26,880 INFO L273 TraceCheckUtils]: 39: Hoare triple {8460#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8464#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-19 00:09:26,881 INFO L273 TraceCheckUtils]: 40: Hoare triple {8464#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8468#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} is VALID [2018-11-19 00:09:26,882 INFO L273 TraceCheckUtils]: 41: Hoare triple {8468#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8472#(and (<= main_~main__i~0 35) (<= 34 main_~main__n~0) (= main_~main__sum~0 595))} is VALID [2018-11-19 00:09:26,884 INFO L273 TraceCheckUtils]: 42: Hoare triple {8472#(and (<= main_~main__i~0 35) (<= 34 main_~main__n~0) (= main_~main__sum~0 595))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8476#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:09:26,884 INFO L273 TraceCheckUtils]: 43: Hoare triple {8476#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {8311#false} is VALID [2018-11-19 00:09:26,884 INFO L273 TraceCheckUtils]: 44: Hoare triple {8311#false} assume !false; {8311#false} is VALID [2018-11-19 00:09:26,888 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-19 00:09:26,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:09:26,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-11-19 00:09:26,907 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 45 [2018-11-19 00:09:26,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:09:26,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-19 00:09:26,951 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-19 00:09:26,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-19 00:09:26,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-19 00:09:26,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-11-19 00:09:26,952 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 38 states. [2018-11-19 00:09:30,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:09:30,448 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-11-19 00:09:30,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-19 00:09:30,448 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 45 [2018-11-19 00:09:30,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:09:30,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-19 00:09:30,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2018-11-19 00:09:30,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-19 00:09:30,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2018-11-19 00:09:30,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 50 transitions. [2018-11-19 00:09:30,513 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:09:30,514 INFO L225 Difference]: With dead ends: 50 [2018-11-19 00:09:30,514 INFO L226 Difference]: Without dead ends: 47 [2018-11-19 00:09:30,515 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=77, Invalid=1405, Unknown=0, NotChecked=0, Total=1482 [2018-11-19 00:09:30,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-19 00:09:30,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-19 00:09:30,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:09:30,589 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2018-11-19 00:09:30,589 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-19 00:09:30,589 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-19 00:09:30,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:09:30,590 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-11-19 00:09:30,590 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-11-19 00:09:30,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:09:30,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:09:30,591 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-19 00:09:30,591 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-19 00:09:30,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:09:30,592 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-11-19 00:09:30,592 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-11-19 00:09:30,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:09:30,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:09:30,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:09:30,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:09:30,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-19 00:09:30,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-11-19 00:09:30,594 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-11-19 00:09:30,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:09:30,594 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-11-19 00:09:30,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-19 00:09:30,594 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-11-19 00:09:30,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-19 00:09:30,595 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:09:30,595 INFO L375 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:09:30,595 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:09:30,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:09:30,595 INFO L82 PathProgramCache]: Analyzing trace with hash 15312454, now seen corresponding path program 30 times [2018-11-19 00:09:30,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:09:30,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:09:30,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:09:30,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:09:30,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:09:30,603 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:09:30,604 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:09:30,604 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-19 00:09:30,619 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-19 00:09:30,886 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-11-19 00:09:30,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:09:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:09:30,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:09:31,850 INFO L256 TraceCheckUtils]: 0: Hoare triple {8745#true} call ULTIMATE.init(); {8745#true} is VALID [2018-11-19 00:09:31,850 INFO L273 TraceCheckUtils]: 1: Hoare triple {8745#true} ~__return_main~0 := 0;~__return_96~0 := 0; {8745#true} is VALID [2018-11-19 00:09:31,850 INFO L273 TraceCheckUtils]: 2: Hoare triple {8745#true} assume true; {8745#true} is VALID [2018-11-19 00:09:31,850 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8745#true} {8745#true} #48#return; {8745#true} is VALID [2018-11-19 00:09:31,851 INFO L256 TraceCheckUtils]: 4: Hoare triple {8745#true} call #t~ret2 := main(); {8745#true} is VALID [2018-11-19 00:09:31,851 INFO L273 TraceCheckUtils]: 5: Hoare triple {8745#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; {8745#true} is VALID [2018-11-19 00:09:31,851 INFO L273 TraceCheckUtils]: 6: Hoare triple {8745#true} assume !!(1 <= ~main__n~0); {8745#true} is VALID [2018-11-19 00:09:31,852 INFO L273 TraceCheckUtils]: 7: Hoare triple {8745#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {8771#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:09:31,852 INFO L273 TraceCheckUtils]: 8: Hoare triple {8771#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8775#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-19 00:09:31,853 INFO L273 TraceCheckUtils]: 9: Hoare triple {8775#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8779#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:09:31,854 INFO L273 TraceCheckUtils]: 10: Hoare triple {8779#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8783#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:09:31,854 INFO L273 TraceCheckUtils]: 11: Hoare triple {8783#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8787#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:09:31,855 INFO L273 TraceCheckUtils]: 12: Hoare triple {8787#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8791#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:09:31,856 INFO L273 TraceCheckUtils]: 13: Hoare triple {8791#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8795#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:09:31,857 INFO L273 TraceCheckUtils]: 14: Hoare triple {8795#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8799#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:09:31,858 INFO L273 TraceCheckUtils]: 15: Hoare triple {8799#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8803#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:09:31,859 INFO L273 TraceCheckUtils]: 16: Hoare triple {8803#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8807#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-19 00:09:31,860 INFO L273 TraceCheckUtils]: 17: Hoare triple {8807#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8811#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-19 00:09:31,860 INFO L273 TraceCheckUtils]: 18: Hoare triple {8811#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8815#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-19 00:09:31,861 INFO L273 TraceCheckUtils]: 19: Hoare triple {8815#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8819#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-19 00:09:31,862 INFO L273 TraceCheckUtils]: 20: Hoare triple {8819#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8823#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-19 00:09:31,863 INFO L273 TraceCheckUtils]: 21: Hoare triple {8823#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8827#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-19 00:09:31,864 INFO L273 TraceCheckUtils]: 22: Hoare triple {8827#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8831#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-19 00:09:31,865 INFO L273 TraceCheckUtils]: 23: Hoare triple {8831#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8835#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-19 00:09:31,866 INFO L273 TraceCheckUtils]: 24: Hoare triple {8835#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8839#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-19 00:09:31,866 INFO L273 TraceCheckUtils]: 25: Hoare triple {8839#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8843#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-19 00:09:31,867 INFO L273 TraceCheckUtils]: 26: Hoare triple {8843#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8847#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-19 00:09:31,868 INFO L273 TraceCheckUtils]: 27: Hoare triple {8847#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8851#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-19 00:09:31,869 INFO L273 TraceCheckUtils]: 28: Hoare triple {8851#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8855#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-19 00:09:31,870 INFO L273 TraceCheckUtils]: 29: Hoare triple {8855#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8859#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-19 00:09:31,871 INFO L273 TraceCheckUtils]: 30: Hoare triple {8859#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8863#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-19 00:09:31,872 INFO L273 TraceCheckUtils]: 31: Hoare triple {8863#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8867#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-19 00:09:31,873 INFO L273 TraceCheckUtils]: 32: Hoare triple {8867#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8871#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-19 00:09:31,873 INFO L273 TraceCheckUtils]: 33: Hoare triple {8871#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8875#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-19 00:09:31,874 INFO L273 TraceCheckUtils]: 34: Hoare triple {8875#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8879#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-19 00:09:31,875 INFO L273 TraceCheckUtils]: 35: Hoare triple {8879#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8883#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-19 00:09:31,876 INFO L273 TraceCheckUtils]: 36: Hoare triple {8883#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8887#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-19 00:09:31,877 INFO L273 TraceCheckUtils]: 37: Hoare triple {8887#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8891#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-19 00:09:31,878 INFO L273 TraceCheckUtils]: 38: Hoare triple {8891#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8895#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-19 00:09:31,879 INFO L273 TraceCheckUtils]: 39: Hoare triple {8895#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8899#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-19 00:09:31,879 INFO L273 TraceCheckUtils]: 40: Hoare triple {8899#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8903#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} is VALID [2018-11-19 00:09:31,880 INFO L273 TraceCheckUtils]: 41: Hoare triple {8903#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8907#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} is VALID [2018-11-19 00:09:31,881 INFO L273 TraceCheckUtils]: 42: Hoare triple {8907#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8911#(and (<= main_~main__i~0 36) (= main_~main__sum~0 630) (<= 35 main_~main__n~0))} is VALID [2018-11-19 00:09:31,882 INFO L273 TraceCheckUtils]: 43: Hoare triple {8911#(and (<= main_~main__i~0 36) (= main_~main__sum~0 630) (<= 35 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8915#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:09:31,883 INFO L273 TraceCheckUtils]: 44: Hoare triple {8915#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {8746#false} is VALID [2018-11-19 00:09:31,883 INFO L273 TraceCheckUtils]: 45: Hoare triple {8746#false} assume !false; {8746#false} is VALID [2018-11-19 00:09:31,886 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-19 00:09:31,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:09:31,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-11-19 00:09:31,906 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 46 [2018-11-19 00:09:31,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:09:31,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2018-11-19 00:09:31,949 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-19 00:09:31,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-19 00:09:31,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-19 00:09:31,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-11-19 00:09:31,951 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 39 states. [2018-11-19 00:09:35,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:09:35,523 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-11-19 00:09:35,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-19 00:09:35,523 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 46 [2018-11-19 00:09:35,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:09:35,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-19 00:09:35,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2018-11-19 00:09:35,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-19 00:09:35,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2018-11-19 00:09:35,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 51 transitions. [2018-11-19 00:09:35,601 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:09:35,602 INFO L225 Difference]: With dead ends: 51 [2018-11-19 00:09:35,602 INFO L226 Difference]: Without dead ends: 48 [2018-11-19 00:09:35,604 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=79, Invalid=1481, Unknown=0, NotChecked=0, Total=1560 [2018-11-19 00:09:35,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-19 00:09:35,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-19 00:09:35,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:09:35,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2018-11-19 00:09:35,698 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-19 00:09:35,698 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-19 00:09:35,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:09:35,699 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-11-19 00:09:35,699 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-11-19 00:09:35,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:09:35,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:09:35,700 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-19 00:09:35,700 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-19 00:09:35,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:09:35,701 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-11-19 00:09:35,701 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-11-19 00:09:35,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:09:35,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:09:35,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:09:35,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:09:35,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-19 00:09:35,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-11-19 00:09:35,703 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-11-19 00:09:35,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:09:35,703 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-11-19 00:09:35,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-19 00:09:35,704 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-11-19 00:09:35,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-19 00:09:35,704 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:09:35,704 INFO L375 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:09:35,705 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:09:35,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:09:35,705 INFO L82 PathProgramCache]: Analyzing trace with hash 474623616, now seen corresponding path program 31 times [2018-11-19 00:09:35,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:09:35,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:09:35,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:09:35,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:09:35,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:09:35,713 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:09:35,713 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:09:35,713 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-19 00:09:35,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:09:35,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:09:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:09:35,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:09:37,114 INFO L256 TraceCheckUtils]: 0: Hoare triple {9190#true} call ULTIMATE.init(); {9190#true} is VALID [2018-11-19 00:09:37,114 INFO L273 TraceCheckUtils]: 1: Hoare triple {9190#true} ~__return_main~0 := 0;~__return_96~0 := 0; {9190#true} is VALID [2018-11-19 00:09:37,115 INFO L273 TraceCheckUtils]: 2: Hoare triple {9190#true} assume true; {9190#true} is VALID [2018-11-19 00:09:37,115 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9190#true} {9190#true} #48#return; {9190#true} is VALID [2018-11-19 00:09:37,115 INFO L256 TraceCheckUtils]: 4: Hoare triple {9190#true} call #t~ret2 := main(); {9190#true} is VALID [2018-11-19 00:09:37,115 INFO L273 TraceCheckUtils]: 5: Hoare triple {9190#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; {9190#true} is VALID [2018-11-19 00:09:37,116 INFO L273 TraceCheckUtils]: 6: Hoare triple {9190#true} assume !!(1 <= ~main__n~0); {9190#true} is VALID [2018-11-19 00:09:37,116 INFO L273 TraceCheckUtils]: 7: Hoare triple {9190#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {9216#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:09:37,117 INFO L273 TraceCheckUtils]: 8: Hoare triple {9216#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9220#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-19 00:09:37,117 INFO L273 TraceCheckUtils]: 9: Hoare triple {9220#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9224#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:09:37,118 INFO L273 TraceCheckUtils]: 10: Hoare triple {9224#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9228#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:09:37,118 INFO L273 TraceCheckUtils]: 11: Hoare triple {9228#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9232#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:09:37,119 INFO L273 TraceCheckUtils]: 12: Hoare triple {9232#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9236#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:09:37,120 INFO L273 TraceCheckUtils]: 13: Hoare triple {9236#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9240#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:09:37,121 INFO L273 TraceCheckUtils]: 14: Hoare triple {9240#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9244#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:09:37,122 INFO L273 TraceCheckUtils]: 15: Hoare triple {9244#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9248#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:09:37,123 INFO L273 TraceCheckUtils]: 16: Hoare triple {9248#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9252#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-19 00:09:37,124 INFO L273 TraceCheckUtils]: 17: Hoare triple {9252#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9256#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-19 00:09:37,125 INFO L273 TraceCheckUtils]: 18: Hoare triple {9256#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9260#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-19 00:09:37,126 INFO L273 TraceCheckUtils]: 19: Hoare triple {9260#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9264#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-19 00:09:37,127 INFO L273 TraceCheckUtils]: 20: Hoare triple {9264#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9268#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-19 00:09:37,128 INFO L273 TraceCheckUtils]: 21: Hoare triple {9268#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9272#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-19 00:09:37,129 INFO L273 TraceCheckUtils]: 22: Hoare triple {9272#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9276#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-19 00:09:37,130 INFO L273 TraceCheckUtils]: 23: Hoare triple {9276#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9280#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-19 00:09:37,131 INFO L273 TraceCheckUtils]: 24: Hoare triple {9280#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9284#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-19 00:09:37,131 INFO L273 TraceCheckUtils]: 25: Hoare triple {9284#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9288#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-19 00:09:37,132 INFO L273 TraceCheckUtils]: 26: Hoare triple {9288#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9292#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-19 00:09:37,133 INFO L273 TraceCheckUtils]: 27: Hoare triple {9292#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9296#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-19 00:09:37,134 INFO L273 TraceCheckUtils]: 28: Hoare triple {9296#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9300#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-19 00:09:37,135 INFO L273 TraceCheckUtils]: 29: Hoare triple {9300#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9304#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-19 00:09:37,136 INFO L273 TraceCheckUtils]: 30: Hoare triple {9304#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9308#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-19 00:09:37,137 INFO L273 TraceCheckUtils]: 31: Hoare triple {9308#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9312#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-19 00:09:37,137 INFO L273 TraceCheckUtils]: 32: Hoare triple {9312#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9316#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-19 00:09:37,138 INFO L273 TraceCheckUtils]: 33: Hoare triple {9316#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9320#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-19 00:09:37,139 INFO L273 TraceCheckUtils]: 34: Hoare triple {9320#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9324#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-19 00:09:37,140 INFO L273 TraceCheckUtils]: 35: Hoare triple {9324#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9328#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-19 00:09:37,141 INFO L273 TraceCheckUtils]: 36: Hoare triple {9328#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9332#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-19 00:09:37,142 INFO L273 TraceCheckUtils]: 37: Hoare triple {9332#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9336#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-19 00:09:37,143 INFO L273 TraceCheckUtils]: 38: Hoare triple {9336#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9340#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-19 00:09:37,143 INFO L273 TraceCheckUtils]: 39: Hoare triple {9340#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9344#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-19 00:09:37,144 INFO L273 TraceCheckUtils]: 40: Hoare triple {9344#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9348#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} is VALID [2018-11-19 00:09:37,145 INFO L273 TraceCheckUtils]: 41: Hoare triple {9348#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9352#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} is VALID [2018-11-19 00:09:37,146 INFO L273 TraceCheckUtils]: 42: Hoare triple {9352#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9356#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} is VALID [2018-11-19 00:09:37,147 INFO L273 TraceCheckUtils]: 43: Hoare triple {9356#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9360#(and (<= main_~main__i~0 37) (<= 36 main_~main__n~0) (= main_~main__sum~0 666))} is VALID [2018-11-19 00:09:37,148 INFO L273 TraceCheckUtils]: 44: Hoare triple {9360#(and (<= main_~main__i~0 37) (<= 36 main_~main__n~0) (= main_~main__sum~0 666))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9364#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:09:37,149 INFO L273 TraceCheckUtils]: 45: Hoare triple {9364#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {9191#false} is VALID [2018-11-19 00:09:37,149 INFO L273 TraceCheckUtils]: 46: Hoare triple {9191#false} assume !false; {9191#false} is VALID [2018-11-19 00:09:37,153 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-19 00:09:37,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:09:37,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-11-19 00:09:37,172 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 47 [2018-11-19 00:09:37,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:09:37,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-19 00:09:37,219 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-19 00:09:37,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-19 00:09:37,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-19 00:09:37,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-11-19 00:09:37,220 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 40 states. [2018-11-19 00:09:41,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:09:41,001 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-11-19 00:09:41,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-19 00:09:41,001 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 47 [2018-11-19 00:09:41,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:09:41,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-19 00:09:41,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2018-11-19 00:09:41,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-19 00:09:41,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2018-11-19 00:09:41,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 52 transitions. [2018-11-19 00:09:41,121 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:09:41,122 INFO L225 Difference]: With dead ends: 52 [2018-11-19 00:09:41,123 INFO L226 Difference]: Without dead ends: 49 [2018-11-19 00:09:41,124 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=1559, Unknown=0, NotChecked=0, Total=1640 [2018-11-19 00:09:41,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-19 00:09:41,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-19 00:09:41,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:09:41,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2018-11-19 00:09:41,224 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-19 00:09:41,224 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-19 00:09:41,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:09:41,225 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-11-19 00:09:41,225 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-11-19 00:09:41,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:09:41,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:09:41,226 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-19 00:09:41,226 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-19 00:09:41,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:09:41,226 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-11-19 00:09:41,227 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-11-19 00:09:41,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:09:41,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:09:41,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:09:41,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:09:41,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-19 00:09:41,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-11-19 00:09:41,228 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-11-19 00:09:41,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:09:41,228 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-11-19 00:09:41,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-19 00:09:41,228 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-11-19 00:09:41,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-19 00:09:41,229 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:09:41,229 INFO L375 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:09:41,229 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:09:41,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:09:41,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1828367750, now seen corresponding path program 32 times [2018-11-19 00:09:41,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:09:41,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:09:41,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:09:41,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:09:41,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:09:41,238 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:09:41,238 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:09:41,238 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-19 00:09:41,257 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-19 00:09:41,314 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-19 00:09:41,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:09:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:09:41,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:09:42,431 INFO L256 TraceCheckUtils]: 0: Hoare triple {9645#true} call ULTIMATE.init(); {9645#true} is VALID [2018-11-19 00:09:42,431 INFO L273 TraceCheckUtils]: 1: Hoare triple {9645#true} ~__return_main~0 := 0;~__return_96~0 := 0; {9645#true} is VALID [2018-11-19 00:09:42,432 INFO L273 TraceCheckUtils]: 2: Hoare triple {9645#true} assume true; {9645#true} is VALID [2018-11-19 00:09:42,432 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9645#true} {9645#true} #48#return; {9645#true} is VALID [2018-11-19 00:09:42,432 INFO L256 TraceCheckUtils]: 4: Hoare triple {9645#true} call #t~ret2 := main(); {9645#true} is VALID [2018-11-19 00:09:42,432 INFO L273 TraceCheckUtils]: 5: Hoare triple {9645#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; {9645#true} is VALID [2018-11-19 00:09:42,432 INFO L273 TraceCheckUtils]: 6: Hoare triple {9645#true} assume !!(1 <= ~main__n~0); {9645#true} is VALID [2018-11-19 00:09:42,433 INFO L273 TraceCheckUtils]: 7: Hoare triple {9645#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {9671#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:09:42,434 INFO L273 TraceCheckUtils]: 8: Hoare triple {9671#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9675#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-19 00:09:42,434 INFO L273 TraceCheckUtils]: 9: Hoare triple {9675#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9679#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:09:42,435 INFO L273 TraceCheckUtils]: 10: Hoare triple {9679#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9683#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:09:42,435 INFO L273 TraceCheckUtils]: 11: Hoare triple {9683#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9687#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:09:42,436 INFO L273 TraceCheckUtils]: 12: Hoare triple {9687#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9691#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:09:42,437 INFO L273 TraceCheckUtils]: 13: Hoare triple {9691#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9695#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:09:42,438 INFO L273 TraceCheckUtils]: 14: Hoare triple {9695#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9699#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:09:42,439 INFO L273 TraceCheckUtils]: 15: Hoare triple {9699#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9703#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:09:42,440 INFO L273 TraceCheckUtils]: 16: Hoare triple {9703#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9707#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-19 00:09:42,441 INFO L273 TraceCheckUtils]: 17: Hoare triple {9707#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9711#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-19 00:09:42,441 INFO L273 TraceCheckUtils]: 18: Hoare triple {9711#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9715#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-19 00:09:42,442 INFO L273 TraceCheckUtils]: 19: Hoare triple {9715#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9719#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-19 00:09:42,443 INFO L273 TraceCheckUtils]: 20: Hoare triple {9719#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9723#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-19 00:09:42,444 INFO L273 TraceCheckUtils]: 21: Hoare triple {9723#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9727#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-19 00:09:42,445 INFO L273 TraceCheckUtils]: 22: Hoare triple {9727#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9731#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-19 00:09:42,446 INFO L273 TraceCheckUtils]: 23: Hoare triple {9731#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9735#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-19 00:09:42,447 INFO L273 TraceCheckUtils]: 24: Hoare triple {9735#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9739#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-19 00:09:42,447 INFO L273 TraceCheckUtils]: 25: Hoare triple {9739#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9743#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-19 00:09:42,448 INFO L273 TraceCheckUtils]: 26: Hoare triple {9743#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9747#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-19 00:09:42,449 INFO L273 TraceCheckUtils]: 27: Hoare triple {9747#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9751#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-19 00:09:42,450 INFO L273 TraceCheckUtils]: 28: Hoare triple {9751#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9755#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-19 00:09:42,451 INFO L273 TraceCheckUtils]: 29: Hoare triple {9755#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9759#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-19 00:09:42,452 INFO L273 TraceCheckUtils]: 30: Hoare triple {9759#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9763#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-19 00:09:42,452 INFO L273 TraceCheckUtils]: 31: Hoare triple {9763#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9767#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-19 00:09:42,453 INFO L273 TraceCheckUtils]: 32: Hoare triple {9767#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9771#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-19 00:09:42,454 INFO L273 TraceCheckUtils]: 33: Hoare triple {9771#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9775#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-19 00:09:42,455 INFO L273 TraceCheckUtils]: 34: Hoare triple {9775#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9779#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-19 00:09:42,456 INFO L273 TraceCheckUtils]: 35: Hoare triple {9779#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9783#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-19 00:09:42,457 INFO L273 TraceCheckUtils]: 36: Hoare triple {9783#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9787#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-19 00:09:42,458 INFO L273 TraceCheckUtils]: 37: Hoare triple {9787#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9791#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-19 00:09:42,458 INFO L273 TraceCheckUtils]: 38: Hoare triple {9791#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9795#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-19 00:09:42,459 INFO L273 TraceCheckUtils]: 39: Hoare triple {9795#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9799#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-19 00:09:42,460 INFO L273 TraceCheckUtils]: 40: Hoare triple {9799#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9803#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} is VALID [2018-11-19 00:09:42,461 INFO L273 TraceCheckUtils]: 41: Hoare triple {9803#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9807#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} is VALID [2018-11-19 00:09:42,462 INFO L273 TraceCheckUtils]: 42: Hoare triple {9807#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9811#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} is VALID [2018-11-19 00:09:42,463 INFO L273 TraceCheckUtils]: 43: Hoare triple {9811#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9815#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} is VALID [2018-11-19 00:09:42,463 INFO L273 TraceCheckUtils]: 44: Hoare triple {9815#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9819#(and (<= 37 main_~main__n~0) (= main_~main__sum~0 703) (<= main_~main__i~0 38))} is VALID [2018-11-19 00:09:42,465 INFO L273 TraceCheckUtils]: 45: Hoare triple {9819#(and (<= 37 main_~main__n~0) (= main_~main__sum~0 703) (<= main_~main__i~0 38))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9823#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:09:42,465 INFO L273 TraceCheckUtils]: 46: Hoare triple {9823#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {9646#false} is VALID [2018-11-19 00:09:42,465 INFO L273 TraceCheckUtils]: 47: Hoare triple {9646#false} assume !false; {9646#false} is VALID [2018-11-19 00:09:42,470 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-19 00:09:42,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:09:42,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-11-19 00:09:42,489 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 48 [2018-11-19 00:09:42,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:09:42,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-19 00:09:42,536 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-19 00:09:42,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-19 00:09:42,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-19 00:09:42,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-11-19 00:09:42,538 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 41 states. [2018-11-19 00:09:46,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:09:46,538 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-11-19 00:09:46,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-19 00:09:46,538 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 48 [2018-11-19 00:09:46,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:09:46,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-19 00:09:46,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2018-11-19 00:09:46,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-19 00:09:46,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2018-11-19 00:09:46,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 53 transitions. [2018-11-19 00:09:46,590 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:09:46,591 INFO L225 Difference]: With dead ends: 53 [2018-11-19 00:09:46,591 INFO L226 Difference]: Without dead ends: 50 [2018-11-19 00:09:46,593 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=83, Invalid=1639, Unknown=0, NotChecked=0, Total=1722 [2018-11-19 00:09:46,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-19 00:09:46,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-19 00:09:46,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:09:46,718 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 50 states. [2018-11-19 00:09:46,718 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-19 00:09:46,718 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-19 00:09:46,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:09:46,719 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-11-19 00:09:46,720 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-11-19 00:09:46,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:09:46,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:09:46,720 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-19 00:09:46,720 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-19 00:09:46,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:09:46,721 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-11-19 00:09:46,721 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-11-19 00:09:46,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:09:46,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:09:46,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:09:46,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:09:46,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-19 00:09:46,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-11-19 00:09:46,723 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-11-19 00:09:46,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:09:46,723 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-11-19 00:09:46,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-19 00:09:46,723 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-11-19 00:09:46,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-19 00:09:46,724 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:09:46,724 INFO L375 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:09:46,724 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:09:46,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:09:46,725 INFO L82 PathProgramCache]: Analyzing trace with hash 844762944, now seen corresponding path program 33 times [2018-11-19 00:09:46,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:09:46,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:09:46,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:09:46,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:09:46,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:09:46,733 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:09:46,734 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:09:46,734 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-19 00:09:46,753 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-19 00:09:47,978 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-19 00:09:47,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:09:47,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:09:48,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:09:49,746 INFO L256 TraceCheckUtils]: 0: Hoare triple {10110#true} call ULTIMATE.init(); {10110#true} is VALID [2018-11-19 00:09:49,746 INFO L273 TraceCheckUtils]: 1: Hoare triple {10110#true} ~__return_main~0 := 0;~__return_96~0 := 0; {10110#true} is VALID [2018-11-19 00:09:49,747 INFO L273 TraceCheckUtils]: 2: Hoare triple {10110#true} assume true; {10110#true} is VALID [2018-11-19 00:09:49,747 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10110#true} {10110#true} #48#return; {10110#true} is VALID [2018-11-19 00:09:49,747 INFO L256 TraceCheckUtils]: 4: Hoare triple {10110#true} call #t~ret2 := main(); {10110#true} is VALID [2018-11-19 00:09:49,747 INFO L273 TraceCheckUtils]: 5: Hoare triple {10110#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; {10110#true} is VALID [2018-11-19 00:09:49,747 INFO L273 TraceCheckUtils]: 6: Hoare triple {10110#true} assume !!(1 <= ~main__n~0); {10110#true} is VALID [2018-11-19 00:09:49,748 INFO L273 TraceCheckUtils]: 7: Hoare triple {10110#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {10136#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:09:49,749 INFO L273 TraceCheckUtils]: 8: Hoare triple {10136#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10140#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-19 00:09:49,749 INFO L273 TraceCheckUtils]: 9: Hoare triple {10140#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10144#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:09:49,750 INFO L273 TraceCheckUtils]: 10: Hoare triple {10144#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10148#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:09:49,750 INFO L273 TraceCheckUtils]: 11: Hoare triple {10148#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10152#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:09:49,751 INFO L273 TraceCheckUtils]: 12: Hoare triple {10152#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10156#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:09:49,751 INFO L273 TraceCheckUtils]: 13: Hoare triple {10156#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10160#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:09:49,752 INFO L273 TraceCheckUtils]: 14: Hoare triple {10160#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10164#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:09:49,753 INFO L273 TraceCheckUtils]: 15: Hoare triple {10164#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10168#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:09:49,754 INFO L273 TraceCheckUtils]: 16: Hoare triple {10168#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10172#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-19 00:09:49,755 INFO L273 TraceCheckUtils]: 17: Hoare triple {10172#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10176#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-19 00:09:49,756 INFO L273 TraceCheckUtils]: 18: Hoare triple {10176#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10180#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-19 00:09:49,757 INFO L273 TraceCheckUtils]: 19: Hoare triple {10180#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10184#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-19 00:09:49,758 INFO L273 TraceCheckUtils]: 20: Hoare triple {10184#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10188#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-19 00:09:49,759 INFO L273 TraceCheckUtils]: 21: Hoare triple {10188#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10192#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-19 00:09:49,760 INFO L273 TraceCheckUtils]: 22: Hoare triple {10192#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10196#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-19 00:09:49,761 INFO L273 TraceCheckUtils]: 23: Hoare triple {10196#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10200#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-19 00:09:49,762 INFO L273 TraceCheckUtils]: 24: Hoare triple {10200#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10204#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-19 00:09:49,763 INFO L273 TraceCheckUtils]: 25: Hoare triple {10204#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10208#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-19 00:09:49,764 INFO L273 TraceCheckUtils]: 26: Hoare triple {10208#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10212#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-19 00:09:49,764 INFO L273 TraceCheckUtils]: 27: Hoare triple {10212#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10216#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-19 00:09:49,765 INFO L273 TraceCheckUtils]: 28: Hoare triple {10216#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10220#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-19 00:09:49,766 INFO L273 TraceCheckUtils]: 29: Hoare triple {10220#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10224#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-19 00:09:49,767 INFO L273 TraceCheckUtils]: 30: Hoare triple {10224#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10228#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-19 00:09:49,768 INFO L273 TraceCheckUtils]: 31: Hoare triple {10228#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10232#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-19 00:09:49,769 INFO L273 TraceCheckUtils]: 32: Hoare triple {10232#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10236#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-19 00:09:49,770 INFO L273 TraceCheckUtils]: 33: Hoare triple {10236#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10240#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-19 00:09:49,771 INFO L273 TraceCheckUtils]: 34: Hoare triple {10240#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10244#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-19 00:09:49,772 INFO L273 TraceCheckUtils]: 35: Hoare triple {10244#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10248#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-19 00:09:49,773 INFO L273 TraceCheckUtils]: 36: Hoare triple {10248#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10252#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-19 00:09:49,773 INFO L273 TraceCheckUtils]: 37: Hoare triple {10252#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10256#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-19 00:09:49,774 INFO L273 TraceCheckUtils]: 38: Hoare triple {10256#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10260#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-19 00:09:49,775 INFO L273 TraceCheckUtils]: 39: Hoare triple {10260#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10264#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-19 00:09:49,776 INFO L273 TraceCheckUtils]: 40: Hoare triple {10264#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10268#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} is VALID [2018-11-19 00:09:49,777 INFO L273 TraceCheckUtils]: 41: Hoare triple {10268#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10272#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} is VALID [2018-11-19 00:09:49,778 INFO L273 TraceCheckUtils]: 42: Hoare triple {10272#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10276#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} is VALID [2018-11-19 00:09:49,779 INFO L273 TraceCheckUtils]: 43: Hoare triple {10276#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10280#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} is VALID [2018-11-19 00:09:49,779 INFO L273 TraceCheckUtils]: 44: Hoare triple {10280#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10284#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} is VALID [2018-11-19 00:09:49,780 INFO L273 TraceCheckUtils]: 45: Hoare triple {10284#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10288#(and (= main_~main__sum~0 741) (<= 38 main_~main__n~0) (<= main_~main__i~0 39))} is VALID [2018-11-19 00:09:49,782 INFO L273 TraceCheckUtils]: 46: Hoare triple {10288#(and (= main_~main__sum~0 741) (<= 38 main_~main__n~0) (<= main_~main__i~0 39))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {10292#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:09:49,782 INFO L273 TraceCheckUtils]: 47: Hoare triple {10292#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {10111#false} is VALID [2018-11-19 00:09:49,783 INFO L273 TraceCheckUtils]: 48: Hoare triple {10111#false} assume !false; {10111#false} is VALID [2018-11-19 00:09:49,788 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-19 00:09:49,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:09:49,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-11-19 00:09:49,809 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 49 [2018-11-19 00:09:49,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:09:49,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-19 00:09:49,857 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-19 00:09:49,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-19 00:09:49,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-19 00:09:49,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-11-19 00:09:49,858 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 42 states. [2018-11-19 00:09:54,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:09:54,057 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-19 00:09:54,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-19 00:09:54,057 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 49 [2018-11-19 00:09:54,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:09:54,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-19 00:09:54,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2018-11-19 00:09:54,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-19 00:09:54,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2018-11-19 00:09:54,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 54 transitions. [2018-11-19 00:09:54,106 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:09:54,107 INFO L225 Difference]: With dead ends: 54 [2018-11-19 00:09:54,107 INFO L226 Difference]: Without dead ends: 51 [2018-11-19 00:09:54,108 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=85, Invalid=1721, Unknown=0, NotChecked=0, Total=1806 [2018-11-19 00:09:54,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-19 00:09:54,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-19 00:09:54,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:09:54,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 51 states. [2018-11-19 00:09:54,190 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-19 00:09:54,190 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-19 00:09:54,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:09:54,191 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-11-19 00:09:54,192 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-11-19 00:09:54,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:09:54,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:09:54,192 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-19 00:09:54,192 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-19 00:09:54,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:09:54,193 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-11-19 00:09:54,193 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-11-19 00:09:54,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:09:54,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:09:54,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:09:54,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:09:54,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-19 00:09:54,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-11-19 00:09:54,195 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-11-19 00:09:54,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:09:54,195 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-11-19 00:09:54,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-19 00:09:54,195 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-11-19 00:09:54,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-19 00:09:54,196 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:09:54,196 INFO L375 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:09:54,196 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:09:54,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:09:54,196 INFO L82 PathProgramCache]: Analyzing trace with hash 417785030, now seen corresponding path program 34 times [2018-11-19 00:09:54,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:09:54,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:09:54,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:09:54,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:09:54,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:09:54,205 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:09:54,206 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:09:54,206 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-19 00:09:54,224 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-19 00:09:54,665 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-19 00:09:54,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:09:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:09:54,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:09:55,824 INFO L256 TraceCheckUtils]: 0: Hoare triple {10585#true} call ULTIMATE.init(); {10585#true} is VALID [2018-11-19 00:09:55,825 INFO L273 TraceCheckUtils]: 1: Hoare triple {10585#true} ~__return_main~0 := 0;~__return_96~0 := 0; {10585#true} is VALID [2018-11-19 00:09:55,825 INFO L273 TraceCheckUtils]: 2: Hoare triple {10585#true} assume true; {10585#true} is VALID [2018-11-19 00:09:55,825 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10585#true} {10585#true} #48#return; {10585#true} is VALID [2018-11-19 00:09:55,825 INFO L256 TraceCheckUtils]: 4: Hoare triple {10585#true} call #t~ret2 := main(); {10585#true} is VALID [2018-11-19 00:09:55,825 INFO L273 TraceCheckUtils]: 5: Hoare triple {10585#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; {10585#true} is VALID [2018-11-19 00:09:55,825 INFO L273 TraceCheckUtils]: 6: Hoare triple {10585#true} assume !!(1 <= ~main__n~0); {10585#true} is VALID [2018-11-19 00:09:55,826 INFO L273 TraceCheckUtils]: 7: Hoare triple {10585#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {10611#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:09:55,826 INFO L273 TraceCheckUtils]: 8: Hoare triple {10611#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10615#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-19 00:09:55,827 INFO L273 TraceCheckUtils]: 9: Hoare triple {10615#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10619#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:09:55,828 INFO L273 TraceCheckUtils]: 10: Hoare triple {10619#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10623#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:09:55,829 INFO L273 TraceCheckUtils]: 11: Hoare triple {10623#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10627#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:09:55,829 INFO L273 TraceCheckUtils]: 12: Hoare triple {10627#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10631#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:09:55,830 INFO L273 TraceCheckUtils]: 13: Hoare triple {10631#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10635#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:09:55,830 INFO L273 TraceCheckUtils]: 14: Hoare triple {10635#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10639#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:09:55,831 INFO L273 TraceCheckUtils]: 15: Hoare triple {10639#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10643#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:09:55,832 INFO L273 TraceCheckUtils]: 16: Hoare triple {10643#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10647#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-19 00:09:55,833 INFO L273 TraceCheckUtils]: 17: Hoare triple {10647#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10651#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-19 00:09:55,834 INFO L273 TraceCheckUtils]: 18: Hoare triple {10651#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10655#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-19 00:09:55,835 INFO L273 TraceCheckUtils]: 19: Hoare triple {10655#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10659#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-19 00:09:55,835 INFO L273 TraceCheckUtils]: 20: Hoare triple {10659#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10663#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-19 00:09:55,836 INFO L273 TraceCheckUtils]: 21: Hoare triple {10663#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10667#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-19 00:09:55,837 INFO L273 TraceCheckUtils]: 22: Hoare triple {10667#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10671#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-19 00:09:55,838 INFO L273 TraceCheckUtils]: 23: Hoare triple {10671#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10675#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-19 00:09:55,839 INFO L273 TraceCheckUtils]: 24: Hoare triple {10675#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10679#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-19 00:09:55,840 INFO L273 TraceCheckUtils]: 25: Hoare triple {10679#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10683#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-19 00:09:55,841 INFO L273 TraceCheckUtils]: 26: Hoare triple {10683#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10687#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-19 00:09:55,842 INFO L273 TraceCheckUtils]: 27: Hoare triple {10687#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10691#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-19 00:09:55,843 INFO L273 TraceCheckUtils]: 28: Hoare triple {10691#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10695#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-19 00:09:55,844 INFO L273 TraceCheckUtils]: 29: Hoare triple {10695#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10699#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-19 00:09:55,844 INFO L273 TraceCheckUtils]: 30: Hoare triple {10699#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10703#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-19 00:09:55,845 INFO L273 TraceCheckUtils]: 31: Hoare triple {10703#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10707#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-19 00:09:55,846 INFO L273 TraceCheckUtils]: 32: Hoare triple {10707#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10711#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-19 00:09:55,847 INFO L273 TraceCheckUtils]: 33: Hoare triple {10711#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10715#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-19 00:09:55,848 INFO L273 TraceCheckUtils]: 34: Hoare triple {10715#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10719#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-19 00:09:55,849 INFO L273 TraceCheckUtils]: 35: Hoare triple {10719#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10723#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-19 00:09:55,850 INFO L273 TraceCheckUtils]: 36: Hoare triple {10723#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10727#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-19 00:09:55,851 INFO L273 TraceCheckUtils]: 37: Hoare triple {10727#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10731#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-19 00:09:55,852 INFO L273 TraceCheckUtils]: 38: Hoare triple {10731#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10735#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-19 00:09:55,853 INFO L273 TraceCheckUtils]: 39: Hoare triple {10735#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10739#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-19 00:09:55,853 INFO L273 TraceCheckUtils]: 40: Hoare triple {10739#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10743#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} is VALID [2018-11-19 00:09:55,854 INFO L273 TraceCheckUtils]: 41: Hoare triple {10743#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10747#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} is VALID [2018-11-19 00:09:55,855 INFO L273 TraceCheckUtils]: 42: Hoare triple {10747#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10751#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} is VALID [2018-11-19 00:09:55,856 INFO L273 TraceCheckUtils]: 43: Hoare triple {10751#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10755#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} is VALID [2018-11-19 00:09:55,857 INFO L273 TraceCheckUtils]: 44: Hoare triple {10755#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10759#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} is VALID [2018-11-19 00:09:55,858 INFO L273 TraceCheckUtils]: 45: Hoare triple {10759#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10763#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} is VALID [2018-11-19 00:09:55,859 INFO L273 TraceCheckUtils]: 46: Hoare triple {10763#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10767#(and (<= main_~main__i~0 40) (<= 39 main_~main__n~0) (= main_~main__sum~0 780))} is VALID [2018-11-19 00:09:55,860 INFO L273 TraceCheckUtils]: 47: Hoare triple {10767#(and (<= main_~main__i~0 40) (<= 39 main_~main__n~0) (= main_~main__sum~0 780))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {10771#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:09:55,860 INFO L273 TraceCheckUtils]: 48: Hoare triple {10771#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {10586#false} is VALID [2018-11-19 00:09:55,861 INFO L273 TraceCheckUtils]: 49: Hoare triple {10586#false} assume !false; {10586#false} is VALID [2018-11-19 00:09:55,865 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-19 00:09:55,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:09:55,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-11-19 00:09:55,884 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 50 [2018-11-19 00:09:55,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:09:55,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states. [2018-11-19 00:09:55,933 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:09:55,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-19 00:09:55,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-19 00:09:55,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-11-19 00:09:55,935 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 43 states. [2018-11-19 00:10:00,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:10:00,335 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-11-19 00:10:00,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-19 00:10:00,335 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 50 [2018-11-19 00:10:00,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:10:00,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-19 00:10:00,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2018-11-19 00:10:00,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-19 00:10:00,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2018-11-19 00:10:00,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 55 transitions. [2018-11-19 00:10:00,402 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:10:00,403 INFO L225 Difference]: With dead ends: 55 [2018-11-19 00:10:00,403 INFO L226 Difference]: Without dead ends: 52 [2018-11-19 00:10:00,404 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=87, Invalid=1805, Unknown=0, NotChecked=0, Total=1892 [2018-11-19 00:10:00,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-19 00:10:00,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-19 00:10:00,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:10:00,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2018-11-19 00:10:00,503 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-19 00:10:00,503 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-19 00:10:00,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:10:00,504 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-11-19 00:10:00,504 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-11-19 00:10:00,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:10:00,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:10:00,505 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-19 00:10:00,505 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-19 00:10:00,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:10:00,505 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-11-19 00:10:00,505 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-11-19 00:10:00,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:10:00,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:10:00,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:10:00,506 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:10:00,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-19 00:10:00,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-11-19 00:10:00,507 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-11-19 00:10:00,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:10:00,507 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-11-19 00:10:00,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-19 00:10:00,507 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-11-19 00:10:00,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-19 00:10:00,507 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:10:00,508 INFO L375 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:10:00,508 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:10:00,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:10:00,508 INFO L82 PathProgramCache]: Analyzing trace with hash 66371584, now seen corresponding path program 35 times [2018-11-19 00:10:00,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:10:00,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:10:00,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:10:00,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:10:00,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:10:00,516 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:10:00,516 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:10:00,516 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-19 00:10:00,532 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-19 00:10:00,610 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-11-19 00:10:00,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:10:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:10:00,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:10:01,773 INFO L256 TraceCheckUtils]: 0: Hoare triple {11070#true} call ULTIMATE.init(); {11070#true} is VALID [2018-11-19 00:10:01,773 INFO L273 TraceCheckUtils]: 1: Hoare triple {11070#true} ~__return_main~0 := 0;~__return_96~0 := 0; {11070#true} is VALID [2018-11-19 00:10:01,774 INFO L273 TraceCheckUtils]: 2: Hoare triple {11070#true} assume true; {11070#true} is VALID [2018-11-19 00:10:01,774 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11070#true} {11070#true} #48#return; {11070#true} is VALID [2018-11-19 00:10:01,774 INFO L256 TraceCheckUtils]: 4: Hoare triple {11070#true} call #t~ret2 := main(); {11070#true} is VALID [2018-11-19 00:10:01,774 INFO L273 TraceCheckUtils]: 5: Hoare triple {11070#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; {11070#true} is VALID [2018-11-19 00:10:01,774 INFO L273 TraceCheckUtils]: 6: Hoare triple {11070#true} assume !!(1 <= ~main__n~0); {11070#true} is VALID [2018-11-19 00:10:01,775 INFO L273 TraceCheckUtils]: 7: Hoare triple {11070#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {11096#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:10:01,775 INFO L273 TraceCheckUtils]: 8: Hoare triple {11096#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11100#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-19 00:10:01,776 INFO L273 TraceCheckUtils]: 9: Hoare triple {11100#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11104#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:10:01,776 INFO L273 TraceCheckUtils]: 10: Hoare triple {11104#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11108#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:10:01,777 INFO L273 TraceCheckUtils]: 11: Hoare triple {11108#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11112#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:10:01,778 INFO L273 TraceCheckUtils]: 12: Hoare triple {11112#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11116#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:10:01,779 INFO L273 TraceCheckUtils]: 13: Hoare triple {11116#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11120#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:10:01,780 INFO L273 TraceCheckUtils]: 14: Hoare triple {11120#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11124#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:10:01,781 INFO L273 TraceCheckUtils]: 15: Hoare triple {11124#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11128#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:10:01,782 INFO L273 TraceCheckUtils]: 16: Hoare triple {11128#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11132#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-19 00:10:01,782 INFO L273 TraceCheckUtils]: 17: Hoare triple {11132#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11136#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-19 00:10:01,783 INFO L273 TraceCheckUtils]: 18: Hoare triple {11136#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11140#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-19 00:10:01,784 INFO L273 TraceCheckUtils]: 19: Hoare triple {11140#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11144#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-19 00:10:01,785 INFO L273 TraceCheckUtils]: 20: Hoare triple {11144#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11148#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-19 00:10:01,786 INFO L273 TraceCheckUtils]: 21: Hoare triple {11148#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11152#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-19 00:10:01,787 INFO L273 TraceCheckUtils]: 22: Hoare triple {11152#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11156#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-19 00:10:01,788 INFO L273 TraceCheckUtils]: 23: Hoare triple {11156#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11160#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-19 00:10:01,788 INFO L273 TraceCheckUtils]: 24: Hoare triple {11160#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11164#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-19 00:10:01,789 INFO L273 TraceCheckUtils]: 25: Hoare triple {11164#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11168#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-19 00:10:01,790 INFO L273 TraceCheckUtils]: 26: Hoare triple {11168#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11172#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-19 00:10:01,791 INFO L273 TraceCheckUtils]: 27: Hoare triple {11172#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11176#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-19 00:10:01,792 INFO L273 TraceCheckUtils]: 28: Hoare triple {11176#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11180#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-19 00:10:01,793 INFO L273 TraceCheckUtils]: 29: Hoare triple {11180#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11184#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-19 00:10:01,794 INFO L273 TraceCheckUtils]: 30: Hoare triple {11184#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11188#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-19 00:10:01,794 INFO L273 TraceCheckUtils]: 31: Hoare triple {11188#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11192#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-19 00:10:01,795 INFO L273 TraceCheckUtils]: 32: Hoare triple {11192#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11196#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-19 00:10:01,796 INFO L273 TraceCheckUtils]: 33: Hoare triple {11196#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11200#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-19 00:10:01,797 INFO L273 TraceCheckUtils]: 34: Hoare triple {11200#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11204#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-19 00:10:01,798 INFO L273 TraceCheckUtils]: 35: Hoare triple {11204#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11208#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-19 00:10:01,799 INFO L273 TraceCheckUtils]: 36: Hoare triple {11208#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11212#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-19 00:10:01,799 INFO L273 TraceCheckUtils]: 37: Hoare triple {11212#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11216#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-19 00:10:01,800 INFO L273 TraceCheckUtils]: 38: Hoare triple {11216#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11220#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-19 00:10:01,801 INFO L273 TraceCheckUtils]: 39: Hoare triple {11220#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11224#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-19 00:10:01,802 INFO L273 TraceCheckUtils]: 40: Hoare triple {11224#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11228#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} is VALID [2018-11-19 00:10:01,803 INFO L273 TraceCheckUtils]: 41: Hoare triple {11228#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11232#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} is VALID [2018-11-19 00:10:01,803 INFO L273 TraceCheckUtils]: 42: Hoare triple {11232#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11236#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} is VALID [2018-11-19 00:10:01,804 INFO L273 TraceCheckUtils]: 43: Hoare triple {11236#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11240#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} is VALID [2018-11-19 00:10:01,805 INFO L273 TraceCheckUtils]: 44: Hoare triple {11240#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11244#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} is VALID [2018-11-19 00:10:01,806 INFO L273 TraceCheckUtils]: 45: Hoare triple {11244#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11248#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} is VALID [2018-11-19 00:10:01,807 INFO L273 TraceCheckUtils]: 46: Hoare triple {11248#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11252#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} is VALID [2018-11-19 00:10:01,808 INFO L273 TraceCheckUtils]: 47: Hoare triple {11252#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11256#(and (<= 40 main_~main__n~0) (<= main_~main__i~0 41) (= main_~main__sum~0 820))} is VALID [2018-11-19 00:10:01,809 INFO L273 TraceCheckUtils]: 48: Hoare triple {11256#(and (<= 40 main_~main__n~0) (<= main_~main__i~0 41) (= main_~main__sum~0 820))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {11260#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:10:01,810 INFO L273 TraceCheckUtils]: 49: Hoare triple {11260#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {11071#false} is VALID [2018-11-19 00:10:01,810 INFO L273 TraceCheckUtils]: 50: Hoare triple {11071#false} assume !false; {11071#false} is VALID [2018-11-19 00:10:01,814 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:10:01,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:10:01,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-11-19 00:10:01,847 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 51 [2018-11-19 00:10:01,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:10:01,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states. [2018-11-19 00:10:01,896 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:10:01,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-19 00:10:01,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-19 00:10:01,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-11-19 00:10:01,897 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 44 states. [2018-11-19 00:10:06,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:10:06,510 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-11-19 00:10:06,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-19 00:10:06,510 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 51 [2018-11-19 00:10:06,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:10:06,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-19 00:10:06,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2018-11-19 00:10:06,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-19 00:10:06,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2018-11-19 00:10:06,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 56 transitions. [2018-11-19 00:10:06,564 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:10:06,565 INFO L225 Difference]: With dead ends: 56 [2018-11-19 00:10:06,565 INFO L226 Difference]: Without dead ends: 53 [2018-11-19 00:10:06,567 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=89, Invalid=1891, Unknown=0, NotChecked=0, Total=1980 [2018-11-19 00:10:06,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-19 00:10:06,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-11-19 00:10:06,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:10:06,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 53 states. [2018-11-19 00:10:06,654 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2018-11-19 00:10:06,654 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2018-11-19 00:10:06,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:10:06,656 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-11-19 00:10:06,656 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-11-19 00:10:06,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:10:06,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:10:06,656 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2018-11-19 00:10:06,656 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2018-11-19 00:10:06,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:10:06,657 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-11-19 00:10:06,657 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-11-19 00:10:06,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:10:06,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:10:06,657 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:10:06,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:10:06,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-19 00:10:06,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-11-19 00:10:06,658 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-11-19 00:10:06,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:10:06,658 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-11-19 00:10:06,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-19 00:10:06,658 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-11-19 00:10:06,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-19 00:10:06,659 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:10:06,659 INFO L375 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:10:06,659 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:10:06,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:10:06,659 INFO L82 PathProgramCache]: Analyzing trace with hash 2057456646, now seen corresponding path program 36 times [2018-11-19 00:10:06,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:10:06,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:10:06,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:10:06,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:10:06,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:10:06,668 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:10:06,668 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:10:06,668 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-19 00:10:06,679 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-19 00:10:07,128 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-19 00:10:07,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:10:07,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:10:07,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:10:08,351 INFO L256 TraceCheckUtils]: 0: Hoare triple {11565#true} call ULTIMATE.init(); {11565#true} is VALID [2018-11-19 00:10:08,351 INFO L273 TraceCheckUtils]: 1: Hoare triple {11565#true} ~__return_main~0 := 0;~__return_96~0 := 0; {11565#true} is VALID [2018-11-19 00:10:08,351 INFO L273 TraceCheckUtils]: 2: Hoare triple {11565#true} assume true; {11565#true} is VALID [2018-11-19 00:10:08,351 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11565#true} {11565#true} #48#return; {11565#true} is VALID [2018-11-19 00:10:08,351 INFO L256 TraceCheckUtils]: 4: Hoare triple {11565#true} call #t~ret2 := main(); {11565#true} is VALID [2018-11-19 00:10:08,351 INFO L273 TraceCheckUtils]: 5: Hoare triple {11565#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; {11565#true} is VALID [2018-11-19 00:10:08,351 INFO L273 TraceCheckUtils]: 6: Hoare triple {11565#true} assume !!(1 <= ~main__n~0); {11565#true} is VALID [2018-11-19 00:10:08,352 INFO L273 TraceCheckUtils]: 7: Hoare triple {11565#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {11591#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:10:08,353 INFO L273 TraceCheckUtils]: 8: Hoare triple {11591#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11595#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-19 00:10:08,354 INFO L273 TraceCheckUtils]: 9: Hoare triple {11595#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11599#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:10:08,355 INFO L273 TraceCheckUtils]: 10: Hoare triple {11599#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11603#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:10:08,356 INFO L273 TraceCheckUtils]: 11: Hoare triple {11603#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11607#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:10:08,356 INFO L273 TraceCheckUtils]: 12: Hoare triple {11607#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11611#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:10:08,359 INFO L273 TraceCheckUtils]: 13: Hoare triple {11611#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11615#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:10:08,362 INFO L273 TraceCheckUtils]: 14: Hoare triple {11615#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11619#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:10:08,362 INFO L273 TraceCheckUtils]: 15: Hoare triple {11619#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11623#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:10:08,365 INFO L273 TraceCheckUtils]: 16: Hoare triple {11623#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11627#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-19 00:10:08,365 INFO L273 TraceCheckUtils]: 17: Hoare triple {11627#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11631#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-19 00:10:08,368 INFO L273 TraceCheckUtils]: 18: Hoare triple {11631#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11635#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-19 00:10:08,368 INFO L273 TraceCheckUtils]: 19: Hoare triple {11635#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11639#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-19 00:10:08,370 INFO L273 TraceCheckUtils]: 20: Hoare triple {11639#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11643#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-19 00:10:08,370 INFO L273 TraceCheckUtils]: 21: Hoare triple {11643#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11647#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-19 00:10:08,371 INFO L273 TraceCheckUtils]: 22: Hoare triple {11647#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11651#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-19 00:10:08,371 INFO L273 TraceCheckUtils]: 23: Hoare triple {11651#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11655#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-19 00:10:08,373 INFO L273 TraceCheckUtils]: 24: Hoare triple {11655#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11659#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-19 00:10:08,373 INFO L273 TraceCheckUtils]: 25: Hoare triple {11659#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11663#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-19 00:10:08,375 INFO L273 TraceCheckUtils]: 26: Hoare triple {11663#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11667#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-19 00:10:08,375 INFO L273 TraceCheckUtils]: 27: Hoare triple {11667#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11671#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-19 00:10:08,376 INFO L273 TraceCheckUtils]: 28: Hoare triple {11671#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11675#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-19 00:10:08,380 INFO L273 TraceCheckUtils]: 29: Hoare triple {11675#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11679#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-19 00:10:08,380 INFO L273 TraceCheckUtils]: 30: Hoare triple {11679#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11683#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-19 00:10:08,382 INFO L273 TraceCheckUtils]: 31: Hoare triple {11683#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11687#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-19 00:10:08,382 INFO L273 TraceCheckUtils]: 32: Hoare triple {11687#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11691#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-19 00:10:08,384 INFO L273 TraceCheckUtils]: 33: Hoare triple {11691#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11695#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-19 00:10:08,384 INFO L273 TraceCheckUtils]: 34: Hoare triple {11695#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11699#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-19 00:10:08,387 INFO L273 TraceCheckUtils]: 35: Hoare triple {11699#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11703#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-19 00:10:08,388 INFO L273 TraceCheckUtils]: 36: Hoare triple {11703#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11707#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-19 00:10:08,389 INFO L273 TraceCheckUtils]: 37: Hoare triple {11707#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11711#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-19 00:10:08,389 INFO L273 TraceCheckUtils]: 38: Hoare triple {11711#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11715#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-19 00:10:08,391 INFO L273 TraceCheckUtils]: 39: Hoare triple {11715#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11719#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-19 00:10:08,391 INFO L273 TraceCheckUtils]: 40: Hoare triple {11719#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11723#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} is VALID [2018-11-19 00:10:08,393 INFO L273 TraceCheckUtils]: 41: Hoare triple {11723#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11727#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} is VALID [2018-11-19 00:10:08,393 INFO L273 TraceCheckUtils]: 42: Hoare triple {11727#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11731#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} is VALID [2018-11-19 00:10:08,395 INFO L273 TraceCheckUtils]: 43: Hoare triple {11731#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11735#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} is VALID [2018-11-19 00:10:08,396 INFO L273 TraceCheckUtils]: 44: Hoare triple {11735#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11739#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} is VALID [2018-11-19 00:10:08,398 INFO L273 TraceCheckUtils]: 45: Hoare triple {11739#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11743#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} is VALID [2018-11-19 00:10:08,398 INFO L273 TraceCheckUtils]: 46: Hoare triple {11743#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11747#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} is VALID [2018-11-19 00:10:08,401 INFO L273 TraceCheckUtils]: 47: Hoare triple {11747#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11751#(and (= 41 main_~main__i~0) (= main_~main__sum~0 820))} is VALID [2018-11-19 00:10:08,401 INFO L273 TraceCheckUtils]: 48: Hoare triple {11751#(and (= 41 main_~main__i~0) (= main_~main__sum~0 820))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11755#(and (= main_~main__sum~0 861) (<= 41 main_~main__n~0) (<= main_~main__i~0 42))} is VALID [2018-11-19 00:10:08,403 INFO L273 TraceCheckUtils]: 49: Hoare triple {11755#(and (= main_~main__sum~0 861) (<= 41 main_~main__n~0) (<= main_~main__i~0 42))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {11759#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:10:08,403 INFO L273 TraceCheckUtils]: 50: Hoare triple {11759#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {11566#false} is VALID [2018-11-19 00:10:08,403 INFO L273 TraceCheckUtils]: 51: Hoare triple {11566#false} assume !false; {11566#false} is VALID [2018-11-19 00:10:08,407 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:10:08,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:10:08,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-11-19 00:10:08,426 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 52 [2018-11-19 00:10:08,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:10:08,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states. [2018-11-19 00:10:08,499 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:10:08,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-19 00:10:08,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-19 00:10:08,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-11-19 00:10:08,501 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 45 states. [2018-11-19 00:10:13,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:10:13,129 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-19 00:10:13,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-19 00:10:13,129 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 52 [2018-11-19 00:10:13,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:10:13,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-19 00:10:13,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2018-11-19 00:10:13,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-19 00:10:13,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2018-11-19 00:10:13,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 57 transitions. [2018-11-19 00:10:13,183 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:10:13,184 INFO L225 Difference]: With dead ends: 57 [2018-11-19 00:10:13,184 INFO L226 Difference]: Without dead ends: 54 [2018-11-19 00:10:13,186 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=91, Invalid=1979, Unknown=0, NotChecked=0, Total=2070 [2018-11-19 00:10:13,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-19 00:10:13,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-19 00:10:13,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:10:13,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 54 states. [2018-11-19 00:10:13,274 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-19 00:10:13,274 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-19 00:10:13,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:10:13,275 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-19 00:10:13,275 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-19 00:10:13,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:10:13,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:10:13,276 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-19 00:10:13,276 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-19 00:10:13,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:10:13,277 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-19 00:10:13,277 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-19 00:10:13,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:10:13,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:10:13,278 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:10:13,278 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:10:13,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-19 00:10:13,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-11-19 00:10:13,278 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-11-19 00:10:13,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:10:13,278 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-11-19 00:10:13,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-19 00:10:13,279 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-19 00:10:13,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-19 00:10:13,279 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:10:13,279 INFO L375 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:10:13,279 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:10:13,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:10:13,280 INFO L82 PathProgramCache]: Analyzing trace with hash -643415872, now seen corresponding path program 37 times [2018-11-19 00:10:13,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:10:13,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:10:13,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:10:13,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:10:13,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:10:13,288 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:10:13,288 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:10:13,289 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-19 00:10:13,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:10:13,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:10:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:10:13,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:10:14,943 INFO L256 TraceCheckUtils]: 0: Hoare triple {12070#true} call ULTIMATE.init(); {12070#true} is VALID [2018-11-19 00:10:14,943 INFO L273 TraceCheckUtils]: 1: Hoare triple {12070#true} ~__return_main~0 := 0;~__return_96~0 := 0; {12070#true} is VALID [2018-11-19 00:10:14,943 INFO L273 TraceCheckUtils]: 2: Hoare triple {12070#true} assume true; {12070#true} is VALID [2018-11-19 00:10:14,943 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12070#true} {12070#true} #48#return; {12070#true} is VALID [2018-11-19 00:10:14,943 INFO L256 TraceCheckUtils]: 4: Hoare triple {12070#true} call #t~ret2 := main(); {12070#true} is VALID [2018-11-19 00:10:14,943 INFO L273 TraceCheckUtils]: 5: Hoare triple {12070#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; {12070#true} is VALID [2018-11-19 00:10:14,944 INFO L273 TraceCheckUtils]: 6: Hoare triple {12070#true} assume !!(1 <= ~main__n~0); {12070#true} is VALID [2018-11-19 00:10:14,944 INFO L273 TraceCheckUtils]: 7: Hoare triple {12070#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {12096#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:10:14,945 INFO L273 TraceCheckUtils]: 8: Hoare triple {12096#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12100#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-19 00:10:14,946 INFO L273 TraceCheckUtils]: 9: Hoare triple {12100#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12104#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:10:14,946 INFO L273 TraceCheckUtils]: 10: Hoare triple {12104#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12108#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:10:14,947 INFO L273 TraceCheckUtils]: 11: Hoare triple {12108#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12112#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:10:14,947 INFO L273 TraceCheckUtils]: 12: Hoare triple {12112#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12116#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:10:14,948 INFO L273 TraceCheckUtils]: 13: Hoare triple {12116#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12120#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:10:14,949 INFO L273 TraceCheckUtils]: 14: Hoare triple {12120#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12124#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:10:14,950 INFO L273 TraceCheckUtils]: 15: Hoare triple {12124#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12128#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:10:14,951 INFO L273 TraceCheckUtils]: 16: Hoare triple {12128#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12132#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-19 00:10:14,952 INFO L273 TraceCheckUtils]: 17: Hoare triple {12132#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12136#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-19 00:10:14,953 INFO L273 TraceCheckUtils]: 18: Hoare triple {12136#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12140#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-19 00:10:14,953 INFO L273 TraceCheckUtils]: 19: Hoare triple {12140#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12144#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-19 00:10:14,954 INFO L273 TraceCheckUtils]: 20: Hoare triple {12144#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12148#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-19 00:10:14,955 INFO L273 TraceCheckUtils]: 21: Hoare triple {12148#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12152#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-19 00:10:14,956 INFO L273 TraceCheckUtils]: 22: Hoare triple {12152#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12156#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-19 00:10:14,957 INFO L273 TraceCheckUtils]: 23: Hoare triple {12156#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12160#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-19 00:10:14,958 INFO L273 TraceCheckUtils]: 24: Hoare triple {12160#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12164#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-19 00:10:14,959 INFO L273 TraceCheckUtils]: 25: Hoare triple {12164#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12168#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-19 00:10:14,960 INFO L273 TraceCheckUtils]: 26: Hoare triple {12168#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12172#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-19 00:10:14,960 INFO L273 TraceCheckUtils]: 27: Hoare triple {12172#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12176#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-19 00:10:14,961 INFO L273 TraceCheckUtils]: 28: Hoare triple {12176#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12180#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-19 00:10:14,962 INFO L273 TraceCheckUtils]: 29: Hoare triple {12180#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12184#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-19 00:10:14,963 INFO L273 TraceCheckUtils]: 30: Hoare triple {12184#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12188#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-19 00:10:14,964 INFO L273 TraceCheckUtils]: 31: Hoare triple {12188#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12192#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-19 00:10:14,965 INFO L273 TraceCheckUtils]: 32: Hoare triple {12192#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12196#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-19 00:10:14,966 INFO L273 TraceCheckUtils]: 33: Hoare triple {12196#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12200#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-19 00:10:14,966 INFO L273 TraceCheckUtils]: 34: Hoare triple {12200#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12204#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-19 00:10:14,967 INFO L273 TraceCheckUtils]: 35: Hoare triple {12204#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12208#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-19 00:10:14,968 INFO L273 TraceCheckUtils]: 36: Hoare triple {12208#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12212#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-19 00:10:14,969 INFO L273 TraceCheckUtils]: 37: Hoare triple {12212#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12216#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-19 00:10:14,970 INFO L273 TraceCheckUtils]: 38: Hoare triple {12216#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12220#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-19 00:10:14,971 INFO L273 TraceCheckUtils]: 39: Hoare triple {12220#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12224#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-19 00:10:14,971 INFO L273 TraceCheckUtils]: 40: Hoare triple {12224#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12228#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} is VALID [2018-11-19 00:10:14,972 INFO L273 TraceCheckUtils]: 41: Hoare triple {12228#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12232#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} is VALID [2018-11-19 00:10:14,973 INFO L273 TraceCheckUtils]: 42: Hoare triple {12232#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12236#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} is VALID [2018-11-19 00:10:14,974 INFO L273 TraceCheckUtils]: 43: Hoare triple {12236#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12240#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} is VALID [2018-11-19 00:10:14,975 INFO L273 TraceCheckUtils]: 44: Hoare triple {12240#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12244#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} is VALID [2018-11-19 00:10:14,975 INFO L273 TraceCheckUtils]: 45: Hoare triple {12244#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12248#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} is VALID [2018-11-19 00:10:14,976 INFO L273 TraceCheckUtils]: 46: Hoare triple {12248#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12252#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} is VALID [2018-11-19 00:10:14,977 INFO L273 TraceCheckUtils]: 47: Hoare triple {12252#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12256#(and (= 41 main_~main__i~0) (= main_~main__sum~0 820))} is VALID [2018-11-19 00:10:14,978 INFO L273 TraceCheckUtils]: 48: Hoare triple {12256#(and (= 41 main_~main__i~0) (= main_~main__sum~0 820))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12260#(and (= main_~main__sum~0 861) (= 42 main_~main__i~0))} is VALID [2018-11-19 00:10:14,979 INFO L273 TraceCheckUtils]: 49: Hoare triple {12260#(and (= main_~main__sum~0 861) (= 42 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12264#(and (<= main_~main__i~0 43) (<= 42 main_~main__n~0) (= main_~main__sum~0 903))} is VALID [2018-11-19 00:10:14,980 INFO L273 TraceCheckUtils]: 50: Hoare triple {12264#(and (<= main_~main__i~0 43) (<= 42 main_~main__n~0) (= main_~main__sum~0 903))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {12268#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:10:14,981 INFO L273 TraceCheckUtils]: 51: Hoare triple {12268#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {12071#false} is VALID [2018-11-19 00:10:14,981 INFO L273 TraceCheckUtils]: 52: Hoare triple {12071#false} assume !false; {12071#false} is VALID [2018-11-19 00:10:14,986 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:10:15,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:10:15,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-11-19 00:10:15,005 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 53 [2018-11-19 00:10:15,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:10:15,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states. [2018-11-19 00:10:15,058 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:10:15,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-19 00:10:15,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-19 00:10:15,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-11-19 00:10:15,059 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 46 states. [2018-11-19 00:10:20,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:10:20,094 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-11-19 00:10:20,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-19 00:10:20,094 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 53 [2018-11-19 00:10:20,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:10:20,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-19 00:10:20,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2018-11-19 00:10:20,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-19 00:10:20,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2018-11-19 00:10:20,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 58 transitions. [2018-11-19 00:10:20,149 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:10:20,150 INFO L225 Difference]: With dead ends: 58 [2018-11-19 00:10:20,150 INFO L226 Difference]: Without dead ends: 55 [2018-11-19 00:10:20,151 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=93, Invalid=2069, Unknown=0, NotChecked=0, Total=2162 [2018-11-19 00:10:20,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-19 00:10:20,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-19 00:10:20,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:10:20,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 55 states. [2018-11-19 00:10:20,241 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2018-11-19 00:10:20,241 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2018-11-19 00:10:20,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:10:20,242 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-11-19 00:10:20,242 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-11-19 00:10:20,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:10:20,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:10:20,243 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2018-11-19 00:10:20,243 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2018-11-19 00:10:20,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:10:20,244 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-11-19 00:10:20,244 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-11-19 00:10:20,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:10:20,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:10:20,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:10:20,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:10:20,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-19 00:10:20,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-11-19 00:10:20,245 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-11-19 00:10:20,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:10:20,245 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-11-19 00:10:20,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-19 00:10:20,245 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-11-19 00:10:20,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-19 00:10:20,246 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:10:20,246 INFO L375 BasicCegarLoop]: trace histogram [38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:10:20,246 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:10:20,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:10:20,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1528881990, now seen corresponding path program 38 times [2018-11-19 00:10:20,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:10:20,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:10:20,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:10:20,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:10:20,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:10:20,253 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:10:20,253 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:10:20,253 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-19 00:10:20,265 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-19 00:10:20,340 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-19 00:10:20,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:10:20,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:10:20,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:10:21,724 INFO L256 TraceCheckUtils]: 0: Hoare triple {12585#true} call ULTIMATE.init(); {12585#true} is VALID [2018-11-19 00:10:21,724 INFO L273 TraceCheckUtils]: 1: Hoare triple {12585#true} ~__return_main~0 := 0;~__return_96~0 := 0; {12585#true} is VALID [2018-11-19 00:10:21,724 INFO L273 TraceCheckUtils]: 2: Hoare triple {12585#true} assume true; {12585#true} is VALID [2018-11-19 00:10:21,724 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12585#true} {12585#true} #48#return; {12585#true} is VALID [2018-11-19 00:10:21,725 INFO L256 TraceCheckUtils]: 4: Hoare triple {12585#true} call #t~ret2 := main(); {12585#true} is VALID [2018-11-19 00:10:21,725 INFO L273 TraceCheckUtils]: 5: Hoare triple {12585#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; {12585#true} is VALID [2018-11-19 00:10:21,725 INFO L273 TraceCheckUtils]: 6: Hoare triple {12585#true} assume !!(1 <= ~main__n~0); {12585#true} is VALID [2018-11-19 00:10:21,726 INFO L273 TraceCheckUtils]: 7: Hoare triple {12585#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {12611#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:10:21,726 INFO L273 TraceCheckUtils]: 8: Hoare triple {12611#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12615#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-19 00:10:21,727 INFO L273 TraceCheckUtils]: 9: Hoare triple {12615#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12619#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:10:21,727 INFO L273 TraceCheckUtils]: 10: Hoare triple {12619#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12623#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:10:21,728 INFO L273 TraceCheckUtils]: 11: Hoare triple {12623#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12627#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:10:21,729 INFO L273 TraceCheckUtils]: 12: Hoare triple {12627#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12631#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:10:21,729 INFO L273 TraceCheckUtils]: 13: Hoare triple {12631#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12635#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:10:21,730 INFO L273 TraceCheckUtils]: 14: Hoare triple {12635#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12639#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:10:21,731 INFO L273 TraceCheckUtils]: 15: Hoare triple {12639#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12643#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:10:21,732 INFO L273 TraceCheckUtils]: 16: Hoare triple {12643#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12647#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-19 00:10:21,733 INFO L273 TraceCheckUtils]: 17: Hoare triple {12647#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12651#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-19 00:10:21,734 INFO L273 TraceCheckUtils]: 18: Hoare triple {12651#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12655#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-19 00:10:21,735 INFO L273 TraceCheckUtils]: 19: Hoare triple {12655#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12659#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-19 00:10:21,736 INFO L273 TraceCheckUtils]: 20: Hoare triple {12659#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12663#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-19 00:10:21,736 INFO L273 TraceCheckUtils]: 21: Hoare triple {12663#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12667#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-19 00:10:21,737 INFO L273 TraceCheckUtils]: 22: Hoare triple {12667#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12671#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-19 00:10:21,738 INFO L273 TraceCheckUtils]: 23: Hoare triple {12671#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12675#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-19 00:10:21,739 INFO L273 TraceCheckUtils]: 24: Hoare triple {12675#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12679#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-19 00:10:21,740 INFO L273 TraceCheckUtils]: 25: Hoare triple {12679#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12683#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-19 00:10:21,741 INFO L273 TraceCheckUtils]: 26: Hoare triple {12683#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12687#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-19 00:10:21,742 INFO L273 TraceCheckUtils]: 27: Hoare triple {12687#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12691#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-19 00:10:21,742 INFO L273 TraceCheckUtils]: 28: Hoare triple {12691#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12695#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-19 00:10:21,743 INFO L273 TraceCheckUtils]: 29: Hoare triple {12695#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12699#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-19 00:10:21,744 INFO L273 TraceCheckUtils]: 30: Hoare triple {12699#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12703#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-19 00:10:21,764 INFO L273 TraceCheckUtils]: 31: Hoare triple {12703#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12707#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-19 00:10:21,765 INFO L273 TraceCheckUtils]: 32: Hoare triple {12707#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12711#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-19 00:10:21,766 INFO L273 TraceCheckUtils]: 33: Hoare triple {12711#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12715#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-19 00:10:21,766 INFO L273 TraceCheckUtils]: 34: Hoare triple {12715#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12719#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-19 00:10:21,767 INFO L273 TraceCheckUtils]: 35: Hoare triple {12719#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12723#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-19 00:10:21,767 INFO L273 TraceCheckUtils]: 36: Hoare triple {12723#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12727#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-19 00:10:21,768 INFO L273 TraceCheckUtils]: 37: Hoare triple {12727#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12731#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-19 00:10:21,769 INFO L273 TraceCheckUtils]: 38: Hoare triple {12731#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12735#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-19 00:10:21,770 INFO L273 TraceCheckUtils]: 39: Hoare triple {12735#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12739#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-19 00:10:21,770 INFO L273 TraceCheckUtils]: 40: Hoare triple {12739#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12743#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} is VALID [2018-11-19 00:10:21,771 INFO L273 TraceCheckUtils]: 41: Hoare triple {12743#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12747#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} is VALID [2018-11-19 00:10:21,772 INFO L273 TraceCheckUtils]: 42: Hoare triple {12747#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12751#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} is VALID [2018-11-19 00:10:21,773 INFO L273 TraceCheckUtils]: 43: Hoare triple {12751#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12755#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} is VALID [2018-11-19 00:10:21,774 INFO L273 TraceCheckUtils]: 44: Hoare triple {12755#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12759#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} is VALID [2018-11-19 00:10:21,775 INFO L273 TraceCheckUtils]: 45: Hoare triple {12759#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12763#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} is VALID [2018-11-19 00:10:21,775 INFO L273 TraceCheckUtils]: 46: Hoare triple {12763#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12767#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} is VALID [2018-11-19 00:10:21,776 INFO L273 TraceCheckUtils]: 47: Hoare triple {12767#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12771#(and (= 41 main_~main__i~0) (= main_~main__sum~0 820))} is VALID [2018-11-19 00:10:21,777 INFO L273 TraceCheckUtils]: 48: Hoare triple {12771#(and (= 41 main_~main__i~0) (= main_~main__sum~0 820))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12775#(and (= main_~main__sum~0 861) (= 42 main_~main__i~0))} is VALID [2018-11-19 00:10:21,778 INFO L273 TraceCheckUtils]: 49: Hoare triple {12775#(and (= main_~main__sum~0 861) (= 42 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12779#(and (= 43 main_~main__i~0) (= main_~main__sum~0 903))} is VALID [2018-11-19 00:10:21,779 INFO L273 TraceCheckUtils]: 50: Hoare triple {12779#(and (= 43 main_~main__i~0) (= main_~main__sum~0 903))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12783#(and (<= 43 main_~main__n~0) (= main_~main__sum~0 946) (<= main_~main__i~0 44))} is VALID [2018-11-19 00:10:21,780 INFO L273 TraceCheckUtils]: 51: Hoare triple {12783#(and (<= 43 main_~main__n~0) (= main_~main__sum~0 946) (<= main_~main__i~0 44))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {12787#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:10:21,781 INFO L273 TraceCheckUtils]: 52: Hoare triple {12787#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {12586#false} is VALID [2018-11-19 00:10:21,781 INFO L273 TraceCheckUtils]: 53: Hoare triple {12586#false} assume !false; {12586#false} is VALID [2018-11-19 00:10:21,786 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:10:21,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:10:21,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-11-19 00:10:21,805 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 54 [2018-11-19 00:10:21,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:10:21,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states. [2018-11-19 00:10:21,863 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:10:21,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-19 00:10:21,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-19 00:10:21,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-11-19 00:10:21,865 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 47 states. [2018-11-19 00:10:27,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:10:27,258 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-11-19 00:10:27,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-19 00:10:27,258 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 54 [2018-11-19 00:10:27,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:10:27,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-19 00:10:27,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2018-11-19 00:10:27,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-19 00:10:27,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2018-11-19 00:10:27,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 59 transitions. [2018-11-19 00:10:27,319 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:10:27,320 INFO L225 Difference]: With dead ends: 59 [2018-11-19 00:10:27,320 INFO L226 Difference]: Without dead ends: 56 [2018-11-19 00:10:27,320 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=95, Invalid=2161, Unknown=0, NotChecked=0, Total=2256 [2018-11-19 00:10:27,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-19 00:10:27,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-19 00:10:27,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:10:27,422 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 56 states. [2018-11-19 00:10:27,422 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-19 00:10:27,423 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-19 00:10:27,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:10:27,424 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-11-19 00:10:27,424 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-11-19 00:10:27,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:10:27,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:10:27,425 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-19 00:10:27,425 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-19 00:10:27,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:10:27,426 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-11-19 00:10:27,426 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-11-19 00:10:27,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:10:27,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:10:27,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:10:27,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:10:27,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-19 00:10:27,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-11-19 00:10:27,427 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-11-19 00:10:27,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:10:27,428 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-11-19 00:10:27,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-19 00:10:27,428 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-11-19 00:10:27,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-19 00:10:27,428 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:10:27,428 INFO L375 BasicCegarLoop]: trace histogram [39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:10:27,429 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:10:27,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:10:27,429 INFO L82 PathProgramCache]: Analyzing trace with hash 150638976, now seen corresponding path program 39 times [2018-11-19 00:10:27,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:10:27,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:10:27,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:10:27,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:10:27,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:10:27,438 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:10:27,438 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:10:27,438 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-19 00:10:27,449 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-19 00:10:29,241 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-11-19 00:10:29,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:10:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:10:29,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:10:30,648 INFO L256 TraceCheckUtils]: 0: Hoare triple {13110#true} call ULTIMATE.init(); {13110#true} is VALID [2018-11-19 00:10:30,648 INFO L273 TraceCheckUtils]: 1: Hoare triple {13110#true} ~__return_main~0 := 0;~__return_96~0 := 0; {13110#true} is VALID [2018-11-19 00:10:30,648 INFO L273 TraceCheckUtils]: 2: Hoare triple {13110#true} assume true; {13110#true} is VALID [2018-11-19 00:10:30,648 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13110#true} {13110#true} #48#return; {13110#true} is VALID [2018-11-19 00:10:30,649 INFO L256 TraceCheckUtils]: 4: Hoare triple {13110#true} call #t~ret2 := main(); {13110#true} is VALID [2018-11-19 00:10:30,649 INFO L273 TraceCheckUtils]: 5: Hoare triple {13110#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; {13110#true} is VALID [2018-11-19 00:10:30,649 INFO L273 TraceCheckUtils]: 6: Hoare triple {13110#true} assume !!(1 <= ~main__n~0); {13110#true} is VALID [2018-11-19 00:10:30,650 INFO L273 TraceCheckUtils]: 7: Hoare triple {13110#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {13136#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:10:30,650 INFO L273 TraceCheckUtils]: 8: Hoare triple {13136#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13140#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-19 00:10:30,651 INFO L273 TraceCheckUtils]: 9: Hoare triple {13140#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13144#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:10:30,651 INFO L273 TraceCheckUtils]: 10: Hoare triple {13144#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13148#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:10:30,652 INFO L273 TraceCheckUtils]: 11: Hoare triple {13148#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13152#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:10:30,652 INFO L273 TraceCheckUtils]: 12: Hoare triple {13152#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13156#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:10:30,653 INFO L273 TraceCheckUtils]: 13: Hoare triple {13156#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13160#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:10:30,654 INFO L273 TraceCheckUtils]: 14: Hoare triple {13160#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13164#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:10:30,655 INFO L273 TraceCheckUtils]: 15: Hoare triple {13164#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13168#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:10:30,656 INFO L273 TraceCheckUtils]: 16: Hoare triple {13168#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13172#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-19 00:10:30,657 INFO L273 TraceCheckUtils]: 17: Hoare triple {13172#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13176#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-19 00:10:30,658 INFO L273 TraceCheckUtils]: 18: Hoare triple {13176#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13180#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-19 00:10:30,659 INFO L273 TraceCheckUtils]: 19: Hoare triple {13180#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13184#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-19 00:10:30,660 INFO L273 TraceCheckUtils]: 20: Hoare triple {13184#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13188#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-19 00:10:30,661 INFO L273 TraceCheckUtils]: 21: Hoare triple {13188#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13192#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-19 00:10:30,661 INFO L273 TraceCheckUtils]: 22: Hoare triple {13192#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13196#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-19 00:10:30,662 INFO L273 TraceCheckUtils]: 23: Hoare triple {13196#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13200#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-19 00:10:30,663 INFO L273 TraceCheckUtils]: 24: Hoare triple {13200#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13204#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-19 00:10:30,664 INFO L273 TraceCheckUtils]: 25: Hoare triple {13204#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13208#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-19 00:10:30,665 INFO L273 TraceCheckUtils]: 26: Hoare triple {13208#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13212#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-19 00:10:30,666 INFO L273 TraceCheckUtils]: 27: Hoare triple {13212#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13216#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-19 00:10:30,667 INFO L273 TraceCheckUtils]: 28: Hoare triple {13216#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13220#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-19 00:10:30,668 INFO L273 TraceCheckUtils]: 29: Hoare triple {13220#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13224#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-19 00:10:30,669 INFO L273 TraceCheckUtils]: 30: Hoare triple {13224#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13228#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-19 00:10:30,670 INFO L273 TraceCheckUtils]: 31: Hoare triple {13228#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13232#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-19 00:10:30,671 INFO L273 TraceCheckUtils]: 32: Hoare triple {13232#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13236#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-19 00:10:30,672 INFO L273 TraceCheckUtils]: 33: Hoare triple {13236#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13240#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-19 00:10:30,672 INFO L273 TraceCheckUtils]: 34: Hoare triple {13240#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13244#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-19 00:10:30,673 INFO L273 TraceCheckUtils]: 35: Hoare triple {13244#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13248#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-19 00:10:30,674 INFO L273 TraceCheckUtils]: 36: Hoare triple {13248#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13252#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-19 00:10:30,675 INFO L273 TraceCheckUtils]: 37: Hoare triple {13252#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13256#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-19 00:10:30,676 INFO L273 TraceCheckUtils]: 38: Hoare triple {13256#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13260#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-19 00:10:30,677 INFO L273 TraceCheckUtils]: 39: Hoare triple {13260#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13264#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-19 00:10:30,678 INFO L273 TraceCheckUtils]: 40: Hoare triple {13264#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13268#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} is VALID [2018-11-19 00:10:30,679 INFO L273 TraceCheckUtils]: 41: Hoare triple {13268#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13272#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} is VALID [2018-11-19 00:10:30,679 INFO L273 TraceCheckUtils]: 42: Hoare triple {13272#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13276#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} is VALID [2018-11-19 00:10:30,681 INFO L273 TraceCheckUtils]: 43: Hoare triple {13276#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13280#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} is VALID [2018-11-19 00:10:30,681 INFO L273 TraceCheckUtils]: 44: Hoare triple {13280#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13284#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} is VALID [2018-11-19 00:10:30,682 INFO L273 TraceCheckUtils]: 45: Hoare triple {13284#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13288#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} is VALID [2018-11-19 00:10:30,683 INFO L273 TraceCheckUtils]: 46: Hoare triple {13288#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13292#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} is VALID [2018-11-19 00:10:30,684 INFO L273 TraceCheckUtils]: 47: Hoare triple {13292#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13296#(and (= 41 main_~main__i~0) (= main_~main__sum~0 820))} is VALID [2018-11-19 00:10:30,685 INFO L273 TraceCheckUtils]: 48: Hoare triple {13296#(and (= 41 main_~main__i~0) (= main_~main__sum~0 820))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13300#(and (= main_~main__sum~0 861) (= 42 main_~main__i~0))} is VALID [2018-11-19 00:10:30,686 INFO L273 TraceCheckUtils]: 49: Hoare triple {13300#(and (= main_~main__sum~0 861) (= 42 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13304#(and (= 43 main_~main__i~0) (= main_~main__sum~0 903))} is VALID [2018-11-19 00:10:30,687 INFO L273 TraceCheckUtils]: 50: Hoare triple {13304#(and (= 43 main_~main__i~0) (= main_~main__sum~0 903))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13308#(and (= main_~main__sum~0 946) (= 44 main_~main__i~0))} is VALID [2018-11-19 00:10:30,688 INFO L273 TraceCheckUtils]: 51: Hoare triple {13308#(and (= main_~main__sum~0 946) (= 44 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13312#(and (<= 44 main_~main__n~0) (<= main_~main__i~0 45) (= main_~main__sum~0 990))} is VALID [2018-11-19 00:10:30,689 INFO L273 TraceCheckUtils]: 52: Hoare triple {13312#(and (<= 44 main_~main__n~0) (<= main_~main__i~0 45) (= main_~main__sum~0 990))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {13316#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:10:30,690 INFO L273 TraceCheckUtils]: 53: Hoare triple {13316#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {13111#false} is VALID [2018-11-19 00:10:30,690 INFO L273 TraceCheckUtils]: 54: Hoare triple {13111#false} assume !false; {13111#false} is VALID [2018-11-19 00:10:30,696 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:10:30,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:10:30,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-11-19 00:10:30,718 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 55 [2018-11-19 00:10:30,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:10:30,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-19 00:10:30,791 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:10:30,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-19 00:10:30,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-19 00:10:30,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-11-19 00:10:30,792 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 48 states. [2018-11-19 00:10:36,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:10:36,557 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-11-19 00:10:36,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-19 00:10:36,558 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 55 [2018-11-19 00:10:36,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:10:36,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-19 00:10:36,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2018-11-19 00:10:36,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-19 00:10:36,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2018-11-19 00:10:36,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 60 transitions. [2018-11-19 00:10:36,618 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:10:36,619 INFO L225 Difference]: With dead ends: 60 [2018-11-19 00:10:36,619 INFO L226 Difference]: Without dead ends: 57 [2018-11-19 00:10:36,620 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=97, Invalid=2255, Unknown=0, NotChecked=0, Total=2352 [2018-11-19 00:10:36,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-19 00:10:36,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-19 00:10:36,721 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:10:36,721 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 57 states. [2018-11-19 00:10:36,721 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-19 00:10:36,721 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-19 00:10:36,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:10:36,722 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-19 00:10:36,722 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-19 00:10:36,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:10:36,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:10:36,722 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-19 00:10:36,722 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-19 00:10:36,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:10:36,723 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-19 00:10:36,723 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-19 00:10:36,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:10:36,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:10:36,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:10:36,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:10:36,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-19 00:10:36,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-11-19 00:10:36,725 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-11-19 00:10:36,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:10:36,725 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-11-19 00:10:36,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-19 00:10:36,725 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-19 00:10:36,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-19 00:10:36,725 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:10:36,725 INFO L375 BasicCegarLoop]: trace histogram [40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:10:36,726 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:10:36,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:10:36,726 INFO L82 PathProgramCache]: Analyzing trace with hash 374778502, now seen corresponding path program 40 times [2018-11-19 00:10:36,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:10:36,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:10:36,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:10:36,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:10:36,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:10:36,734 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:10:36,734 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:10:36,734 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-19 00:10:36,750 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-19 00:10:37,191 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-19 00:10:37,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:10:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:10:37,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:10:38,713 INFO L256 TraceCheckUtils]: 0: Hoare triple {13645#true} call ULTIMATE.init(); {13645#true} is VALID [2018-11-19 00:10:38,714 INFO L273 TraceCheckUtils]: 1: Hoare triple {13645#true} ~__return_main~0 := 0;~__return_96~0 := 0; {13645#true} is VALID [2018-11-19 00:10:38,714 INFO L273 TraceCheckUtils]: 2: Hoare triple {13645#true} assume true; {13645#true} is VALID [2018-11-19 00:10:38,714 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13645#true} {13645#true} #48#return; {13645#true} is VALID [2018-11-19 00:10:38,714 INFO L256 TraceCheckUtils]: 4: Hoare triple {13645#true} call #t~ret2 := main(); {13645#true} is VALID [2018-11-19 00:10:38,714 INFO L273 TraceCheckUtils]: 5: Hoare triple {13645#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; {13645#true} is VALID [2018-11-19 00:10:38,714 INFO L273 TraceCheckUtils]: 6: Hoare triple {13645#true} assume !!(1 <= ~main__n~0); {13645#true} is VALID [2018-11-19 00:10:38,715 INFO L273 TraceCheckUtils]: 7: Hoare triple {13645#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {13671#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:10:38,716 INFO L273 TraceCheckUtils]: 8: Hoare triple {13671#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13675#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-19 00:10:38,717 INFO L273 TraceCheckUtils]: 9: Hoare triple {13675#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13679#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:10:38,718 INFO L273 TraceCheckUtils]: 10: Hoare triple {13679#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13683#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:10:38,718 INFO L273 TraceCheckUtils]: 11: Hoare triple {13683#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13687#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:10:38,719 INFO L273 TraceCheckUtils]: 12: Hoare triple {13687#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13691#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:10:38,719 INFO L273 TraceCheckUtils]: 13: Hoare triple {13691#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13695#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:10:38,720 INFO L273 TraceCheckUtils]: 14: Hoare triple {13695#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13699#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:10:38,720 INFO L273 TraceCheckUtils]: 15: Hoare triple {13699#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13703#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:10:38,721 INFO L273 TraceCheckUtils]: 16: Hoare triple {13703#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13707#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-19 00:10:38,722 INFO L273 TraceCheckUtils]: 17: Hoare triple {13707#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13711#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-19 00:10:38,723 INFO L273 TraceCheckUtils]: 18: Hoare triple {13711#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13715#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-19 00:10:38,724 INFO L273 TraceCheckUtils]: 19: Hoare triple {13715#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13719#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-19 00:10:38,725 INFO L273 TraceCheckUtils]: 20: Hoare triple {13719#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13723#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-19 00:10:38,726 INFO L273 TraceCheckUtils]: 21: Hoare triple {13723#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13727#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-19 00:10:38,727 INFO L273 TraceCheckUtils]: 22: Hoare triple {13727#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13731#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-19 00:10:38,728 INFO L273 TraceCheckUtils]: 23: Hoare triple {13731#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13735#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-19 00:10:38,729 INFO L273 TraceCheckUtils]: 24: Hoare triple {13735#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13739#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-19 00:10:38,730 INFO L273 TraceCheckUtils]: 25: Hoare triple {13739#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13743#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-19 00:10:38,731 INFO L273 TraceCheckUtils]: 26: Hoare triple {13743#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13747#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-19 00:10:38,731 INFO L273 TraceCheckUtils]: 27: Hoare triple {13747#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13751#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-19 00:10:38,732 INFO L273 TraceCheckUtils]: 28: Hoare triple {13751#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13755#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-19 00:10:38,733 INFO L273 TraceCheckUtils]: 29: Hoare triple {13755#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13759#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-19 00:10:38,734 INFO L273 TraceCheckUtils]: 30: Hoare triple {13759#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13763#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-19 00:10:38,735 INFO L273 TraceCheckUtils]: 31: Hoare triple {13763#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13767#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-19 00:10:38,736 INFO L273 TraceCheckUtils]: 32: Hoare triple {13767#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13771#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-19 00:10:38,737 INFO L273 TraceCheckUtils]: 33: Hoare triple {13771#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13775#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-19 00:10:38,738 INFO L273 TraceCheckUtils]: 34: Hoare triple {13775#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13779#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-19 00:10:38,739 INFO L273 TraceCheckUtils]: 35: Hoare triple {13779#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13783#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-19 00:10:38,740 INFO L273 TraceCheckUtils]: 36: Hoare triple {13783#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13787#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-19 00:10:38,740 INFO L273 TraceCheckUtils]: 37: Hoare triple {13787#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13791#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-19 00:10:38,741 INFO L273 TraceCheckUtils]: 38: Hoare triple {13791#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13795#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-19 00:10:38,742 INFO L273 TraceCheckUtils]: 39: Hoare triple {13795#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13799#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-19 00:10:38,743 INFO L273 TraceCheckUtils]: 40: Hoare triple {13799#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13803#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} is VALID [2018-11-19 00:10:38,744 INFO L273 TraceCheckUtils]: 41: Hoare triple {13803#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13807#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} is VALID [2018-11-19 00:10:38,745 INFO L273 TraceCheckUtils]: 42: Hoare triple {13807#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13811#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} is VALID [2018-11-19 00:10:38,746 INFO L273 TraceCheckUtils]: 43: Hoare triple {13811#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13815#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} is VALID [2018-11-19 00:10:38,746 INFO L273 TraceCheckUtils]: 44: Hoare triple {13815#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13819#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} is VALID [2018-11-19 00:10:38,747 INFO L273 TraceCheckUtils]: 45: Hoare triple {13819#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13823#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} is VALID [2018-11-19 00:10:38,748 INFO L273 TraceCheckUtils]: 46: Hoare triple {13823#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13827#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} is VALID [2018-11-19 00:10:38,749 INFO L273 TraceCheckUtils]: 47: Hoare triple {13827#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13831#(and (= 41 main_~main__i~0) (= main_~main__sum~0 820))} is VALID [2018-11-19 00:10:38,750 INFO L273 TraceCheckUtils]: 48: Hoare triple {13831#(and (= 41 main_~main__i~0) (= main_~main__sum~0 820))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13835#(and (= main_~main__sum~0 861) (= 42 main_~main__i~0))} is VALID [2018-11-19 00:10:38,751 INFO L273 TraceCheckUtils]: 49: Hoare triple {13835#(and (= main_~main__sum~0 861) (= 42 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13839#(and (= 43 main_~main__i~0) (= main_~main__sum~0 903))} is VALID [2018-11-19 00:10:38,752 INFO L273 TraceCheckUtils]: 50: Hoare triple {13839#(and (= 43 main_~main__i~0) (= main_~main__sum~0 903))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13843#(and (= main_~main__sum~0 946) (= 44 main_~main__i~0))} is VALID [2018-11-19 00:10:38,753 INFO L273 TraceCheckUtils]: 51: Hoare triple {13843#(and (= main_~main__sum~0 946) (= 44 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13847#(and (= 45 main_~main__i~0) (= main_~main__sum~0 990))} is VALID [2018-11-19 00:10:38,754 INFO L273 TraceCheckUtils]: 52: Hoare triple {13847#(and (= 45 main_~main__i~0) (= main_~main__sum~0 990))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13851#(and (<= main_~main__i~0 46) (= main_~main__sum~0 1035) (<= 45 main_~main__n~0))} is VALID [2018-11-19 00:10:38,755 INFO L273 TraceCheckUtils]: 53: Hoare triple {13851#(and (<= main_~main__i~0 46) (= main_~main__sum~0 1035) (<= 45 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {13855#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:10:38,756 INFO L273 TraceCheckUtils]: 54: Hoare triple {13855#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {13646#false} is VALID [2018-11-19 00:10:38,756 INFO L273 TraceCheckUtils]: 55: Hoare triple {13646#false} assume !false; {13646#false} is VALID [2018-11-19 00:10:38,761 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:10:38,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:10:38,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-11-19 00:10:38,781 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 56 [2018-11-19 00:10:38,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:10:38,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states. [2018-11-19 00:10:38,836 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:10:38,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-19 00:10:38,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-19 00:10:38,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-11-19 00:10:38,838 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 49 states. [2018-11-19 00:10:44,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:10:44,640 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-11-19 00:10:44,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-19 00:10:44,640 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 56 [2018-11-19 00:10:44,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:10:44,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-19 00:10:44,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2018-11-19 00:10:44,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-19 00:10:44,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2018-11-19 00:10:44,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 61 transitions. [2018-11-19 00:10:44,701 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:10:44,702 INFO L225 Difference]: With dead ends: 61 [2018-11-19 00:10:44,703 INFO L226 Difference]: Without dead ends: 58 [2018-11-19 00:10:44,703 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=99, Invalid=2351, Unknown=0, NotChecked=0, Total=2450 [2018-11-19 00:10:44,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-19 00:10:44,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-19 00:10:44,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:10:44,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2018-11-19 00:10:44,813 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-19 00:10:44,813 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-19 00:10:44,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:10:44,815 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-11-19 00:10:44,815 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-11-19 00:10:44,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:10:44,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:10:44,816 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-19 00:10:44,816 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-19 00:10:44,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:10:44,817 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-11-19 00:10:44,817 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-11-19 00:10:44,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:10:44,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:10:44,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:10:44,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:10:44,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-19 00:10:44,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-11-19 00:10:44,818 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-11-19 00:10:44,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:10:44,819 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-11-19 00:10:44,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-19 00:10:44,819 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-11-19 00:10:44,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-19 00:10:44,819 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:10:44,820 INFO L375 BasicCegarLoop]: trace histogram [41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:10:44,820 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:10:44,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:10:44,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1266830784, now seen corresponding path program 41 times [2018-11-19 00:10:44,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:10:44,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:10:44,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:10:44,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:10:44,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:10:44,829 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:10:44,829 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:10:44,829 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-19 00:10:44,847 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-19 00:10:44,993 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2018-11-19 00:10:44,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:10:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:10:45,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:10:46,571 INFO L256 TraceCheckUtils]: 0: Hoare triple {14190#true} call ULTIMATE.init(); {14190#true} is VALID [2018-11-19 00:10:46,571 INFO L273 TraceCheckUtils]: 1: Hoare triple {14190#true} ~__return_main~0 := 0;~__return_96~0 := 0; {14190#true} is VALID [2018-11-19 00:10:46,572 INFO L273 TraceCheckUtils]: 2: Hoare triple {14190#true} assume true; {14190#true} is VALID [2018-11-19 00:10:46,572 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14190#true} {14190#true} #48#return; {14190#true} is VALID [2018-11-19 00:10:46,572 INFO L256 TraceCheckUtils]: 4: Hoare triple {14190#true} call #t~ret2 := main(); {14190#true} is VALID [2018-11-19 00:10:46,572 INFO L273 TraceCheckUtils]: 5: Hoare triple {14190#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; {14190#true} is VALID [2018-11-19 00:10:46,572 INFO L273 TraceCheckUtils]: 6: Hoare triple {14190#true} assume !!(1 <= ~main__n~0); {14190#true} is VALID [2018-11-19 00:10:46,573 INFO L273 TraceCheckUtils]: 7: Hoare triple {14190#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {14216#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:10:46,574 INFO L273 TraceCheckUtils]: 8: Hoare triple {14216#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14220#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-19 00:10:46,574 INFO L273 TraceCheckUtils]: 9: Hoare triple {14220#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14224#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:10:46,575 INFO L273 TraceCheckUtils]: 10: Hoare triple {14224#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14228#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:10:46,576 INFO L273 TraceCheckUtils]: 11: Hoare triple {14228#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14232#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:10:46,576 INFO L273 TraceCheckUtils]: 12: Hoare triple {14232#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14236#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:10:46,577 INFO L273 TraceCheckUtils]: 13: Hoare triple {14236#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14240#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:10:46,578 INFO L273 TraceCheckUtils]: 14: Hoare triple {14240#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14244#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:10:46,579 INFO L273 TraceCheckUtils]: 15: Hoare triple {14244#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14248#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:10:46,580 INFO L273 TraceCheckUtils]: 16: Hoare triple {14248#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14252#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-19 00:10:46,581 INFO L273 TraceCheckUtils]: 17: Hoare triple {14252#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14256#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-19 00:10:46,582 INFO L273 TraceCheckUtils]: 18: Hoare triple {14256#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14260#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-19 00:10:46,583 INFO L273 TraceCheckUtils]: 19: Hoare triple {14260#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14264#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-19 00:10:46,584 INFO L273 TraceCheckUtils]: 20: Hoare triple {14264#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14268#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-19 00:10:46,585 INFO L273 TraceCheckUtils]: 21: Hoare triple {14268#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14272#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-19 00:10:46,586 INFO L273 TraceCheckUtils]: 22: Hoare triple {14272#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14276#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-19 00:10:46,587 INFO L273 TraceCheckUtils]: 23: Hoare triple {14276#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14280#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-19 00:10:46,588 INFO L273 TraceCheckUtils]: 24: Hoare triple {14280#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14284#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-19 00:10:46,589 INFO L273 TraceCheckUtils]: 25: Hoare triple {14284#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14288#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-19 00:10:46,590 INFO L273 TraceCheckUtils]: 26: Hoare triple {14288#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14292#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-19 00:10:46,590 INFO L273 TraceCheckUtils]: 27: Hoare triple {14292#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14296#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-19 00:10:46,591 INFO L273 TraceCheckUtils]: 28: Hoare triple {14296#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14300#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-19 00:10:46,592 INFO L273 TraceCheckUtils]: 29: Hoare triple {14300#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14304#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-19 00:10:46,593 INFO L273 TraceCheckUtils]: 30: Hoare triple {14304#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14308#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-19 00:10:46,594 INFO L273 TraceCheckUtils]: 31: Hoare triple {14308#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14312#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-19 00:10:46,595 INFO L273 TraceCheckUtils]: 32: Hoare triple {14312#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14316#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-19 00:10:46,596 INFO L273 TraceCheckUtils]: 33: Hoare triple {14316#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14320#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-19 00:10:46,597 INFO L273 TraceCheckUtils]: 34: Hoare triple {14320#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14324#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-19 00:10:46,598 INFO L273 TraceCheckUtils]: 35: Hoare triple {14324#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14328#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-19 00:10:46,599 INFO L273 TraceCheckUtils]: 36: Hoare triple {14328#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14332#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-19 00:10:46,600 INFO L273 TraceCheckUtils]: 37: Hoare triple {14332#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14336#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-19 00:10:46,600 INFO L273 TraceCheckUtils]: 38: Hoare triple {14336#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14340#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-19 00:10:46,601 INFO L273 TraceCheckUtils]: 39: Hoare triple {14340#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14344#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-19 00:10:46,602 INFO L273 TraceCheckUtils]: 40: Hoare triple {14344#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14348#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} is VALID [2018-11-19 00:10:46,603 INFO L273 TraceCheckUtils]: 41: Hoare triple {14348#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14352#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} is VALID [2018-11-19 00:10:46,604 INFO L273 TraceCheckUtils]: 42: Hoare triple {14352#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14356#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} is VALID [2018-11-19 00:10:46,605 INFO L273 TraceCheckUtils]: 43: Hoare triple {14356#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14360#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} is VALID [2018-11-19 00:10:46,606 INFO L273 TraceCheckUtils]: 44: Hoare triple {14360#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14364#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} is VALID [2018-11-19 00:10:46,607 INFO L273 TraceCheckUtils]: 45: Hoare triple {14364#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14368#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} is VALID [2018-11-19 00:10:46,608 INFO L273 TraceCheckUtils]: 46: Hoare triple {14368#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14372#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} is VALID [2018-11-19 00:10:46,609 INFO L273 TraceCheckUtils]: 47: Hoare triple {14372#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14376#(and (= 41 main_~main__i~0) (= main_~main__sum~0 820))} is VALID [2018-11-19 00:10:46,610 INFO L273 TraceCheckUtils]: 48: Hoare triple {14376#(and (= 41 main_~main__i~0) (= main_~main__sum~0 820))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14380#(and (= main_~main__sum~0 861) (= 42 main_~main__i~0))} is VALID [2018-11-19 00:10:46,611 INFO L273 TraceCheckUtils]: 49: Hoare triple {14380#(and (= main_~main__sum~0 861) (= 42 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14384#(and (= 43 main_~main__i~0) (= main_~main__sum~0 903))} is VALID [2018-11-19 00:10:46,612 INFO L273 TraceCheckUtils]: 50: Hoare triple {14384#(and (= 43 main_~main__i~0) (= main_~main__sum~0 903))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14388#(and (= main_~main__sum~0 946) (= 44 main_~main__i~0))} is VALID [2018-11-19 00:10:46,612 INFO L273 TraceCheckUtils]: 51: Hoare triple {14388#(and (= main_~main__sum~0 946) (= 44 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14392#(and (= 45 main_~main__i~0) (= main_~main__sum~0 990))} is VALID [2018-11-19 00:10:46,613 INFO L273 TraceCheckUtils]: 52: Hoare triple {14392#(and (= 45 main_~main__i~0) (= main_~main__sum~0 990))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14396#(and (= 46 main_~main__i~0) (= main_~main__sum~0 1035))} is VALID [2018-11-19 00:10:46,614 INFO L273 TraceCheckUtils]: 53: Hoare triple {14396#(and (= 46 main_~main__i~0) (= main_~main__sum~0 1035))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14400#(and (= main_~main__sum~0 1081) (<= main_~main__i~0 47) (<= 46 main_~main__n~0))} is VALID [2018-11-19 00:10:46,615 INFO L273 TraceCheckUtils]: 54: Hoare triple {14400#(and (= main_~main__sum~0 1081) (<= main_~main__i~0 47) (<= 46 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {14404#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:10:46,616 INFO L273 TraceCheckUtils]: 55: Hoare triple {14404#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {14191#false} is VALID [2018-11-19 00:10:46,616 INFO L273 TraceCheckUtils]: 56: Hoare triple {14191#false} assume !false; {14191#false} is VALID [2018-11-19 00:10:46,622 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:10:46,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:10:46,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-11-19 00:10:46,642 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 57 [2018-11-19 00:10:46,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:10:46,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states. [2018-11-19 00:10:46,700 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:10:46,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-19 00:10:46,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-19 00:10:46,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-11-19 00:10:46,701 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 50 states. [2018-11-19 00:10:52,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:10:52,655 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-11-19 00:10:52,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-19 00:10:52,655 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 57 [2018-11-19 00:10:52,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:10:52,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-19 00:10:52,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2018-11-19 00:10:52,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-19 00:10:52,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2018-11-19 00:10:52,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states and 62 transitions. [2018-11-19 00:10:52,717 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:10:52,718 INFO L225 Difference]: With dead ends: 62 [2018-11-19 00:10:52,718 INFO L226 Difference]: Without dead ends: 59 [2018-11-19 00:10:52,719 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=101, Invalid=2449, Unknown=0, NotChecked=0, Total=2550 [2018-11-19 00:10:52,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-19 00:10:52,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-19 00:10:52,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:10:52,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 59 states. [2018-11-19 00:10:52,825 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2018-11-19 00:10:52,826 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2018-11-19 00:10:52,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:10:52,827 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-11-19 00:10:52,827 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-11-19 00:10:52,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:10:52,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:10:52,828 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2018-11-19 00:10:52,828 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2018-11-19 00:10:52,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:10:52,829 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-11-19 00:10:52,829 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-11-19 00:10:52,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:10:52,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:10:52,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:10:52,829 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:10:52,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-19 00:10:52,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-11-19 00:10:52,830 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-11-19 00:10:52,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:10:52,830 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-11-19 00:10:52,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-19 00:10:52,831 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-11-19 00:10:52,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-19 00:10:52,831 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:10:52,831 INFO L375 BasicCegarLoop]: trace histogram [42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:10:52,831 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:10:52,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:10:52,832 INFO L82 PathProgramCache]: Analyzing trace with hash -617111098, now seen corresponding path program 42 times [2018-11-19 00:10:52,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:10:52,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:10:52,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:10:52,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:10:52,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:10:52,839 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:10:52,839 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:10:52,839 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-19 00:10:52,854 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-19 00:10:53,410 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-11-19 00:10:53,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:10:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:10:53,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:10:55,230 INFO L256 TraceCheckUtils]: 0: Hoare triple {14745#true} call ULTIMATE.init(); {14745#true} is VALID [2018-11-19 00:10:55,230 INFO L273 TraceCheckUtils]: 1: Hoare triple {14745#true} ~__return_main~0 := 0;~__return_96~0 := 0; {14745#true} is VALID [2018-11-19 00:10:55,231 INFO L273 TraceCheckUtils]: 2: Hoare triple {14745#true} assume true; {14745#true} is VALID [2018-11-19 00:10:55,231 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14745#true} {14745#true} #48#return; {14745#true} is VALID [2018-11-19 00:10:55,231 INFO L256 TraceCheckUtils]: 4: Hoare triple {14745#true} call #t~ret2 := main(); {14745#true} is VALID [2018-11-19 00:10:55,231 INFO L273 TraceCheckUtils]: 5: Hoare triple {14745#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; {14745#true} is VALID [2018-11-19 00:10:55,231 INFO L273 TraceCheckUtils]: 6: Hoare triple {14745#true} assume !!(1 <= ~main__n~0); {14745#true} is VALID [2018-11-19 00:10:55,232 INFO L273 TraceCheckUtils]: 7: Hoare triple {14745#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {14771#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:10:55,233 INFO L273 TraceCheckUtils]: 8: Hoare triple {14771#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14775#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-19 00:10:55,233 INFO L273 TraceCheckUtils]: 9: Hoare triple {14775#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14779#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:10:55,234 INFO L273 TraceCheckUtils]: 10: Hoare triple {14779#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14783#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:10:55,234 INFO L273 TraceCheckUtils]: 11: Hoare triple {14783#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14787#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:10:55,235 INFO L273 TraceCheckUtils]: 12: Hoare triple {14787#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14791#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:10:55,236 INFO L273 TraceCheckUtils]: 13: Hoare triple {14791#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14795#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:10:55,237 INFO L273 TraceCheckUtils]: 14: Hoare triple {14795#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14799#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:10:55,238 INFO L273 TraceCheckUtils]: 15: Hoare triple {14799#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14803#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:10:55,239 INFO L273 TraceCheckUtils]: 16: Hoare triple {14803#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14807#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-19 00:10:55,240 INFO L273 TraceCheckUtils]: 17: Hoare triple {14807#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14811#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-19 00:10:55,241 INFO L273 TraceCheckUtils]: 18: Hoare triple {14811#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14815#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-19 00:10:55,242 INFO L273 TraceCheckUtils]: 19: Hoare triple {14815#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14819#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-19 00:10:55,243 INFO L273 TraceCheckUtils]: 20: Hoare triple {14819#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14823#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-19 00:10:55,244 INFO L273 TraceCheckUtils]: 21: Hoare triple {14823#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14827#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-19 00:10:55,245 INFO L273 TraceCheckUtils]: 22: Hoare triple {14827#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14831#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-19 00:10:55,245 INFO L273 TraceCheckUtils]: 23: Hoare triple {14831#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14835#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-19 00:10:55,246 INFO L273 TraceCheckUtils]: 24: Hoare triple {14835#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14839#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-19 00:10:55,247 INFO L273 TraceCheckUtils]: 25: Hoare triple {14839#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14843#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-19 00:10:55,248 INFO L273 TraceCheckUtils]: 26: Hoare triple {14843#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14847#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-19 00:10:55,249 INFO L273 TraceCheckUtils]: 27: Hoare triple {14847#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14851#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-19 00:10:55,250 INFO L273 TraceCheckUtils]: 28: Hoare triple {14851#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14855#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-19 00:10:55,251 INFO L273 TraceCheckUtils]: 29: Hoare triple {14855#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14859#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-19 00:10:55,263 INFO L273 TraceCheckUtils]: 30: Hoare triple {14859#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14863#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-19 00:10:55,264 INFO L273 TraceCheckUtils]: 31: Hoare triple {14863#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14867#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-19 00:10:55,264 INFO L273 TraceCheckUtils]: 32: Hoare triple {14867#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14871#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-19 00:10:55,265 INFO L273 TraceCheckUtils]: 33: Hoare triple {14871#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14875#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-19 00:10:55,265 INFO L273 TraceCheckUtils]: 34: Hoare triple {14875#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14879#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-19 00:10:55,266 INFO L273 TraceCheckUtils]: 35: Hoare triple {14879#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14883#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-19 00:10:55,267 INFO L273 TraceCheckUtils]: 36: Hoare triple {14883#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14887#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-19 00:10:55,267 INFO L273 TraceCheckUtils]: 37: Hoare triple {14887#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14891#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-19 00:10:55,268 INFO L273 TraceCheckUtils]: 38: Hoare triple {14891#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14895#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-19 00:10:55,269 INFO L273 TraceCheckUtils]: 39: Hoare triple {14895#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14899#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-19 00:10:55,270 INFO L273 TraceCheckUtils]: 40: Hoare triple {14899#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14903#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} is VALID [2018-11-19 00:10:55,270 INFO L273 TraceCheckUtils]: 41: Hoare triple {14903#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14907#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} is VALID [2018-11-19 00:10:55,271 INFO L273 TraceCheckUtils]: 42: Hoare triple {14907#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14911#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} is VALID [2018-11-19 00:10:55,272 INFO L273 TraceCheckUtils]: 43: Hoare triple {14911#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14915#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} is VALID [2018-11-19 00:10:55,273 INFO L273 TraceCheckUtils]: 44: Hoare triple {14915#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14919#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} is VALID [2018-11-19 00:10:55,274 INFO L273 TraceCheckUtils]: 45: Hoare triple {14919#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14923#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} is VALID [2018-11-19 00:10:55,275 INFO L273 TraceCheckUtils]: 46: Hoare triple {14923#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14927#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} is VALID [2018-11-19 00:10:55,276 INFO L273 TraceCheckUtils]: 47: Hoare triple {14927#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14931#(and (= 41 main_~main__i~0) (= main_~main__sum~0 820))} is VALID [2018-11-19 00:10:55,277 INFO L273 TraceCheckUtils]: 48: Hoare triple {14931#(and (= 41 main_~main__i~0) (= main_~main__sum~0 820))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14935#(and (= main_~main__sum~0 861) (= 42 main_~main__i~0))} is VALID [2018-11-19 00:10:55,278 INFO L273 TraceCheckUtils]: 49: Hoare triple {14935#(and (= main_~main__sum~0 861) (= 42 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14939#(and (= 43 main_~main__i~0) (= main_~main__sum~0 903))} is VALID [2018-11-19 00:10:55,279 INFO L273 TraceCheckUtils]: 50: Hoare triple {14939#(and (= 43 main_~main__i~0) (= main_~main__sum~0 903))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14943#(and (= main_~main__sum~0 946) (= 44 main_~main__i~0))} is VALID [2018-11-19 00:10:55,279 INFO L273 TraceCheckUtils]: 51: Hoare triple {14943#(and (= main_~main__sum~0 946) (= 44 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14947#(and (= 45 main_~main__i~0) (= main_~main__sum~0 990))} is VALID [2018-11-19 00:10:55,280 INFO L273 TraceCheckUtils]: 52: Hoare triple {14947#(and (= 45 main_~main__i~0) (= main_~main__sum~0 990))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14951#(and (= 46 main_~main__i~0) (= main_~main__sum~0 1035))} is VALID [2018-11-19 00:10:55,281 INFO L273 TraceCheckUtils]: 53: Hoare triple {14951#(and (= 46 main_~main__i~0) (= main_~main__sum~0 1035))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14955#(and (= main_~main__sum~0 1081) (= 47 main_~main__i~0))} is VALID [2018-11-19 00:10:55,282 INFO L273 TraceCheckUtils]: 54: Hoare triple {14955#(and (= main_~main__sum~0 1081) (= 47 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14959#(and (<= 47 main_~main__n~0) (<= main_~main__i~0 48) (= main_~main__sum~0 1128))} is VALID [2018-11-19 00:10:55,283 INFO L273 TraceCheckUtils]: 55: Hoare triple {14959#(and (<= 47 main_~main__n~0) (<= main_~main__i~0 48) (= main_~main__sum~0 1128))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {14963#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:10:55,284 INFO L273 TraceCheckUtils]: 56: Hoare triple {14963#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {14746#false} is VALID [2018-11-19 00:10:55,284 INFO L273 TraceCheckUtils]: 57: Hoare triple {14746#false} assume !false; {14746#false} is VALID [2018-11-19 00:10:55,290 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:10:55,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:10:55,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-11-19 00:10:55,310 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 58 [2018-11-19 00:10:55,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:10:55,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states. [2018-11-19 00:10:55,367 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:10:55,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-19 00:10:55,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-19 00:10:55,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-11-19 00:10:55,368 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 51 states. [2018-11-19 00:11:01,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:01,598 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-11-19 00:11:01,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-19 00:11:01,598 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 58 [2018-11-19 00:11:01,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:11:01,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-19 00:11:01,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2018-11-19 00:11:01,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-19 00:11:01,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2018-11-19 00:11:01,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 63 transitions. [2018-11-19 00:11:01,674 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:11:01,675 INFO L225 Difference]: With dead ends: 63 [2018-11-19 00:11:01,675 INFO L226 Difference]: Without dead ends: 60 [2018-11-19 00:11:01,676 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=103, Invalid=2549, Unknown=0, NotChecked=0, Total=2652 [2018-11-19 00:11:01,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-19 00:11:01,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-19 00:11:01,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:11:01,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 60 states. [2018-11-19 00:11:01,796 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-19 00:11:01,796 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-19 00:11:01,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:01,798 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-11-19 00:11:01,798 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-11-19 00:11:01,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:11:01,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:11:01,799 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-19 00:11:01,799 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-19 00:11:01,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:01,800 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-11-19 00:11:01,800 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-11-19 00:11:01,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:11:01,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:11:01,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:11:01,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:11:01,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-19 00:11:01,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-11-19 00:11:01,802 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-11-19 00:11:01,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:11:01,802 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-11-19 00:11:01,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-19 00:11:01,802 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-11-19 00:11:01,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-19 00:11:01,803 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:11:01,803 INFO L375 BasicCegarLoop]: trace histogram [43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:11:01,803 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:11:01,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:11:01,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1950637312, now seen corresponding path program 43 times [2018-11-19 00:11:01,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:11:01,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:11:01,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:11:01,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:11:01,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:11:01,812 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:11:01,812 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:11:01,812 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-19 00:11:01,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:11:01,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:11:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:11:01,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:11:03,575 INFO L256 TraceCheckUtils]: 0: Hoare triple {15310#true} call ULTIMATE.init(); {15310#true} is VALID [2018-11-19 00:11:03,576 INFO L273 TraceCheckUtils]: 1: Hoare triple {15310#true} ~__return_main~0 := 0;~__return_96~0 := 0; {15310#true} is VALID [2018-11-19 00:11:03,576 INFO L273 TraceCheckUtils]: 2: Hoare triple {15310#true} assume true; {15310#true} is VALID [2018-11-19 00:11:03,576 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15310#true} {15310#true} #48#return; {15310#true} is VALID [2018-11-19 00:11:03,576 INFO L256 TraceCheckUtils]: 4: Hoare triple {15310#true} call #t~ret2 := main(); {15310#true} is VALID [2018-11-19 00:11:03,577 INFO L273 TraceCheckUtils]: 5: Hoare triple {15310#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; {15310#true} is VALID [2018-11-19 00:11:03,577 INFO L273 TraceCheckUtils]: 6: Hoare triple {15310#true} assume !!(1 <= ~main__n~0); {15310#true} is VALID [2018-11-19 00:11:03,577 INFO L273 TraceCheckUtils]: 7: Hoare triple {15310#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {15336#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:11:03,578 INFO L273 TraceCheckUtils]: 8: Hoare triple {15336#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15340#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-19 00:11:03,578 INFO L273 TraceCheckUtils]: 9: Hoare triple {15340#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15344#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:11:03,579 INFO L273 TraceCheckUtils]: 10: Hoare triple {15344#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15348#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:11:03,579 INFO L273 TraceCheckUtils]: 11: Hoare triple {15348#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15352#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:11:03,580 INFO L273 TraceCheckUtils]: 12: Hoare triple {15352#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15356#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:11:03,581 INFO L273 TraceCheckUtils]: 13: Hoare triple {15356#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15360#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:11:03,582 INFO L273 TraceCheckUtils]: 14: Hoare triple {15360#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15364#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:11:03,583 INFO L273 TraceCheckUtils]: 15: Hoare triple {15364#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15368#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:11:03,584 INFO L273 TraceCheckUtils]: 16: Hoare triple {15368#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15372#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-19 00:11:03,585 INFO L273 TraceCheckUtils]: 17: Hoare triple {15372#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15376#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-19 00:11:03,586 INFO L273 TraceCheckUtils]: 18: Hoare triple {15376#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15380#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-19 00:11:03,587 INFO L273 TraceCheckUtils]: 19: Hoare triple {15380#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15384#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-19 00:11:03,588 INFO L273 TraceCheckUtils]: 20: Hoare triple {15384#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15388#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-19 00:11:03,589 INFO L273 TraceCheckUtils]: 21: Hoare triple {15388#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15392#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-19 00:11:03,589 INFO L273 TraceCheckUtils]: 22: Hoare triple {15392#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15396#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-19 00:11:03,590 INFO L273 TraceCheckUtils]: 23: Hoare triple {15396#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15400#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-19 00:11:03,591 INFO L273 TraceCheckUtils]: 24: Hoare triple {15400#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15404#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-19 00:11:03,592 INFO L273 TraceCheckUtils]: 25: Hoare triple {15404#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15408#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-19 00:11:03,593 INFO L273 TraceCheckUtils]: 26: Hoare triple {15408#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15412#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-19 00:11:03,594 INFO L273 TraceCheckUtils]: 27: Hoare triple {15412#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15416#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-19 00:11:03,595 INFO L273 TraceCheckUtils]: 28: Hoare triple {15416#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15420#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-19 00:11:03,596 INFO L273 TraceCheckUtils]: 29: Hoare triple {15420#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15424#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-19 00:11:03,597 INFO L273 TraceCheckUtils]: 30: Hoare triple {15424#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15428#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-19 00:11:03,598 INFO L273 TraceCheckUtils]: 31: Hoare triple {15428#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15432#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-19 00:11:03,599 INFO L273 TraceCheckUtils]: 32: Hoare triple {15432#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15436#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-19 00:11:03,600 INFO L273 TraceCheckUtils]: 33: Hoare triple {15436#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15440#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-19 00:11:03,601 INFO L273 TraceCheckUtils]: 34: Hoare triple {15440#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15444#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-19 00:11:03,602 INFO L273 TraceCheckUtils]: 35: Hoare triple {15444#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15448#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-19 00:11:03,602 INFO L273 TraceCheckUtils]: 36: Hoare triple {15448#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15452#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-19 00:11:03,603 INFO L273 TraceCheckUtils]: 37: Hoare triple {15452#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15456#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-19 00:11:03,604 INFO L273 TraceCheckUtils]: 38: Hoare triple {15456#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15460#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-19 00:11:03,605 INFO L273 TraceCheckUtils]: 39: Hoare triple {15460#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15464#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-19 00:11:03,606 INFO L273 TraceCheckUtils]: 40: Hoare triple {15464#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15468#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} is VALID [2018-11-19 00:11:03,607 INFO L273 TraceCheckUtils]: 41: Hoare triple {15468#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15472#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} is VALID [2018-11-19 00:11:03,608 INFO L273 TraceCheckUtils]: 42: Hoare triple {15472#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15476#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} is VALID [2018-11-19 00:11:03,609 INFO L273 TraceCheckUtils]: 43: Hoare triple {15476#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15480#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} is VALID [2018-11-19 00:11:03,610 INFO L273 TraceCheckUtils]: 44: Hoare triple {15480#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15484#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} is VALID [2018-11-19 00:11:03,610 INFO L273 TraceCheckUtils]: 45: Hoare triple {15484#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15488#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} is VALID [2018-11-19 00:11:03,611 INFO L273 TraceCheckUtils]: 46: Hoare triple {15488#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15492#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} is VALID [2018-11-19 00:11:03,612 INFO L273 TraceCheckUtils]: 47: Hoare triple {15492#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15496#(and (= 41 main_~main__i~0) (= main_~main__sum~0 820))} is VALID [2018-11-19 00:11:03,613 INFO L273 TraceCheckUtils]: 48: Hoare triple {15496#(and (= 41 main_~main__i~0) (= main_~main__sum~0 820))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15500#(and (= main_~main__sum~0 861) (= 42 main_~main__i~0))} is VALID [2018-11-19 00:11:03,614 INFO L273 TraceCheckUtils]: 49: Hoare triple {15500#(and (= main_~main__sum~0 861) (= 42 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15504#(and (= 43 main_~main__i~0) (= main_~main__sum~0 903))} is VALID [2018-11-19 00:11:03,615 INFO L273 TraceCheckUtils]: 50: Hoare triple {15504#(and (= 43 main_~main__i~0) (= main_~main__sum~0 903))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15508#(and (= main_~main__sum~0 946) (= 44 main_~main__i~0))} is VALID [2018-11-19 00:11:03,616 INFO L273 TraceCheckUtils]: 51: Hoare triple {15508#(and (= main_~main__sum~0 946) (= 44 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15512#(and (= 45 main_~main__i~0) (= main_~main__sum~0 990))} is VALID [2018-11-19 00:11:03,617 INFO L273 TraceCheckUtils]: 52: Hoare triple {15512#(and (= 45 main_~main__i~0) (= main_~main__sum~0 990))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15516#(and (= 46 main_~main__i~0) (= main_~main__sum~0 1035))} is VALID [2018-11-19 00:11:03,618 INFO L273 TraceCheckUtils]: 53: Hoare triple {15516#(and (= 46 main_~main__i~0) (= main_~main__sum~0 1035))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15520#(and (= main_~main__sum~0 1081) (= 47 main_~main__i~0))} is VALID [2018-11-19 00:11:03,619 INFO L273 TraceCheckUtils]: 54: Hoare triple {15520#(and (= main_~main__sum~0 1081) (= 47 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15524#(and (= main_~main__sum~0 1128) (= 48 main_~main__i~0))} is VALID [2018-11-19 00:11:03,620 INFO L273 TraceCheckUtils]: 55: Hoare triple {15524#(and (= main_~main__sum~0 1128) (= 48 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15528#(and (<= 48 main_~main__n~0) (= main_~main__sum~0 1176) (<= main_~main__i~0 49))} is VALID [2018-11-19 00:11:03,621 INFO L273 TraceCheckUtils]: 56: Hoare triple {15528#(and (<= 48 main_~main__n~0) (= main_~main__sum~0 1176) (<= main_~main__i~0 49))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {15532#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:11:03,622 INFO L273 TraceCheckUtils]: 57: Hoare triple {15532#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {15311#false} is VALID [2018-11-19 00:11:03,622 INFO L273 TraceCheckUtils]: 58: Hoare triple {15311#false} assume !false; {15311#false} is VALID [2018-11-19 00:11:03,628 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:11:03,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:11:03,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-11-19 00:11:03,648 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 59 [2018-11-19 00:11:03,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:11:03,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states. [2018-11-19 00:11:03,706 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:11:03,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-19 00:11:03,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-19 00:11:03,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-11-19 00:11:03,708 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 52 states. [2018-11-19 00:11:10,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:10,259 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-11-19 00:11:10,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-19 00:11:10,259 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 59 [2018-11-19 00:11:10,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:11:10,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-19 00:11:10,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2018-11-19 00:11:10,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-19 00:11:10,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2018-11-19 00:11:10,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 64 transitions. [2018-11-19 00:11:10,323 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:11:10,324 INFO L225 Difference]: With dead ends: 64 [2018-11-19 00:11:10,325 INFO L226 Difference]: Without dead ends: 61 [2018-11-19 00:11:10,325 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=105, Invalid=2651, Unknown=0, NotChecked=0, Total=2756 [2018-11-19 00:11:10,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-19 00:11:10,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-19 00:11:10,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:11:10,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 61 states. [2018-11-19 00:11:10,439 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2018-11-19 00:11:10,440 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2018-11-19 00:11:10,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:10,441 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-11-19 00:11:10,441 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-11-19 00:11:10,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:11:10,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:11:10,441 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2018-11-19 00:11:10,441 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2018-11-19 00:11:10,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:10,442 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-11-19 00:11:10,442 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-11-19 00:11:10,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:11:10,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:11:10,442 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:11:10,442 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:11:10,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-19 00:11:10,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-11-19 00:11:10,443 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-11-19 00:11:10,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:11:10,443 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-11-19 00:11:10,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-19 00:11:10,443 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-11-19 00:11:10,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-19 00:11:10,444 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:11:10,444 INFO L375 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:11:10,444 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:11:10,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:11:10,444 INFO L82 PathProgramCache]: Analyzing trace with hash -340276986, now seen corresponding path program 44 times [2018-11-19 00:11:10,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:11:10,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:11:10,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:11:10,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:11:10,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:11:10,453 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:11:10,453 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:11:10,453 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-19 00:11:10,470 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-19 00:11:10,561 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-19 00:11:10,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:11:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:11:10,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:11:12,339 INFO L256 TraceCheckUtils]: 0: Hoare triple {15885#true} call ULTIMATE.init(); {15885#true} is VALID [2018-11-19 00:11:12,339 INFO L273 TraceCheckUtils]: 1: Hoare triple {15885#true} ~__return_main~0 := 0;~__return_96~0 := 0; {15885#true} is VALID [2018-11-19 00:11:12,339 INFO L273 TraceCheckUtils]: 2: Hoare triple {15885#true} assume true; {15885#true} is VALID [2018-11-19 00:11:12,339 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15885#true} {15885#true} #48#return; {15885#true} is VALID [2018-11-19 00:11:12,340 INFO L256 TraceCheckUtils]: 4: Hoare triple {15885#true} call #t~ret2 := main(); {15885#true} is VALID [2018-11-19 00:11:12,340 INFO L273 TraceCheckUtils]: 5: Hoare triple {15885#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; {15885#true} is VALID [2018-11-19 00:11:12,340 INFO L273 TraceCheckUtils]: 6: Hoare triple {15885#true} assume !!(1 <= ~main__n~0); {15885#true} is VALID [2018-11-19 00:11:12,341 INFO L273 TraceCheckUtils]: 7: Hoare triple {15885#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {15911#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-19 00:11:12,341 INFO L273 TraceCheckUtils]: 8: Hoare triple {15911#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15915#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-19 00:11:12,342 INFO L273 TraceCheckUtils]: 9: Hoare triple {15915#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15919#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-19 00:11:12,342 INFO L273 TraceCheckUtils]: 10: Hoare triple {15919#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15923#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-19 00:11:12,343 INFO L273 TraceCheckUtils]: 11: Hoare triple {15923#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15927#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-19 00:11:12,344 INFO L273 TraceCheckUtils]: 12: Hoare triple {15927#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15931#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-19 00:11:12,345 INFO L273 TraceCheckUtils]: 13: Hoare triple {15931#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15935#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-19 00:11:12,346 INFO L273 TraceCheckUtils]: 14: Hoare triple {15935#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15939#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-19 00:11:12,346 INFO L273 TraceCheckUtils]: 15: Hoare triple {15939#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15943#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-19 00:11:12,347 INFO L273 TraceCheckUtils]: 16: Hoare triple {15943#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15947#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-19 00:11:12,348 INFO L273 TraceCheckUtils]: 17: Hoare triple {15947#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15951#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-19 00:11:12,349 INFO L273 TraceCheckUtils]: 18: Hoare triple {15951#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15955#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-19 00:11:12,350 INFO L273 TraceCheckUtils]: 19: Hoare triple {15955#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15959#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-19 00:11:12,351 INFO L273 TraceCheckUtils]: 20: Hoare triple {15959#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15963#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-19 00:11:12,352 INFO L273 TraceCheckUtils]: 21: Hoare triple {15963#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15967#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-19 00:11:12,353 INFO L273 TraceCheckUtils]: 22: Hoare triple {15967#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15971#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-19 00:11:12,353 INFO L273 TraceCheckUtils]: 23: Hoare triple {15971#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15975#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-19 00:11:12,354 INFO L273 TraceCheckUtils]: 24: Hoare triple {15975#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15979#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-19 00:11:12,355 INFO L273 TraceCheckUtils]: 25: Hoare triple {15979#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15983#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-19 00:11:12,356 INFO L273 TraceCheckUtils]: 26: Hoare triple {15983#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15987#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-19 00:11:12,357 INFO L273 TraceCheckUtils]: 27: Hoare triple {15987#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15991#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-19 00:11:12,358 INFO L273 TraceCheckUtils]: 28: Hoare triple {15991#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15995#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-19 00:11:12,359 INFO L273 TraceCheckUtils]: 29: Hoare triple {15995#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15999#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-19 00:11:12,359 INFO L273 TraceCheckUtils]: 30: Hoare triple {15999#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16003#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-19 00:11:12,360 INFO L273 TraceCheckUtils]: 31: Hoare triple {16003#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16007#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-19 00:11:12,361 INFO L273 TraceCheckUtils]: 32: Hoare triple {16007#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16011#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-19 00:11:12,362 INFO L273 TraceCheckUtils]: 33: Hoare triple {16011#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16015#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-19 00:11:12,363 INFO L273 TraceCheckUtils]: 34: Hoare triple {16015#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16019#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-19 00:11:12,364 INFO L273 TraceCheckUtils]: 35: Hoare triple {16019#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16023#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-19 00:11:12,365 INFO L273 TraceCheckUtils]: 36: Hoare triple {16023#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16027#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-19 00:11:12,366 INFO L273 TraceCheckUtils]: 37: Hoare triple {16027#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16031#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-19 00:11:12,366 INFO L273 TraceCheckUtils]: 38: Hoare triple {16031#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16035#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-19 00:11:12,367 INFO L273 TraceCheckUtils]: 39: Hoare triple {16035#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16039#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-19 00:11:12,368 INFO L273 TraceCheckUtils]: 40: Hoare triple {16039#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16043#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} is VALID [2018-11-19 00:11:12,369 INFO L273 TraceCheckUtils]: 41: Hoare triple {16043#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16047#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} is VALID [2018-11-19 00:11:12,370 INFO L273 TraceCheckUtils]: 42: Hoare triple {16047#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16051#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} is VALID [2018-11-19 00:11:12,371 INFO L273 TraceCheckUtils]: 43: Hoare triple {16051#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16055#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} is VALID [2018-11-19 00:11:12,371 INFO L273 TraceCheckUtils]: 44: Hoare triple {16055#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16059#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} is VALID [2018-11-19 00:11:12,372 INFO L273 TraceCheckUtils]: 45: Hoare triple {16059#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16063#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} is VALID [2018-11-19 00:11:12,373 INFO L273 TraceCheckUtils]: 46: Hoare triple {16063#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16067#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} is VALID [2018-11-19 00:11:12,374 INFO L273 TraceCheckUtils]: 47: Hoare triple {16067#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16071#(and (= 41 main_~main__i~0) (= main_~main__sum~0 820))} is VALID [2018-11-19 00:11:12,375 INFO L273 TraceCheckUtils]: 48: Hoare triple {16071#(and (= 41 main_~main__i~0) (= main_~main__sum~0 820))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16075#(and (= main_~main__sum~0 861) (= 42 main_~main__i~0))} is VALID [2018-11-19 00:11:12,376 INFO L273 TraceCheckUtils]: 49: Hoare triple {16075#(and (= main_~main__sum~0 861) (= 42 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16079#(and (= 43 main_~main__i~0) (= main_~main__sum~0 903))} is VALID [2018-11-19 00:11:12,377 INFO L273 TraceCheckUtils]: 50: Hoare triple {16079#(and (= 43 main_~main__i~0) (= main_~main__sum~0 903))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16083#(and (= main_~main__sum~0 946) (= 44 main_~main__i~0))} is VALID [2018-11-19 00:11:12,378 INFO L273 TraceCheckUtils]: 51: Hoare triple {16083#(and (= main_~main__sum~0 946) (= 44 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16087#(and (= 45 main_~main__i~0) (= main_~main__sum~0 990))} is VALID [2018-11-19 00:11:12,378 INFO L273 TraceCheckUtils]: 52: Hoare triple {16087#(and (= 45 main_~main__i~0) (= main_~main__sum~0 990))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16091#(and (= 46 main_~main__i~0) (= main_~main__sum~0 1035))} is VALID [2018-11-19 00:11:12,379 INFO L273 TraceCheckUtils]: 53: Hoare triple {16091#(and (= 46 main_~main__i~0) (= main_~main__sum~0 1035))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16095#(and (= main_~main__sum~0 1081) (= 47 main_~main__i~0))} is VALID [2018-11-19 00:11:12,380 INFO L273 TraceCheckUtils]: 54: Hoare triple {16095#(and (= main_~main__sum~0 1081) (= 47 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16099#(and (= main_~main__sum~0 1128) (= 48 main_~main__i~0))} is VALID [2018-11-19 00:11:12,381 INFO L273 TraceCheckUtils]: 55: Hoare triple {16099#(and (= main_~main__sum~0 1128) (= 48 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16103#(and (= 49 main_~main__i~0) (= main_~main__sum~0 1176))} is VALID [2018-11-19 00:11:12,382 INFO L273 TraceCheckUtils]: 56: Hoare triple {16103#(and (= 49 main_~main__i~0) (= main_~main__sum~0 1176))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16107#(and (= main_~main__sum~0 1225) (<= 49 main_~main__n~0) (<= main_~main__i~0 50))} is VALID [2018-11-19 00:11:12,383 INFO L273 TraceCheckUtils]: 57: Hoare triple {16107#(and (= main_~main__sum~0 1225) (<= 49 main_~main__n~0) (<= main_~main__i~0 50))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {16111#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:11:12,384 INFO L273 TraceCheckUtils]: 58: Hoare triple {16111#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {15886#false} is VALID [2018-11-19 00:11:12,384 INFO L273 TraceCheckUtils]: 59: Hoare triple {15886#false} assume !false; {15886#false} is VALID [2018-11-19 00:11:12,390 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:11:12,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-19 00:11:12,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-11-19 00:11:12,410 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 60 [2018-11-19 00:11:12,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:11:12,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states. [2018-11-19 00:11:12,470 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:11:12,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-11-19 00:11:12,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-19 00:11:12,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-11-19 00:11:12,471 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 53 states. [2018-11-19 00:11:18,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:18,973 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-11-19 00:11:18,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-19 00:11:18,973 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 60 [2018-11-19 00:11:18,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:11:18,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-19 00:11:18,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2018-11-19 00:11:18,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-19 00:11:18,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2018-11-19 00:11:18,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states and 65 transitions. [2018-11-19 00:11:19,035 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:11:19,036 INFO L225 Difference]: With dead ends: 65 [2018-11-19 00:11:19,036 INFO L226 Difference]: Without dead ends: 62 [2018-11-19 00:11:19,037 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=107, Invalid=2755, Unknown=0, NotChecked=0, Total=2862 [2018-11-19 00:11:19,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-19 00:11:19,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-11-19 00:11:19,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:11:19,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 62 states. [2018-11-19 00:11:19,167 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2018-11-19 00:11:19,167 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2018-11-19 00:11:19,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:19,168 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-11-19 00:11:19,168 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-11-19 00:11:19,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:11:19,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:11:19,169 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2018-11-19 00:11:19,169 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2018-11-19 00:11:19,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:19,170 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-11-19 00:11:19,170 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-11-19 00:11:19,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:11:19,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:11:19,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:11:19,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:11:19,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-19 00:11:19,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-11-19 00:11:19,171 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-11-19 00:11:19,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:11:19,172 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-11-19 00:11:19,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-11-19 00:11:19,172 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-11-19 00:11:19,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-19 00:11:19,172 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:11:19,172 INFO L375 BasicCegarLoop]: trace histogram [45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:11:19,173 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:11:19,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:11:19,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1958714432, now seen corresponding path program 45 times [2018-11-19 00:11:19,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:11:19,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:11:19,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:11:19,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:11:19,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:11:19,182 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-19 00:11:19,182 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-19 00:11:19,182 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-19 00:11:19,199 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2