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+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:35:48,630 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:35:48,635 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:35:48,654 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:35:48,654 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:35:48,655 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:35:48,657 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:35:48,660 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:35:48,663 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:35:48,664 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:35:48,673 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:35:48,673 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:35:48,674 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:35:48,675 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:35:48,677 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:35:48,677 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:35:48,683 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:35:48,686 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:35:48,688 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:35:48,693 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:35:48,694 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:35:48,697 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:35:48,703 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:35:48,703 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:35:48,703 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:35:48,704 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:35:48,705 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:35:48,709 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:35:48,710 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:35:48,711 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:35:48,711 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:35:48,714 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:35:48,714 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:35:48,714 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:35:48,715 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:35:48,716 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:35:48,717 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 17:35:48,743 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:35:48,744 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:35:48,745 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:35:48,746 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:35:48,746 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:35:48,747 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:35:48,747 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:35:48,747 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:35:48,747 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:35:48,747 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:35:48,749 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:35:48,749 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:35:48,749 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:35:48,749 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:35:48,749 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:35:48,750 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:35:48,751 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:35:48,751 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:35:48,751 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:35:48,751 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:35:48,751 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:35:48,752 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:35:48,752 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:35:48,752 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:35:48,752 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:35:48,752 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:35:48,753 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:35:48,753 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:35:48,753 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:35:48,754 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:35:48,822 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:35:48,839 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:35:48,843 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:35:48,845 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:35:48,845 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:35:48,846 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/gauss_sum_true-unreach-call.i.p+cfa-reducer.c [2018-11-14 17:35:48,916 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ec455cbd/154a1a02a1ed4e82952d3acab78d8e16/FLAG8258798a5 [2018-11-14 17:35:49,363 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:35:49,364 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum_true-unreach-call.i.p+cfa-reducer.c [2018-11-14 17:35:49,371 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ec455cbd/154a1a02a1ed4e82952d3acab78d8e16/FLAG8258798a5 [2018-11-14 17:35:49,387 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ec455cbd/154a1a02a1ed4e82952d3acab78d8e16 [2018-11-14 17:35:49,400 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:35:49,404 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:35:49,406 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:35:49,406 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:35:49,411 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:35:49,413 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:35:49" (1/1) ... [2018-11-14 17:35:49,416 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42e13fb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:49, skipping insertion in model container [2018-11-14 17:35:49,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:35:49" (1/1) ... [2018-11-14 17:35:49,426 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:35:49,448 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:35:49,657 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:35:49,665 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:35:49,694 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:35:49,713 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:35:49,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:49 WrapperNode [2018-11-14 17:35:49,714 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:35:49,715 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:35:49,715 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:35:49,715 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:35:49,731 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:49" (1/1) ... [2018-11-14 17:35:49,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:49" (1/1) ... [2018-11-14 17:35:49,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:49" (1/1) ... [2018-11-14 17:35:49,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:49" (1/1) ... [2018-11-14 17:35:49,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:49" (1/1) ... [2018-11-14 17:35:49,748 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:49" (1/1) ... [2018-11-14 17:35:49,749 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:49" (1/1) ... [2018-11-14 17:35:49,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:35:49,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:35:49,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:35:49,752 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:35:49,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:35:49,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:35:49,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:35:49,882 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:35:49,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:35:49,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 17:35:49,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:35:49,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:35:49,883 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:35:49,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:35:49,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:35:50,292 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:35:50,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:35:50 BoogieIcfgContainer [2018-11-14 17:35:50,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:35:50,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:35:50,293 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:35:50,297 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:35:50,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:35:49" (1/3) ... [2018-11-14 17:35:50,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b28fb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:35:50, skipping insertion in model container [2018-11-14 17:35:50,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:49" (2/3) ... [2018-11-14 17:35:50,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b28fb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:35:50, skipping insertion in model container [2018-11-14 17:35:50,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:35:50" (3/3) ... [2018-11-14 17:35:50,301 INFO L112 eAbstractionObserver]: Analyzing ICFG gauss_sum_true-unreach-call.i.p+cfa-reducer.c [2018-11-14 17:35:50,311 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:35:50,319 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:35:50,337 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:35:50,368 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:35:50,368 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:35:50,369 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:35:50,369 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:35:50,369 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:35:50,369 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:35:50,369 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:35:50,369 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:35:50,369 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:35:50,388 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2018-11-14 17:35:50,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 17:35:50,395 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:50,396 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:50,399 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:50,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:50,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1277702393, now seen corresponding path program 1 times [2018-11-14 17:35:50,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:50,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:50,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:50,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:50,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:50,496 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:35:50,497 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:35:50,497 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:35:50,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:50,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:35:50,781 INFO L256 TraceCheckUtils]: 0: Hoare triple {19#true} call ULTIMATE.init(); {19#true} is VALID [2018-11-14 17:35:50,785 INFO L273 TraceCheckUtils]: 1: Hoare triple {19#true} ~__return_main~0 := 0;~__return_80~0 := 0; {19#true} is VALID [2018-11-14 17:35:50,786 INFO L273 TraceCheckUtils]: 2: Hoare triple {19#true} assume true; {19#true} is VALID [2018-11-14 17:35:50,786 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19#true} {19#true} #28#return; {19#true} is VALID [2018-11-14 17:35:50,787 INFO L256 TraceCheckUtils]: 4: Hoare triple {19#true} call #t~ret2 := main(); {19#true} is VALID [2018-11-14 17:35:50,787 INFO L273 TraceCheckUtils]: 5: Hoare triple {19#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {19#true} is VALID [2018-11-14 17:35:50,802 INFO L273 TraceCheckUtils]: 6: Hoare triple {19#true} assume !!(1 <= ~main__n~0); {42#(<= 1 main_~main__n~0)} is VALID [2018-11-14 17:35:50,812 INFO L273 TraceCheckUtils]: 7: Hoare triple {42#(<= 1 main_~main__n~0)} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {46#(and (<= main_~main__i~0 1) (<= 1 main_~main__n~0))} is VALID [2018-11-14 17:35:50,825 INFO L273 TraceCheckUtils]: 8: Hoare triple {46#(and (<= main_~main__i~0 1) (<= 1 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {20#false} is VALID [2018-11-14 17:35:50,826 INFO L273 TraceCheckUtils]: 9: Hoare triple {20#false} assume ~__VERIFIER_assert__cond~0 == 0; {20#false} is VALID [2018-11-14 17:35:50,826 INFO L273 TraceCheckUtils]: 10: Hoare triple {20#false} assume !false; {20#false} is VALID [2018-11-14 17:35:50,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:35:50,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:35:50,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:35:50,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-14 17:35:50,869 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:50,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:35:50,969 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:50,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:35:50,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:35:50,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:35:50,984 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 4 states. [2018-11-14 17:35:51,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:51,341 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-14 17:35:51,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:35:51,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-14 17:35:51,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:51,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:35:51,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2018-11-14 17:35:51,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:35:51,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2018-11-14 17:35:51,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2018-11-14 17:35:51,474 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:51,484 INFO L225 Difference]: With dead ends: 26 [2018-11-14 17:35:51,484 INFO L226 Difference]: Without dead ends: 13 [2018-11-14 17:35:51,487 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:35:51,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-14 17:35:51,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-14 17:35:51,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:51,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-14 17:35:51,528 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-14 17:35:51,529 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-14 17:35:51,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:51,532 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-14 17:35:51,532 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-14 17:35:51,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:51,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:51,533 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-14 17:35:51,533 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-14 17:35:51,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:51,537 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-14 17:35:51,537 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-14 17:35:51,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:51,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:51,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:51,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:51,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 17:35:51,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-14 17:35:51,542 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-11-14 17:35:51,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:51,542 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-14 17:35:51,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:35:51,543 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-14 17:35:51,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 17:35:51,544 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:51,544 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:51,545 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:51,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:51,545 INFO L82 PathProgramCache]: Analyzing trace with hash -954130992, now seen corresponding path program 1 times [2018-11-14 17:35:51,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:51,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:51,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:51,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:51,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:51,557 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:35:51,557 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:35:51,558 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:35:51,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:51,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:35:51,938 INFO L256 TraceCheckUtils]: 0: Hoare triple {132#true} call ULTIMATE.init(); {132#true} is VALID [2018-11-14 17:35:51,938 INFO L273 TraceCheckUtils]: 1: Hoare triple {132#true} ~__return_main~0 := 0;~__return_80~0 := 0; {132#true} is VALID [2018-11-14 17:35:51,939 INFO L273 TraceCheckUtils]: 2: Hoare triple {132#true} assume true; {132#true} is VALID [2018-11-14 17:35:51,939 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {132#true} {132#true} #28#return; {132#true} is VALID [2018-11-14 17:35:51,939 INFO L256 TraceCheckUtils]: 4: Hoare triple {132#true} call #t~ret2 := main(); {132#true} is VALID [2018-11-14 17:35:51,940 INFO L273 TraceCheckUtils]: 5: Hoare triple {132#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {132#true} is VALID [2018-11-14 17:35:51,942 INFO L273 TraceCheckUtils]: 6: Hoare triple {132#true} assume !!(1 <= ~main__n~0); {155#(<= 1 main_~main__n~0)} is VALID [2018-11-14 17:35:51,943 INFO L273 TraceCheckUtils]: 7: Hoare triple {155#(<= 1 main_~main__n~0)} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {159#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0) (<= 1 main_~main__n~0))} is VALID [2018-11-14 17:35:51,945 INFO L273 TraceCheckUtils]: 8: Hoare triple {159#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {163#(and (= main_~main__sum~0 1) (<= main_~main__i~0 2) (<= 1 main_~main__n~0))} is VALID [2018-11-14 17:35:51,946 INFO L273 TraceCheckUtils]: 9: Hoare triple {163#(and (= main_~main__sum~0 1) (<= main_~main__i~0 2) (<= 1 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {167#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:35:51,950 INFO L273 TraceCheckUtils]: 10: Hoare triple {167#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {133#false} is VALID [2018-11-14 17:35:51,951 INFO L273 TraceCheckUtils]: 11: Hoare triple {133#false} assume !false; {133#false} is VALID [2018-11-14 17:35:51,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:35:51,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:35:51,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-14 17:35:51,975 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-14 17:35:51,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:51,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:35:52,011 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:52,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:35:52,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:35:52,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:35:52,012 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2018-11-14 17:35:52,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:52,576 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-14 17:35:52,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:35:52,577 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-14 17:35:52,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:52,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:35:52,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2018-11-14 17:35:52,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:35:52,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2018-11-14 17:35:52,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 17 transitions. [2018-11-14 17:35:52,630 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:52,631 INFO L225 Difference]: With dead ends: 17 [2018-11-14 17:35:52,631 INFO L226 Difference]: Without dead ends: 14 [2018-11-14 17:35:52,632 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:35:52,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-14 17:35:52,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-14 17:35:52,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:52,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-14 17:35:52,654 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 17:35:52,654 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 17:35:52,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:52,656 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-14 17:35:52,657 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 17:35:52,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:52,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:52,657 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 17:35:52,657 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 17:35:52,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:52,659 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-14 17:35:52,659 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 17:35:52,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:52,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:52,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:52,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:52,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:35:52,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-14 17:35:52,662 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-11-14 17:35:52,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:52,663 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-14 17:35:52,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:35:52,663 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 17:35:52,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 17:35:52,664 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:52,664 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:52,664 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:52,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:52,665 INFO L82 PathProgramCache]: Analyzing trace with hash 486647847, now seen corresponding path program 2 times [2018-11-14 17:35:52,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:52,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:52,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:52,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:52,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:52,681 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:35:52,681 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:35:52,681 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:35:52,700 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:35:52,718 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:35:52,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:35:52,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:52,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:35:52,983 INFO L256 TraceCheckUtils]: 0: Hoare triple {248#true} call ULTIMATE.init(); {248#true} is VALID [2018-11-14 17:35:52,983 INFO L273 TraceCheckUtils]: 1: Hoare triple {248#true} ~__return_main~0 := 0;~__return_80~0 := 0; {248#true} is VALID [2018-11-14 17:35:52,984 INFO L273 TraceCheckUtils]: 2: Hoare triple {248#true} assume true; {248#true} is VALID [2018-11-14 17:35:52,984 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {248#true} {248#true} #28#return; {248#true} is VALID [2018-11-14 17:35:52,984 INFO L256 TraceCheckUtils]: 4: Hoare triple {248#true} call #t~ret2 := main(); {248#true} is VALID [2018-11-14 17:35:52,985 INFO L273 TraceCheckUtils]: 5: Hoare triple {248#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {248#true} is VALID [2018-11-14 17:35:52,985 INFO L273 TraceCheckUtils]: 6: Hoare triple {248#true} assume !!(1 <= ~main__n~0); {248#true} is VALID [2018-11-14 17:35:52,986 INFO L273 TraceCheckUtils]: 7: Hoare triple {248#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {274#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:35:52,987 INFO L273 TraceCheckUtils]: 8: Hoare triple {274#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {278#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:35:52,988 INFO L273 TraceCheckUtils]: 9: Hoare triple {278#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {282#(and (<= 2 main_~main__n~0) (<= main_~main__i~0 3) (= main_~main__sum~0 3))} is VALID [2018-11-14 17:35:52,989 INFO L273 TraceCheckUtils]: 10: Hoare triple {282#(and (<= 2 main_~main__n~0) (<= main_~main__i~0 3) (= main_~main__sum~0 3))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {286#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:35:52,990 INFO L273 TraceCheckUtils]: 11: Hoare triple {286#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {249#false} is VALID [2018-11-14 17:35:52,990 INFO L273 TraceCheckUtils]: 12: Hoare triple {249#false} assume !false; {249#false} is VALID [2018-11-14 17:35:52,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:35:53,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:35:53,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-14 17:35:53,014 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-14 17:35:53,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:53,014 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:35:53,027 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:53,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:35:53,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:35:53,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:35:53,029 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 6 states. [2018-11-14 17:35:53,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:53,287 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-14 17:35:53,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:35:53,288 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-14 17:35:53,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:53,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:35:53,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2018-11-14 17:35:53,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:35:53,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2018-11-14 17:35:53,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 18 transitions. [2018-11-14 17:35:53,322 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:53,323 INFO L225 Difference]: With dead ends: 18 [2018-11-14 17:35:53,324 INFO L226 Difference]: Without dead ends: 15 [2018-11-14 17:35:53,324 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:35:53,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-14 17:35:53,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-14 17:35:53,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:53,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-14 17:35:53,370 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-14 17:35:53,370 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-14 17:35:53,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:53,372 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-14 17:35:53,372 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-14 17:35:53,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:53,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:53,373 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-14 17:35:53,373 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-14 17:35:53,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:53,374 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-14 17:35:53,375 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-14 17:35:53,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:53,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:53,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:53,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:53,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 17:35:53,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-14 17:35:53,377 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-11-14 17:35:53,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:53,378 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-14 17:35:53,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:35:53,378 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-14 17:35:53,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-14 17:35:53,379 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:53,379 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:53,379 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:53,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:53,380 INFO L82 PathProgramCache]: Analyzing trace with hash -2093848400, now seen corresponding path program 3 times [2018-11-14 17:35:53,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:53,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:53,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:53,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:35:53,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:53,393 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:35:53,393 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:35:53,394 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:35:53,403 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:35:53,417 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-14 17:35:53,418 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:35:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:53,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:35:53,638 INFO L256 TraceCheckUtils]: 0: Hoare triple {373#true} call ULTIMATE.init(); {373#true} is VALID [2018-11-14 17:35:53,639 INFO L273 TraceCheckUtils]: 1: Hoare triple {373#true} ~__return_main~0 := 0;~__return_80~0 := 0; {373#true} is VALID [2018-11-14 17:35:53,639 INFO L273 TraceCheckUtils]: 2: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-14 17:35:53,640 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {373#true} {373#true} #28#return; {373#true} is VALID [2018-11-14 17:35:53,640 INFO L256 TraceCheckUtils]: 4: Hoare triple {373#true} call #t~ret2 := main(); {373#true} is VALID [2018-11-14 17:35:53,640 INFO L273 TraceCheckUtils]: 5: Hoare triple {373#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {373#true} is VALID [2018-11-14 17:35:53,640 INFO L273 TraceCheckUtils]: 6: Hoare triple {373#true} assume !!(1 <= ~main__n~0); {373#true} is VALID [2018-11-14 17:35:53,644 INFO L273 TraceCheckUtils]: 7: Hoare triple {373#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {399#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:35:53,648 INFO L273 TraceCheckUtils]: 8: Hoare triple {399#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {403#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:35:53,648 INFO L273 TraceCheckUtils]: 9: Hoare triple {403#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {407#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:35:53,651 INFO L273 TraceCheckUtils]: 10: Hoare triple {407#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {411#(and (= main_~main__sum~0 6) (<= 3 main_~main__n~0) (<= main_~main__i~0 4))} is VALID [2018-11-14 17:35:53,652 INFO L273 TraceCheckUtils]: 11: Hoare triple {411#(and (= main_~main__sum~0 6) (<= 3 main_~main__n~0) (<= main_~main__i~0 4))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {415#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:35:53,652 INFO L273 TraceCheckUtils]: 12: Hoare triple {415#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {374#false} is VALID [2018-11-14 17:35:53,653 INFO L273 TraceCheckUtils]: 13: Hoare triple {374#false} assume !false; {374#false} is VALID [2018-11-14 17:35:53,653 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:35:53,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:35:53,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-14 17:35:53,674 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-11-14 17:35:53,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:53,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 17:35:53,692 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:53,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 17:35:53,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 17:35:53,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:35:53,693 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 7 states. [2018-11-14 17:35:53,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:53,916 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-14 17:35:53,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:35:53,917 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-11-14 17:35:53,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:53,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:35:53,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2018-11-14 17:35:53,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:35:53,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2018-11-14 17:35:53,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 19 transitions. [2018-11-14 17:35:53,944 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:53,945 INFO L225 Difference]: With dead ends: 19 [2018-11-14 17:35:53,945 INFO L226 Difference]: Without dead ends: 16 [2018-11-14 17:35:53,946 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:35:53,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-14 17:35:53,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-14 17:35:53,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:53,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-14 17:35:53,966 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-14 17:35:53,967 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-14 17:35:53,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:53,969 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-14 17:35:53,970 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-14 17:35:53,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:53,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:53,970 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-14 17:35:53,971 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-14 17:35:53,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:53,972 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-14 17:35:53,972 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-14 17:35:53,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:53,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:53,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:53,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:53,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 17:35:53,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-14 17:35:53,975 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-11-14 17:35:53,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:53,975 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-14 17:35:53,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 17:35:53,975 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-14 17:35:53,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 17:35:53,976 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:53,976 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:53,976 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:53,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:53,977 INFO L82 PathProgramCache]: Analyzing trace with hash -484853433, now seen corresponding path program 4 times [2018-11-14 17:35:53,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:53,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:53,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:53,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:35:53,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:53,990 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:35:53,990 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:35:53,991 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:35:53,999 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:35:54,041 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:35:54,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:35:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:54,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:35:54,242 INFO L256 TraceCheckUtils]: 0: Hoare triple {508#true} call ULTIMATE.init(); {508#true} is VALID [2018-11-14 17:35:54,243 INFO L273 TraceCheckUtils]: 1: Hoare triple {508#true} ~__return_main~0 := 0;~__return_80~0 := 0; {508#true} is VALID [2018-11-14 17:35:54,244 INFO L273 TraceCheckUtils]: 2: Hoare triple {508#true} assume true; {508#true} is VALID [2018-11-14 17:35:54,244 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {508#true} {508#true} #28#return; {508#true} is VALID [2018-11-14 17:35:54,244 INFO L256 TraceCheckUtils]: 4: Hoare triple {508#true} call #t~ret2 := main(); {508#true} is VALID [2018-11-14 17:35:54,244 INFO L273 TraceCheckUtils]: 5: Hoare triple {508#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {508#true} is VALID [2018-11-14 17:35:54,245 INFO L273 TraceCheckUtils]: 6: Hoare triple {508#true} assume !!(1 <= ~main__n~0); {508#true} is VALID [2018-11-14 17:35:54,252 INFO L273 TraceCheckUtils]: 7: Hoare triple {508#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {534#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:35:54,254 INFO L273 TraceCheckUtils]: 8: Hoare triple {534#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {538#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-14 17:35:54,256 INFO L273 TraceCheckUtils]: 9: Hoare triple {538#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {542#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:35:54,256 INFO L273 TraceCheckUtils]: 10: Hoare triple {542#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {546#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:35:54,258 INFO L273 TraceCheckUtils]: 11: Hoare triple {546#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {550#(and (<= 4 main_~main__n~0) (= main_~main__sum~0 10) (<= main_~main__i~0 5))} is VALID [2018-11-14 17:35:54,264 INFO L273 TraceCheckUtils]: 12: Hoare triple {550#(and (<= 4 main_~main__n~0) (= main_~main__sum~0 10) (<= main_~main__i~0 5))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {554#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:35:54,266 INFO L273 TraceCheckUtils]: 13: Hoare triple {554#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {509#false} is VALID [2018-11-14 17:35:54,266 INFO L273 TraceCheckUtils]: 14: Hoare triple {509#false} assume !false; {509#false} is VALID [2018-11-14 17:35:54,267 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:35:54,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:35:54,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-14 17:35:54,288 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-11-14 17:35:54,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:54,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 17:35:54,315 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:54,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 17:35:54,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 17:35:54,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:35:54,316 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 8 states. [2018-11-14 17:35:54,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:54,582 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-14 17:35:54,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:35:54,582 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-11-14 17:35:54,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:54,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:35:54,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2018-11-14 17:35:54,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:35:54,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2018-11-14 17:35:54,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 20 transitions. [2018-11-14 17:35:54,681 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:54,682 INFO L225 Difference]: With dead ends: 20 [2018-11-14 17:35:54,682 INFO L226 Difference]: Without dead ends: 17 [2018-11-14 17:35:54,683 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:35:54,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-14 17:35:54,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-14 17:35:54,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:54,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-14 17:35:54,725 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-14 17:35:54,726 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-14 17:35:54,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:54,727 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-14 17:35:54,728 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-14 17:35:54,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:54,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:54,728 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-14 17:35:54,728 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-14 17:35:54,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:54,730 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-14 17:35:54,730 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-14 17:35:54,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:54,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:54,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:54,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:54,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 17:35:54,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-14 17:35:54,732 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-11-14 17:35:54,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:54,733 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-14 17:35:54,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 17:35:54,733 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-14 17:35:54,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 17:35:54,734 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:54,734 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:54,734 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:54,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:54,735 INFO L82 PathProgramCache]: Analyzing trace with hash -2145617008, now seen corresponding path program 5 times [2018-11-14 17:35:54,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:54,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:54,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:54,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:35:54,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:54,748 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:35:54,748 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:35:54,748 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:35:54,775 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:35:54,791 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-14 17:35:54,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:35:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:54,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:35:55,001 INFO L256 TraceCheckUtils]: 0: Hoare triple {653#true} call ULTIMATE.init(); {653#true} is VALID [2018-11-14 17:35:55,001 INFO L273 TraceCheckUtils]: 1: Hoare triple {653#true} ~__return_main~0 := 0;~__return_80~0 := 0; {653#true} is VALID [2018-11-14 17:35:55,002 INFO L273 TraceCheckUtils]: 2: Hoare triple {653#true} assume true; {653#true} is VALID [2018-11-14 17:35:55,002 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {653#true} {653#true} #28#return; {653#true} is VALID [2018-11-14 17:35:55,002 INFO L256 TraceCheckUtils]: 4: Hoare triple {653#true} call #t~ret2 := main(); {653#true} is VALID [2018-11-14 17:35:55,002 INFO L273 TraceCheckUtils]: 5: Hoare triple {653#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {653#true} is VALID [2018-11-14 17:35:55,003 INFO L273 TraceCheckUtils]: 6: Hoare triple {653#true} assume !!(1 <= ~main__n~0); {653#true} is VALID [2018-11-14 17:35:55,003 INFO L273 TraceCheckUtils]: 7: Hoare triple {653#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {679#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:35:55,004 INFO L273 TraceCheckUtils]: 8: Hoare triple {679#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {683#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:35:55,005 INFO L273 TraceCheckUtils]: 9: Hoare triple {683#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {687#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:35:55,006 INFO L273 TraceCheckUtils]: 10: Hoare triple {687#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {691#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:35:55,006 INFO L273 TraceCheckUtils]: 11: Hoare triple {691#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {695#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:35:55,007 INFO L273 TraceCheckUtils]: 12: Hoare triple {695#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {699#(and (<= main_~main__i~0 6) (= main_~main__sum~0 15) (<= 5 main_~main__n~0))} is VALID [2018-11-14 17:35:55,009 INFO L273 TraceCheckUtils]: 13: Hoare triple {699#(and (<= main_~main__i~0 6) (= main_~main__sum~0 15) (<= 5 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {703#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:35:55,010 INFO L273 TraceCheckUtils]: 14: Hoare triple {703#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {654#false} is VALID [2018-11-14 17:35:55,010 INFO L273 TraceCheckUtils]: 15: Hoare triple {654#false} assume !false; {654#false} is VALID [2018-11-14 17:35:55,012 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:35:55,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:35:55,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-11-14 17:35:55,033 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-11-14 17:35:55,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:55,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 17:35:55,051 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:55,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 17:35:55,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 17:35:55,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:35:55,052 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2018-11-14 17:35:55,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:55,478 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-14 17:35:55,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 17:35:55,478 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-11-14 17:35:55,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:55,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:35:55,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2018-11-14 17:35:55,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:35:55,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2018-11-14 17:35:55,482 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 21 transitions. [2018-11-14 17:35:55,520 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:55,521 INFO L225 Difference]: With dead ends: 21 [2018-11-14 17:35:55,521 INFO L226 Difference]: Without dead ends: 18 [2018-11-14 17:35:55,522 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:35:55,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-14 17:35:55,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-14 17:35:55,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:55,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-14 17:35:55,560 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-14 17:35:55,561 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-14 17:35:55,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:55,562 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-14 17:35:55,562 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-14 17:35:55,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:55,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:55,563 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-14 17:35:55,563 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-14 17:35:55,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:55,565 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-14 17:35:55,565 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-14 17:35:55,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:55,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:55,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:55,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:55,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:35:55,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-14 17:35:55,567 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-11-14 17:35:55,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:55,568 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-14 17:35:55,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 17:35:55,568 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-14 17:35:55,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 17:35:55,568 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:55,569 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:55,569 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:55,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:55,569 INFO L82 PathProgramCache]: Analyzing trace with hash -2089680281, now seen corresponding path program 6 times [2018-11-14 17:35:55,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:55,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:55,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:55,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:35:55,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:55,584 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:35:55,584 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:35:55,584 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:35:55,598 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:35:55,614 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-14 17:35:55,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:35:55,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:55,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:35:55,847 INFO L256 TraceCheckUtils]: 0: Hoare triple {808#true} call ULTIMATE.init(); {808#true} is VALID [2018-11-14 17:35:55,848 INFO L273 TraceCheckUtils]: 1: Hoare triple {808#true} ~__return_main~0 := 0;~__return_80~0 := 0; {808#true} is VALID [2018-11-14 17:35:55,848 INFO L273 TraceCheckUtils]: 2: Hoare triple {808#true} assume true; {808#true} is VALID [2018-11-14 17:35:55,849 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {808#true} {808#true} #28#return; {808#true} is VALID [2018-11-14 17:35:55,849 INFO L256 TraceCheckUtils]: 4: Hoare triple {808#true} call #t~ret2 := main(); {808#true} is VALID [2018-11-14 17:35:55,849 INFO L273 TraceCheckUtils]: 5: Hoare triple {808#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {808#true} is VALID [2018-11-14 17:35:55,850 INFO L273 TraceCheckUtils]: 6: Hoare triple {808#true} assume !!(1 <= ~main__n~0); {808#true} is VALID [2018-11-14 17:35:55,850 INFO L273 TraceCheckUtils]: 7: Hoare triple {808#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {834#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:35:55,851 INFO L273 TraceCheckUtils]: 8: Hoare triple {834#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {838#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-14 17:35:55,852 INFO L273 TraceCheckUtils]: 9: Hoare triple {838#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {842#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:35:55,853 INFO L273 TraceCheckUtils]: 10: Hoare triple {842#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {846#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:35:55,854 INFO L273 TraceCheckUtils]: 11: Hoare triple {846#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {850#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:35:55,855 INFO L273 TraceCheckUtils]: 12: Hoare triple {850#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {854#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:35:55,856 INFO L273 TraceCheckUtils]: 13: Hoare triple {854#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {858#(and (= main_~main__sum~0 21) (<= main_~main__i~0 7) (<= 6 main_~main__n~0))} is VALID [2018-11-14 17:35:55,857 INFO L273 TraceCheckUtils]: 14: Hoare triple {858#(and (= main_~main__sum~0 21) (<= main_~main__i~0 7) (<= 6 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {862#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:35:55,858 INFO L273 TraceCheckUtils]: 15: Hoare triple {862#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {809#false} is VALID [2018-11-14 17:35:55,859 INFO L273 TraceCheckUtils]: 16: Hoare triple {809#false} assume !false; {809#false} is VALID [2018-11-14 17:35:55,860 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:35:55,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:35:55,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-11-14 17:35:55,882 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-11-14 17:35:55,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:55,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 17:35:55,903 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:55,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 17:35:55,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 17:35:55,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:35:55,905 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 10 states. [2018-11-14 17:35:56,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:56,293 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-14 17:35:56,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 17:35:56,294 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-11-14 17:35:56,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:56,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:35:56,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 22 transitions. [2018-11-14 17:35:56,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:35:56,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 22 transitions. [2018-11-14 17:35:56,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 22 transitions. [2018-11-14 17:35:56,319 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:56,320 INFO L225 Difference]: With dead ends: 22 [2018-11-14 17:35:56,321 INFO L226 Difference]: Without dead ends: 19 [2018-11-14 17:35:56,321 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:35:56,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-14 17:35:56,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-14 17:35:56,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:56,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-14 17:35:56,346 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-14 17:35:56,346 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-14 17:35:56,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:56,348 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-14 17:35:56,349 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-14 17:35:56,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:56,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:56,349 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-14 17:35:56,350 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-14 17:35:56,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:56,351 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-14 17:35:56,351 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-14 17:35:56,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:56,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:56,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:56,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:56,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 17:35:56,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-14 17:35:56,354 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-11-14 17:35:56,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:56,354 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-11-14 17:35:56,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 17:35:56,354 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-14 17:35:56,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 17:35:56,355 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:56,355 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:56,355 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:56,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:56,356 INFO L82 PathProgramCache]: Analyzing trace with hash -355641744, now seen corresponding path program 7 times [2018-11-14 17:35:56,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:56,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:56,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:56,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:35:56,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:56,370 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:35:56,370 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:35:56,371 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:35:56,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:56,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:56,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:35:56,826 INFO L256 TraceCheckUtils]: 0: Hoare triple {973#true} call ULTIMATE.init(); {973#true} is VALID [2018-11-14 17:35:56,827 INFO L273 TraceCheckUtils]: 1: Hoare triple {973#true} ~__return_main~0 := 0;~__return_80~0 := 0; {973#true} is VALID [2018-11-14 17:35:56,827 INFO L273 TraceCheckUtils]: 2: Hoare triple {973#true} assume true; {973#true} is VALID [2018-11-14 17:35:56,827 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {973#true} {973#true} #28#return; {973#true} is VALID [2018-11-14 17:35:56,828 INFO L256 TraceCheckUtils]: 4: Hoare triple {973#true} call #t~ret2 := main(); {973#true} is VALID [2018-11-14 17:35:56,828 INFO L273 TraceCheckUtils]: 5: Hoare triple {973#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {973#true} is VALID [2018-11-14 17:35:56,828 INFO L273 TraceCheckUtils]: 6: Hoare triple {973#true} assume !!(1 <= ~main__n~0); {973#true} is VALID [2018-11-14 17:35:56,833 INFO L273 TraceCheckUtils]: 7: Hoare triple {973#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {999#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:35:56,834 INFO L273 TraceCheckUtils]: 8: Hoare triple {999#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1003#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:35:56,835 INFO L273 TraceCheckUtils]: 9: Hoare triple {1003#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1007#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:35:56,836 INFO L273 TraceCheckUtils]: 10: Hoare triple {1007#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1011#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:35:56,837 INFO L273 TraceCheckUtils]: 11: Hoare triple {1011#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1015#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:35:56,838 INFO L273 TraceCheckUtils]: 12: Hoare triple {1015#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1019#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:35:56,839 INFO L273 TraceCheckUtils]: 13: Hoare triple {1019#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1023#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:35:56,840 INFO L273 TraceCheckUtils]: 14: Hoare triple {1023#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1027#(and (<= main_~main__i~0 8) (<= 7 main_~main__n~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:35:56,841 INFO L273 TraceCheckUtils]: 15: Hoare triple {1027#(and (<= main_~main__i~0 8) (<= 7 main_~main__n~0) (= main_~main__sum~0 28))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1031#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:35:56,842 INFO L273 TraceCheckUtils]: 16: Hoare triple {1031#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {974#false} is VALID [2018-11-14 17:35:56,843 INFO L273 TraceCheckUtils]: 17: Hoare triple {974#false} assume !false; {974#false} is VALID [2018-11-14 17:35:56,845 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:35:56,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:35:56,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-11-14 17:35:56,866 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-11-14 17:35:56,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:56,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 17:35:56,885 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:56,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 17:35:56,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 17:35:56,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:35:56,886 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 11 states. [2018-11-14 17:35:57,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:57,309 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-14 17:35:57,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 17:35:57,309 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-11-14 17:35:57,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:57,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:35:57,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2018-11-14 17:35:57,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:35:57,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2018-11-14 17:35:57,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 23 transitions. [2018-11-14 17:35:57,342 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:57,343 INFO L225 Difference]: With dead ends: 23 [2018-11-14 17:35:57,343 INFO L226 Difference]: Without dead ends: 20 [2018-11-14 17:35:57,344 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:35:57,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-14 17:35:57,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-14 17:35:57,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:57,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-14 17:35:57,416 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-14 17:35:57,416 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-14 17:35:57,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:57,417 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-14 17:35:57,418 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-14 17:35:57,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:57,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:57,418 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-14 17:35:57,419 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-14 17:35:57,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:57,420 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-14 17:35:57,420 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-14 17:35:57,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:57,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:57,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:57,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:57,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 17:35:57,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-14 17:35:57,423 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-11-14 17:35:57,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:57,423 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-14 17:35:57,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 17:35:57,423 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-14 17:35:57,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 17:35:57,424 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:57,424 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:57,424 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:57,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:57,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1859945351, now seen corresponding path program 8 times [2018-11-14 17:35:57,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:57,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:57,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:57,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:57,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:57,444 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:35:57,444 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:35:57,449 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:35:57,491 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:35:57,515 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:35:57,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:35:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:57,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:35:57,864 INFO L256 TraceCheckUtils]: 0: Hoare triple {1148#true} call ULTIMATE.init(); {1148#true} is VALID [2018-11-14 17:35:57,864 INFO L273 TraceCheckUtils]: 1: Hoare triple {1148#true} ~__return_main~0 := 0;~__return_80~0 := 0; {1148#true} is VALID [2018-11-14 17:35:57,864 INFO L273 TraceCheckUtils]: 2: Hoare triple {1148#true} assume true; {1148#true} is VALID [2018-11-14 17:35:57,864 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1148#true} {1148#true} #28#return; {1148#true} is VALID [2018-11-14 17:35:57,865 INFO L256 TraceCheckUtils]: 4: Hoare triple {1148#true} call #t~ret2 := main(); {1148#true} is VALID [2018-11-14 17:35:57,865 INFO L273 TraceCheckUtils]: 5: Hoare triple {1148#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {1148#true} is VALID [2018-11-14 17:35:57,866 INFO L273 TraceCheckUtils]: 6: Hoare triple {1148#true} assume !!(1 <= ~main__n~0); {1148#true} is VALID [2018-11-14 17:35:57,880 INFO L273 TraceCheckUtils]: 7: Hoare triple {1148#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1174#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:35:57,882 INFO L273 TraceCheckUtils]: 8: Hoare triple {1174#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1178#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:35:57,883 INFO L273 TraceCheckUtils]: 9: Hoare triple {1178#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1182#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:35:57,884 INFO L273 TraceCheckUtils]: 10: Hoare triple {1182#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1186#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:35:57,884 INFO L273 TraceCheckUtils]: 11: Hoare triple {1186#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1190#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:35:57,889 INFO L273 TraceCheckUtils]: 12: Hoare triple {1190#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1194#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:35:57,890 INFO L273 TraceCheckUtils]: 13: Hoare triple {1194#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1198#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:35:57,890 INFO L273 TraceCheckUtils]: 14: Hoare triple {1198#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1202#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:35:57,891 INFO L273 TraceCheckUtils]: 15: Hoare triple {1202#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1206#(and (<= main_~main__i~0 9) (<= 8 main_~main__n~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:35:57,892 INFO L273 TraceCheckUtils]: 16: Hoare triple {1206#(and (<= main_~main__i~0 9) (<= 8 main_~main__n~0) (= main_~main__sum~0 36))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1210#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:35:57,893 INFO L273 TraceCheckUtils]: 17: Hoare triple {1210#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {1149#false} is VALID [2018-11-14 17:35:57,893 INFO L273 TraceCheckUtils]: 18: Hoare triple {1149#false} assume !false; {1149#false} is VALID [2018-11-14 17:35:57,895 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:35:57,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:35:57,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-11-14 17:35:57,922 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-11-14 17:35:57,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:57,922 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 17:35:57,947 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:57,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 17:35:57,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 17:35:57,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:35:57,948 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 12 states. [2018-11-14 17:35:58,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:58,675 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-14 17:35:58,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 17:35:58,675 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-11-14 17:35:58,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:58,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:35:58,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2018-11-14 17:35:58,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:35:58,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2018-11-14 17:35:58,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 24 transitions. [2018-11-14 17:35:58,708 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:58,709 INFO L225 Difference]: With dead ends: 24 [2018-11-14 17:35:58,709 INFO L226 Difference]: Without dead ends: 21 [2018-11-14 17:35:58,710 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-11-14 17:35:58,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-14 17:35:58,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-14 17:35:58,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:58,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-14 17:35:58,738 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-14 17:35:58,738 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-14 17:35:58,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:58,741 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-14 17:35:58,741 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-14 17:35:58,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:58,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:58,741 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-14 17:35:58,741 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-14 17:35:58,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:58,742 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-14 17:35:58,742 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-14 17:35:58,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:58,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:58,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:58,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:58,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 17:35:58,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-14 17:35:58,744 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-11-14 17:35:58,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:58,744 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-14 17:35:58,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 17:35:58,745 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-14 17:35:58,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 17:35:58,745 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:58,745 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:58,746 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:58,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:58,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1823668560, now seen corresponding path program 9 times [2018-11-14 17:35:58,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:58,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:58,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:58,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:35:58,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:58,759 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:35:58,759 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:35:58,759 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:35:58,773 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:35:58,793 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-14 17:35:58,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:35:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:58,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:35:59,011 INFO L256 TraceCheckUtils]: 0: Hoare triple {1333#true} call ULTIMATE.init(); {1333#true} is VALID [2018-11-14 17:35:59,012 INFO L273 TraceCheckUtils]: 1: Hoare triple {1333#true} ~__return_main~0 := 0;~__return_80~0 := 0; {1333#true} is VALID [2018-11-14 17:35:59,012 INFO L273 TraceCheckUtils]: 2: Hoare triple {1333#true} assume true; {1333#true} is VALID [2018-11-14 17:35:59,012 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1333#true} {1333#true} #28#return; {1333#true} is VALID [2018-11-14 17:35:59,013 INFO L256 TraceCheckUtils]: 4: Hoare triple {1333#true} call #t~ret2 := main(); {1333#true} is VALID [2018-11-14 17:35:59,013 INFO L273 TraceCheckUtils]: 5: Hoare triple {1333#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {1333#true} is VALID [2018-11-14 17:35:59,013 INFO L273 TraceCheckUtils]: 6: Hoare triple {1333#true} assume !!(1 <= ~main__n~0); {1333#true} is VALID [2018-11-14 17:35:59,014 INFO L273 TraceCheckUtils]: 7: Hoare triple {1333#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1359#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:35:59,015 INFO L273 TraceCheckUtils]: 8: Hoare triple {1359#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1363#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-14 17:35:59,015 INFO L273 TraceCheckUtils]: 9: Hoare triple {1363#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1367#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:35:59,016 INFO L273 TraceCheckUtils]: 10: Hoare triple {1367#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1371#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:35:59,017 INFO L273 TraceCheckUtils]: 11: Hoare triple {1371#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1375#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:35:59,018 INFO L273 TraceCheckUtils]: 12: Hoare triple {1375#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1379#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:35:59,019 INFO L273 TraceCheckUtils]: 13: Hoare triple {1379#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1383#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:35:59,020 INFO L273 TraceCheckUtils]: 14: Hoare triple {1383#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1387#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:35:59,021 INFO L273 TraceCheckUtils]: 15: Hoare triple {1387#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1391#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:35:59,022 INFO L273 TraceCheckUtils]: 16: Hoare triple {1391#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1395#(and (= main_~main__sum~0 45) (<= 9 main_~main__n~0) (<= main_~main__i~0 10))} is VALID [2018-11-14 17:35:59,023 INFO L273 TraceCheckUtils]: 17: Hoare triple {1395#(and (= main_~main__sum~0 45) (<= 9 main_~main__n~0) (<= main_~main__i~0 10))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1399#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:35:59,024 INFO L273 TraceCheckUtils]: 18: Hoare triple {1399#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {1334#false} is VALID [2018-11-14 17:35:59,025 INFO L273 TraceCheckUtils]: 19: Hoare triple {1334#false} assume !false; {1334#false} is VALID [2018-11-14 17:35:59,026 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:35:59,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:35:59,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-11-14 17:35:59,047 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-11-14 17:35:59,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:59,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 17:35:59,067 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:59,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 17:35:59,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 17:35:59,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-14 17:35:59,069 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 13 states. [2018-11-14 17:35:59,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:59,579 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-14 17:35:59,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 17:35:59,580 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-11-14 17:35:59,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:59,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 17:35:59,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2018-11-14 17:35:59,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 17:35:59,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2018-11-14 17:35:59,583 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 25 transitions. [2018-11-14 17:35:59,646 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:59,647 INFO L225 Difference]: With dead ends: 25 [2018-11-14 17:35:59,647 INFO L226 Difference]: Without dead ends: 22 [2018-11-14 17:35:59,647 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:35:59,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-14 17:35:59,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-14 17:35:59,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:59,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-14 17:35:59,739 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 17:35:59,739 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 17:35:59,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:59,740 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-14 17:35:59,741 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-14 17:35:59,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:59,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:59,741 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 17:35:59,741 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 17:35:59,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:59,742 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-14 17:35:59,742 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-14 17:35:59,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:59,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:59,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:59,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:59,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 17:35:59,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-14 17:35:59,744 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-11-14 17:35:59,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:59,745 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-14 17:35:59,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 17:35:59,745 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-14 17:35:59,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 17:35:59,745 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:59,746 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:59,746 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:59,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:59,746 INFO L82 PathProgramCache]: Analyzing trace with hash 699088039, now seen corresponding path program 10 times [2018-11-14 17:35:59,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:59,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:59,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:59,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:35:59,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:59,759 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:35:59,759 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:35:59,759 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:35:59,783 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:35:59,870 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:35:59,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:35:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:59,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:00,162 INFO L256 TraceCheckUtils]: 0: Hoare triple {1528#true} call ULTIMATE.init(); {1528#true} is VALID [2018-11-14 17:36:00,163 INFO L273 TraceCheckUtils]: 1: Hoare triple {1528#true} ~__return_main~0 := 0;~__return_80~0 := 0; {1528#true} is VALID [2018-11-14 17:36:00,163 INFO L273 TraceCheckUtils]: 2: Hoare triple {1528#true} assume true; {1528#true} is VALID [2018-11-14 17:36:00,163 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1528#true} {1528#true} #28#return; {1528#true} is VALID [2018-11-14 17:36:00,163 INFO L256 TraceCheckUtils]: 4: Hoare triple {1528#true} call #t~ret2 := main(); {1528#true} is VALID [2018-11-14 17:36:00,164 INFO L273 TraceCheckUtils]: 5: Hoare triple {1528#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {1528#true} is VALID [2018-11-14 17:36:00,164 INFO L273 TraceCheckUtils]: 6: Hoare triple {1528#true} assume !!(1 <= ~main__n~0); {1528#true} is VALID [2018-11-14 17:36:00,165 INFO L273 TraceCheckUtils]: 7: Hoare triple {1528#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1554#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:00,165 INFO L273 TraceCheckUtils]: 8: Hoare triple {1554#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1558#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-14 17:36:00,166 INFO L273 TraceCheckUtils]: 9: Hoare triple {1558#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1562#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:00,166 INFO L273 TraceCheckUtils]: 10: Hoare triple {1562#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1566#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:00,167 INFO L273 TraceCheckUtils]: 11: Hoare triple {1566#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1570#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:00,168 INFO L273 TraceCheckUtils]: 12: Hoare triple {1570#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1574#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:00,169 INFO L273 TraceCheckUtils]: 13: Hoare triple {1574#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1578#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:00,169 INFO L273 TraceCheckUtils]: 14: Hoare triple {1578#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1582#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:00,170 INFO L273 TraceCheckUtils]: 15: Hoare triple {1582#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1586#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:00,171 INFO L273 TraceCheckUtils]: 16: Hoare triple {1586#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1590#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:00,172 INFO L273 TraceCheckUtils]: 17: Hoare triple {1590#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1594#(and (= main_~main__sum~0 55) (<= main_~main__i~0 11) (<= 10 main_~main__n~0))} is VALID [2018-11-14 17:36:00,174 INFO L273 TraceCheckUtils]: 18: Hoare triple {1594#(and (= main_~main__sum~0 55) (<= main_~main__i~0 11) (<= 10 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1598#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:00,175 INFO L273 TraceCheckUtils]: 19: Hoare triple {1598#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {1529#false} is VALID [2018-11-14 17:36:00,175 INFO L273 TraceCheckUtils]: 20: Hoare triple {1529#false} assume !false; {1529#false} is VALID [2018-11-14 17:36:00,176 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:00,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:00,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-11-14 17:36:00,197 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2018-11-14 17:36:00,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:00,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 17:36:00,217 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:00,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 17:36:00,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 17:36:00,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:36:00,218 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 14 states. [2018-11-14 17:36:00,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:00,739 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-14 17:36:00,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 17:36:00,740 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2018-11-14 17:36:00,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:00,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:36:00,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 26 transitions. [2018-11-14 17:36:00,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:36:00,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 26 transitions. [2018-11-14 17:36:00,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 26 transitions. [2018-11-14 17:36:00,861 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:00,862 INFO L225 Difference]: With dead ends: 26 [2018-11-14 17:36:00,862 INFO L226 Difference]: Without dead ends: 23 [2018-11-14 17:36:00,863 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-11-14 17:36:00,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-14 17:36:00,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-14 17:36:00,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:00,902 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2018-11-14 17:36:00,902 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-14 17:36:00,902 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-14 17:36:00,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:00,903 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-14 17:36:00,903 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-14 17:36:00,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:00,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:00,904 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-14 17:36:00,904 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-14 17:36:00,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:00,905 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-14 17:36:00,905 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-14 17:36:00,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:00,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:00,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:00,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:00,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 17:36:00,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-11-14 17:36:00,907 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-11-14 17:36:00,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:00,907 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-11-14 17:36:00,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 17:36:00,907 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-14 17:36:00,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 17:36:00,908 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:00,908 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:00,908 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:00,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:00,908 INFO L82 PathProgramCache]: Analyzing trace with hash 196830256, now seen corresponding path program 11 times [2018-11-14 17:36:00,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:00,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:00,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:00,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:00,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:00,925 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:00,925 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:00,925 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:00,938 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:36:00,959 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-14 17:36:00,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:00,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:02,751 INFO L256 TraceCheckUtils]: 0: Hoare triple {1733#true} call ULTIMATE.init(); {1733#true} is VALID [2018-11-14 17:36:02,752 INFO L273 TraceCheckUtils]: 1: Hoare triple {1733#true} ~__return_main~0 := 0;~__return_80~0 := 0; {1733#true} is VALID [2018-11-14 17:36:02,752 INFO L273 TraceCheckUtils]: 2: Hoare triple {1733#true} assume true; {1733#true} is VALID [2018-11-14 17:36:02,753 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1733#true} {1733#true} #28#return; {1733#true} is VALID [2018-11-14 17:36:02,753 INFO L256 TraceCheckUtils]: 4: Hoare triple {1733#true} call #t~ret2 := main(); {1733#true} is VALID [2018-11-14 17:36:02,753 INFO L273 TraceCheckUtils]: 5: Hoare triple {1733#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {1733#true} is VALID [2018-11-14 17:36:02,753 INFO L273 TraceCheckUtils]: 6: Hoare triple {1733#true} assume !!(1 <= ~main__n~0); {1733#true} is VALID [2018-11-14 17:36:02,754 INFO L273 TraceCheckUtils]: 7: Hoare triple {1733#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1759#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:02,755 INFO L273 TraceCheckUtils]: 8: Hoare triple {1759#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1763#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-14 17:36:02,755 INFO L273 TraceCheckUtils]: 9: Hoare triple {1763#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1767#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:02,756 INFO L273 TraceCheckUtils]: 10: Hoare triple {1767#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1771#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:02,757 INFO L273 TraceCheckUtils]: 11: Hoare triple {1771#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1775#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:02,757 INFO L273 TraceCheckUtils]: 12: Hoare triple {1775#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1779#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:02,758 INFO L273 TraceCheckUtils]: 13: Hoare triple {1779#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1783#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:02,759 INFO L273 TraceCheckUtils]: 14: Hoare triple {1783#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1787#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:02,760 INFO L273 TraceCheckUtils]: 15: Hoare triple {1787#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1791#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:02,762 INFO L273 TraceCheckUtils]: 16: Hoare triple {1791#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1795#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:02,763 INFO L273 TraceCheckUtils]: 17: Hoare triple {1795#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1799#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:02,763 INFO L273 TraceCheckUtils]: 18: Hoare triple {1799#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1803#(and (= main_~main__sum~0 66) (<= main_~main__i~0 12) (<= 11 main_~main__n~0))} is VALID [2018-11-14 17:36:02,764 INFO L273 TraceCheckUtils]: 19: Hoare triple {1803#(and (= main_~main__sum~0 66) (<= main_~main__i~0 12) (<= 11 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1807#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:02,765 INFO L273 TraceCheckUtils]: 20: Hoare triple {1807#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {1734#false} is VALID [2018-11-14 17:36:02,765 INFO L273 TraceCheckUtils]: 21: Hoare triple {1734#false} assume !false; {1734#false} is VALID [2018-11-14 17:36:02,767 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:02,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:02,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-11-14 17:36:02,787 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-11-14 17:36:02,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:02,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 17:36:02,808 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:02,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 17:36:02,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 17:36:02,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-14 17:36:02,809 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 15 states. [2018-11-14 17:36:03,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:03,629 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-14 17:36:03,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-14 17:36:03,630 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-11-14 17:36:03,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:03,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 17:36:03,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-11-14 17:36:03,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 17:36:03,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-11-14 17:36:03,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 27 transitions. [2018-11-14 17:36:03,687 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:03,688 INFO L225 Difference]: With dead ends: 27 [2018-11-14 17:36:03,688 INFO L226 Difference]: Without dead ends: 24 [2018-11-14 17:36:03,689 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-11-14 17:36:03,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-14 17:36:03,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-14 17:36:03,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:03,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-14 17:36:03,734 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 17:36:03,735 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 17:36:03,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:03,735 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-14 17:36:03,736 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-14 17:36:03,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:03,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:03,736 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 17:36:03,736 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 17:36:03,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:03,737 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-14 17:36:03,737 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-14 17:36:03,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:03,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:03,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:03,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:03,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 17:36:03,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-14 17:36:03,739 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-11-14 17:36:03,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:03,739 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-14 17:36:03,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 17:36:03,739 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-14 17:36:03,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 17:36:03,740 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:03,740 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:03,740 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:03,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:03,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1806708167, now seen corresponding path program 12 times [2018-11-14 17:36:03,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:03,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:03,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:03,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:03,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:03,752 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:03,752 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:03,752 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:03,772 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:36:03,794 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-14 17:36:03,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:03,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:04,434 INFO L256 TraceCheckUtils]: 0: Hoare triple {1948#true} call ULTIMATE.init(); {1948#true} is VALID [2018-11-14 17:36:04,434 INFO L273 TraceCheckUtils]: 1: Hoare triple {1948#true} ~__return_main~0 := 0;~__return_80~0 := 0; {1948#true} is VALID [2018-11-14 17:36:04,435 INFO L273 TraceCheckUtils]: 2: Hoare triple {1948#true} assume true; {1948#true} is VALID [2018-11-14 17:36:04,435 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1948#true} {1948#true} #28#return; {1948#true} is VALID [2018-11-14 17:36:04,435 INFO L256 TraceCheckUtils]: 4: Hoare triple {1948#true} call #t~ret2 := main(); {1948#true} is VALID [2018-11-14 17:36:04,435 INFO L273 TraceCheckUtils]: 5: Hoare triple {1948#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {1948#true} is VALID [2018-11-14 17:36:04,436 INFO L273 TraceCheckUtils]: 6: Hoare triple {1948#true} assume !!(1 <= ~main__n~0); {1948#true} is VALID [2018-11-14 17:36:04,442 INFO L273 TraceCheckUtils]: 7: Hoare triple {1948#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1974#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:04,442 INFO L273 TraceCheckUtils]: 8: Hoare triple {1974#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1978#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-14 17:36:04,443 INFO L273 TraceCheckUtils]: 9: Hoare triple {1978#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1982#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:04,444 INFO L273 TraceCheckUtils]: 10: Hoare triple {1982#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1986#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:04,444 INFO L273 TraceCheckUtils]: 11: Hoare triple {1986#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1990#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:04,445 INFO L273 TraceCheckUtils]: 12: Hoare triple {1990#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1994#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:04,445 INFO L273 TraceCheckUtils]: 13: Hoare triple {1994#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1998#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:04,446 INFO L273 TraceCheckUtils]: 14: Hoare triple {1998#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2002#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:04,447 INFO L273 TraceCheckUtils]: 15: Hoare triple {2002#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2006#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:04,448 INFO L273 TraceCheckUtils]: 16: Hoare triple {2006#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2010#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:04,449 INFO L273 TraceCheckUtils]: 17: Hoare triple {2010#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2014#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:04,450 INFO L273 TraceCheckUtils]: 18: Hoare triple {2014#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2018#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:36:04,451 INFO L273 TraceCheckUtils]: 19: Hoare triple {2018#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2022#(and (= main_~main__sum~0 78) (<= main_~main__i~0 13) (<= 12 main_~main__n~0))} is VALID [2018-11-14 17:36:04,452 INFO L273 TraceCheckUtils]: 20: Hoare triple {2022#(and (= main_~main__sum~0 78) (<= main_~main__i~0 13) (<= 12 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2026#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:04,453 INFO L273 TraceCheckUtils]: 21: Hoare triple {2026#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {1949#false} is VALID [2018-11-14 17:36:04,453 INFO L273 TraceCheckUtils]: 22: Hoare triple {1949#false} assume !false; {1949#false} is VALID [2018-11-14 17:36:04,455 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:04,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:04,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-11-14 17:36:04,476 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-11-14 17:36:04,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:04,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 17:36:04,501 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:04,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 17:36:04,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 17:36:04,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-11-14 17:36:04,502 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 16 states. [2018-11-14 17:36:05,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:05,409 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-14 17:36:05,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 17:36:05,410 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-11-14 17:36:05,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:05,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 17:36:05,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 28 transitions. [2018-11-14 17:36:05,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 17:36:05,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 28 transitions. [2018-11-14 17:36:05,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 28 transitions. [2018-11-14 17:36:05,449 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:05,450 INFO L225 Difference]: With dead ends: 28 [2018-11-14 17:36:05,450 INFO L226 Difference]: Without dead ends: 25 [2018-11-14 17:36:05,451 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-11-14 17:36:05,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-14 17:36:05,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-14 17:36:05,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:05,662 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-14 17:36:05,662 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-14 17:36:05,662 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-14 17:36:05,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:05,664 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-14 17:36:05,664 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-14 17:36:05,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:05,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:05,667 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-14 17:36:05,667 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-14 17:36:05,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:05,668 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-14 17:36:05,668 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-14 17:36:05,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:05,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:05,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:05,669 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:05,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 17:36:05,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-11-14 17:36:05,669 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-11-14 17:36:05,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:05,670 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-11-14 17:36:05,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 17:36:05,670 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-14 17:36:05,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 17:36:05,670 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:05,670 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:05,671 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:05,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:05,671 INFO L82 PathProgramCache]: Analyzing trace with hash 173315856, now seen corresponding path program 13 times [2018-11-14 17:36:05,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:05,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:05,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:05,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:05,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:05,684 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:05,684 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:05,684 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:05,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:36:05,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:05,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:06,101 INFO L256 TraceCheckUtils]: 0: Hoare triple {2173#true} call ULTIMATE.init(); {2173#true} is VALID [2018-11-14 17:36:06,101 INFO L273 TraceCheckUtils]: 1: Hoare triple {2173#true} ~__return_main~0 := 0;~__return_80~0 := 0; {2173#true} is VALID [2018-11-14 17:36:06,102 INFO L273 TraceCheckUtils]: 2: Hoare triple {2173#true} assume true; {2173#true} is VALID [2018-11-14 17:36:06,102 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2173#true} {2173#true} #28#return; {2173#true} is VALID [2018-11-14 17:36:06,102 INFO L256 TraceCheckUtils]: 4: Hoare triple {2173#true} call #t~ret2 := main(); {2173#true} is VALID [2018-11-14 17:36:06,102 INFO L273 TraceCheckUtils]: 5: Hoare triple {2173#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {2173#true} is VALID [2018-11-14 17:36:06,103 INFO L273 TraceCheckUtils]: 6: Hoare triple {2173#true} assume !!(1 <= ~main__n~0); {2173#true} is VALID [2018-11-14 17:36:06,103 INFO L273 TraceCheckUtils]: 7: Hoare triple {2173#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2199#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:06,104 INFO L273 TraceCheckUtils]: 8: Hoare triple {2199#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2203#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:36:06,105 INFO L273 TraceCheckUtils]: 9: Hoare triple {2203#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2207#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:06,106 INFO L273 TraceCheckUtils]: 10: Hoare triple {2207#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2211#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:06,107 INFO L273 TraceCheckUtils]: 11: Hoare triple {2211#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2215#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:06,108 INFO L273 TraceCheckUtils]: 12: Hoare triple {2215#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2219#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:06,109 INFO L273 TraceCheckUtils]: 13: Hoare triple {2219#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2223#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:06,109 INFO L273 TraceCheckUtils]: 14: Hoare triple {2223#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2227#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:06,110 INFO L273 TraceCheckUtils]: 15: Hoare triple {2227#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2231#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:06,111 INFO L273 TraceCheckUtils]: 16: Hoare triple {2231#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2235#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:06,112 INFO L273 TraceCheckUtils]: 17: Hoare triple {2235#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2239#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:06,113 INFO L273 TraceCheckUtils]: 18: Hoare triple {2239#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2243#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:36:06,114 INFO L273 TraceCheckUtils]: 19: Hoare triple {2243#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2247#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:36:06,115 INFO L273 TraceCheckUtils]: 20: Hoare triple {2247#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2251#(and (<= main_~main__i~0 14) (= main_~main__sum~0 91) (<= 13 main_~main__n~0))} is VALID [2018-11-14 17:36:06,116 INFO L273 TraceCheckUtils]: 21: Hoare triple {2251#(and (<= main_~main__i~0 14) (= main_~main__sum~0 91) (<= 13 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2255#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:06,117 INFO L273 TraceCheckUtils]: 22: Hoare triple {2255#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {2174#false} is VALID [2018-11-14 17:36:06,117 INFO L273 TraceCheckUtils]: 23: Hoare triple {2174#false} assume !false; {2174#false} is VALID [2018-11-14 17:36:06,119 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:06,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:06,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-11-14 17:36:06,140 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2018-11-14 17:36:06,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:06,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 17:36:06,164 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:06,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 17:36:06,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 17:36:06,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-11-14 17:36:06,165 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 17 states. [2018-11-14 17:36:06,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:06,885 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-14 17:36:06,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 17:36:06,886 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2018-11-14 17:36:06,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:06,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 17:36:06,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. [2018-11-14 17:36:06,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 17:36:06,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. [2018-11-14 17:36:06,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 29 transitions. [2018-11-14 17:36:06,919 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:06,920 INFO L225 Difference]: With dead ends: 29 [2018-11-14 17:36:06,920 INFO L226 Difference]: Without dead ends: 26 [2018-11-14 17:36:06,921 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-11-14 17:36:06,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-14 17:36:06,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-14 17:36:06,982 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:06,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-14 17:36:06,982 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-14 17:36:06,983 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-14 17:36:06,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:06,983 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-14 17:36:06,984 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-14 17:36:06,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:06,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:06,984 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-14 17:36:06,984 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-14 17:36:06,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:06,985 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-14 17:36:06,985 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-14 17:36:06,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:06,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:06,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:06,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:06,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 17:36:06,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-11-14 17:36:06,987 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-11-14 17:36:06,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:06,987 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-11-14 17:36:06,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 17:36:06,988 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-14 17:36:06,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 17:36:06,988 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:06,988 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:06,988 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:06,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:06,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1077761767, now seen corresponding path program 14 times [2018-11-14 17:36:06,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:06,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:06,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:06,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:36:06,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:06,999 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:06,999 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:06,999 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:07,012 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:36:07,033 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:36:07,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:07,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:07,413 INFO L256 TraceCheckUtils]: 0: Hoare triple {2408#true} call ULTIMATE.init(); {2408#true} is VALID [2018-11-14 17:36:07,413 INFO L273 TraceCheckUtils]: 1: Hoare triple {2408#true} ~__return_main~0 := 0;~__return_80~0 := 0; {2408#true} is VALID [2018-11-14 17:36:07,414 INFO L273 TraceCheckUtils]: 2: Hoare triple {2408#true} assume true; {2408#true} is VALID [2018-11-14 17:36:07,414 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2408#true} {2408#true} #28#return; {2408#true} is VALID [2018-11-14 17:36:07,414 INFO L256 TraceCheckUtils]: 4: Hoare triple {2408#true} call #t~ret2 := main(); {2408#true} is VALID [2018-11-14 17:36:07,414 INFO L273 TraceCheckUtils]: 5: Hoare triple {2408#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {2408#true} is VALID [2018-11-14 17:36:07,415 INFO L273 TraceCheckUtils]: 6: Hoare triple {2408#true} assume !!(1 <= ~main__n~0); {2408#true} is VALID [2018-11-14 17:36:07,416 INFO L273 TraceCheckUtils]: 7: Hoare triple {2408#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2434#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:07,418 INFO L273 TraceCheckUtils]: 8: Hoare triple {2434#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2438#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:36:07,420 INFO L273 TraceCheckUtils]: 9: Hoare triple {2438#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2442#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:07,423 INFO L273 TraceCheckUtils]: 10: Hoare triple {2442#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2446#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:07,425 INFO L273 TraceCheckUtils]: 11: Hoare triple {2446#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2450#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:07,426 INFO L273 TraceCheckUtils]: 12: Hoare triple {2450#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2454#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:07,426 INFO L273 TraceCheckUtils]: 13: Hoare triple {2454#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2458#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:07,427 INFO L273 TraceCheckUtils]: 14: Hoare triple {2458#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2462#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:07,428 INFO L273 TraceCheckUtils]: 15: Hoare triple {2462#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2466#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:07,429 INFO L273 TraceCheckUtils]: 16: Hoare triple {2466#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2470#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:07,430 INFO L273 TraceCheckUtils]: 17: Hoare triple {2470#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2474#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:07,431 INFO L273 TraceCheckUtils]: 18: Hoare triple {2474#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2478#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:36:07,435 INFO L273 TraceCheckUtils]: 19: Hoare triple {2478#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2482#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:36:07,436 INFO L273 TraceCheckUtils]: 20: Hoare triple {2482#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2486#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:36:07,436 INFO L273 TraceCheckUtils]: 21: Hoare triple {2486#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2490#(and (<= main_~main__i~0 15) (= main_~main__sum~0 105) (<= 14 main_~main__n~0))} is VALID [2018-11-14 17:36:07,438 INFO L273 TraceCheckUtils]: 22: Hoare triple {2490#(and (<= main_~main__i~0 15) (= main_~main__sum~0 105) (<= 14 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2494#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:07,438 INFO L273 TraceCheckUtils]: 23: Hoare triple {2494#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {2409#false} is VALID [2018-11-14 17:36:07,439 INFO L273 TraceCheckUtils]: 24: Hoare triple {2409#false} assume !false; {2409#false} is VALID [2018-11-14 17:36:07,440 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:07,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:07,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-11-14 17:36:07,462 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2018-11-14 17:36:07,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:07,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 17:36:07,560 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:07,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 17:36:07,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 17:36:07,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-11-14 17:36:07,561 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 18 states. [2018-11-14 17:36:08,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:08,388 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-14 17:36:08,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-14 17:36:08,389 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2018-11-14 17:36:08,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:08,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:36:08,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 30 transitions. [2018-11-14 17:36:08,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:36:08,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 30 transitions. [2018-11-14 17:36:08,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 30 transitions. [2018-11-14 17:36:08,424 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:08,425 INFO L225 Difference]: With dead ends: 30 [2018-11-14 17:36:08,425 INFO L226 Difference]: Without dead ends: 27 [2018-11-14 17:36:08,426 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2018-11-14 17:36:08,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-14 17:36:08,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-14 17:36:08,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:08,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-14 17:36:08,470 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-14 17:36:08,470 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-14 17:36:08,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:08,472 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-14 17:36:08,472 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-14 17:36:08,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:08,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:08,473 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-14 17:36:08,473 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-14 17:36:08,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:08,473 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-14 17:36:08,474 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-14 17:36:08,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:08,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:08,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:08,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:08,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 17:36:08,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-14 17:36:08,475 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-11-14 17:36:08,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:08,475 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-14 17:36:08,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 17:36:08,476 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-14 17:36:08,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 17:36:08,476 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:08,476 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:08,477 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:08,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:08,477 INFO L82 PathProgramCache]: Analyzing trace with hash -949186064, now seen corresponding path program 15 times [2018-11-14 17:36:08,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:08,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:08,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:08,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:08,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:08,487 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:08,487 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:08,487 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:08,500 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:36:08,551 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-14 17:36:08,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:08,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:09,103 INFO L256 TraceCheckUtils]: 0: Hoare triple {2653#true} call ULTIMATE.init(); {2653#true} is VALID [2018-11-14 17:36:09,103 INFO L273 TraceCheckUtils]: 1: Hoare triple {2653#true} ~__return_main~0 := 0;~__return_80~0 := 0; {2653#true} is VALID [2018-11-14 17:36:09,104 INFO L273 TraceCheckUtils]: 2: Hoare triple {2653#true} assume true; {2653#true} is VALID [2018-11-14 17:36:09,104 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2653#true} {2653#true} #28#return; {2653#true} is VALID [2018-11-14 17:36:09,104 INFO L256 TraceCheckUtils]: 4: Hoare triple {2653#true} call #t~ret2 := main(); {2653#true} is VALID [2018-11-14 17:36:09,104 INFO L273 TraceCheckUtils]: 5: Hoare triple {2653#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {2653#true} is VALID [2018-11-14 17:36:09,104 INFO L273 TraceCheckUtils]: 6: Hoare triple {2653#true} assume !!(1 <= ~main__n~0); {2653#true} is VALID [2018-11-14 17:36:09,105 INFO L273 TraceCheckUtils]: 7: Hoare triple {2653#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2679#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:09,105 INFO L273 TraceCheckUtils]: 8: Hoare triple {2679#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2683#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:36:09,106 INFO L273 TraceCheckUtils]: 9: Hoare triple {2683#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2687#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:09,106 INFO L273 TraceCheckUtils]: 10: Hoare triple {2687#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2691#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:09,107 INFO L273 TraceCheckUtils]: 11: Hoare triple {2691#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2695#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:09,107 INFO L273 TraceCheckUtils]: 12: Hoare triple {2695#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2699#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:09,108 INFO L273 TraceCheckUtils]: 13: Hoare triple {2699#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2703#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:09,109 INFO L273 TraceCheckUtils]: 14: Hoare triple {2703#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2707#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:09,110 INFO L273 TraceCheckUtils]: 15: Hoare triple {2707#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2711#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:09,111 INFO L273 TraceCheckUtils]: 16: Hoare triple {2711#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2715#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:09,112 INFO L273 TraceCheckUtils]: 17: Hoare triple {2715#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2719#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:09,113 INFO L273 TraceCheckUtils]: 18: Hoare triple {2719#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2723#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:36:09,114 INFO L273 TraceCheckUtils]: 19: Hoare triple {2723#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2727#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:36:09,115 INFO L273 TraceCheckUtils]: 20: Hoare triple {2727#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2731#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:36:09,116 INFO L273 TraceCheckUtils]: 21: Hoare triple {2731#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2735#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:36:09,117 INFO L273 TraceCheckUtils]: 22: Hoare triple {2735#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2739#(and (<= 15 main_~main__n~0) (<= main_~main__i~0 16) (= main_~main__sum~0 120))} is VALID [2018-11-14 17:36:09,119 INFO L273 TraceCheckUtils]: 23: Hoare triple {2739#(and (<= 15 main_~main__n~0) (<= main_~main__i~0 16) (= main_~main__sum~0 120))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2743#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:09,119 INFO L273 TraceCheckUtils]: 24: Hoare triple {2743#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {2654#false} is VALID [2018-11-14 17:36:09,120 INFO L273 TraceCheckUtils]: 25: Hoare triple {2654#false} assume !false; {2654#false} is VALID [2018-11-14 17:36:09,121 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:09,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:09,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-11-14 17:36:09,143 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 26 [2018-11-14 17:36:09,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:09,143 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-14 17:36:09,168 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:09,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-14 17:36:09,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-14 17:36:09,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-11-14 17:36:09,169 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 19 states. [2018-11-14 17:36:10,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:10,194 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-14 17:36:10,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-14 17:36:10,195 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 26 [2018-11-14 17:36:10,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:10,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 17:36:10,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 31 transitions. [2018-11-14 17:36:10,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 17:36:10,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 31 transitions. [2018-11-14 17:36:10,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 31 transitions. [2018-11-14 17:36:10,250 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:10,251 INFO L225 Difference]: With dead ends: 31 [2018-11-14 17:36:10,251 INFO L226 Difference]: Without dead ends: 28 [2018-11-14 17:36:10,252 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2018-11-14 17:36:10,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-14 17:36:10,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-14 17:36:10,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:10,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-14 17:36:10,300 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 17:36:10,301 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 17:36:10,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:10,302 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-14 17:36:10,302 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-14 17:36:10,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:10,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:10,303 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 17:36:10,303 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 17:36:10,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:10,304 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-14 17:36:10,304 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-14 17:36:10,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:10,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:10,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:10,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:10,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 17:36:10,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-11-14 17:36:10,309 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-11-14 17:36:10,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:10,309 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-11-14 17:36:10,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-14 17:36:10,309 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-14 17:36:10,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 17:36:10,310 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:10,310 INFO L375 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:10,310 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:10,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:10,310 INFO L82 PathProgramCache]: Analyzing trace with hash 639940615, now seen corresponding path program 16 times [2018-11-14 17:36:10,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:10,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:10,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:10,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:10,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:10,328 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:10,328 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:10,328 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:10,340 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:36:10,454 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:36:10,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:10,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:10,841 INFO L256 TraceCheckUtils]: 0: Hoare triple {2908#true} call ULTIMATE.init(); {2908#true} is VALID [2018-11-14 17:36:10,842 INFO L273 TraceCheckUtils]: 1: Hoare triple {2908#true} ~__return_main~0 := 0;~__return_80~0 := 0; {2908#true} is VALID [2018-11-14 17:36:10,842 INFO L273 TraceCheckUtils]: 2: Hoare triple {2908#true} assume true; {2908#true} is VALID [2018-11-14 17:36:10,842 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2908#true} {2908#true} #28#return; {2908#true} is VALID [2018-11-14 17:36:10,842 INFO L256 TraceCheckUtils]: 4: Hoare triple {2908#true} call #t~ret2 := main(); {2908#true} is VALID [2018-11-14 17:36:10,843 INFO L273 TraceCheckUtils]: 5: Hoare triple {2908#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {2908#true} is VALID [2018-11-14 17:36:10,843 INFO L273 TraceCheckUtils]: 6: Hoare triple {2908#true} assume !!(1 <= ~main__n~0); {2908#true} is VALID [2018-11-14 17:36:10,860 INFO L273 TraceCheckUtils]: 7: Hoare triple {2908#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2934#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:10,860 INFO L273 TraceCheckUtils]: 8: Hoare triple {2934#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2938#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:36:10,861 INFO L273 TraceCheckUtils]: 9: Hoare triple {2938#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2942#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:10,862 INFO L273 TraceCheckUtils]: 10: Hoare triple {2942#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2946#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:10,863 INFO L273 TraceCheckUtils]: 11: Hoare triple {2946#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2950#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:10,864 INFO L273 TraceCheckUtils]: 12: Hoare triple {2950#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2954#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:10,871 INFO L273 TraceCheckUtils]: 13: Hoare triple {2954#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2958#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:10,872 INFO L273 TraceCheckUtils]: 14: Hoare triple {2958#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2962#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:10,872 INFO L273 TraceCheckUtils]: 15: Hoare triple {2962#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2966#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:10,873 INFO L273 TraceCheckUtils]: 16: Hoare triple {2966#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2970#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:10,875 INFO L273 TraceCheckUtils]: 17: Hoare triple {2970#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2974#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:10,876 INFO L273 TraceCheckUtils]: 18: Hoare triple {2974#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2978#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:36:10,877 INFO L273 TraceCheckUtils]: 19: Hoare triple {2978#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2982#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:36:10,878 INFO L273 TraceCheckUtils]: 20: Hoare triple {2982#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2986#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:36:10,879 INFO L273 TraceCheckUtils]: 21: Hoare triple {2986#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2990#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:36:10,880 INFO L273 TraceCheckUtils]: 22: Hoare triple {2990#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2994#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 17:36:10,881 INFO L273 TraceCheckUtils]: 23: Hoare triple {2994#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2998#(and (= main_~main__sum~0 136) (<= 16 main_~main__n~0) (<= main_~main__i~0 17))} is VALID [2018-11-14 17:36:10,882 INFO L273 TraceCheckUtils]: 24: Hoare triple {2998#(and (= main_~main__sum~0 136) (<= 16 main_~main__n~0) (<= main_~main__i~0 17))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3002#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:10,883 INFO L273 TraceCheckUtils]: 25: Hoare triple {3002#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {2909#false} is VALID [2018-11-14 17:36:10,883 INFO L273 TraceCheckUtils]: 26: Hoare triple {2909#false} assume !false; {2909#false} is VALID [2018-11-14 17:36:10,885 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:10,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:10,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-11-14 17:36:10,915 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2018-11-14 17:36:10,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:10,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-14 17:36:10,946 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:10,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-14 17:36:10,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-14 17:36:10,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-11-14 17:36:10,947 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 20 states. [2018-11-14 17:36:12,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:12,007 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-14 17:36:12,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-14 17:36:12,008 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2018-11-14 17:36:12,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:12,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 17:36:12,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 32 transitions. [2018-11-14 17:36:12,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 17:36:12,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 32 transitions. [2018-11-14 17:36:12,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 32 transitions. [2018-11-14 17:36:12,044 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:12,045 INFO L225 Difference]: With dead ends: 32 [2018-11-14 17:36:12,045 INFO L226 Difference]: Without dead ends: 29 [2018-11-14 17:36:12,046 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-11-14 17:36:12,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-14 17:36:12,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-14 17:36:12,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:12,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-14 17:36:12,106 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 17:36:12,107 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 17:36:12,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:12,108 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-14 17:36:12,108 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-14 17:36:12,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:12,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:12,109 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 17:36:12,109 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 17:36:12,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:12,110 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-14 17:36:12,110 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-14 17:36:12,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:12,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:12,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:12,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:12,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 17:36:12,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-11-14 17:36:12,111 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-11-14 17:36:12,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:12,112 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-11-14 17:36:12,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-14 17:36:12,112 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-14 17:36:12,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 17:36:12,112 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:12,113 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:12,113 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:12,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:12,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1636739888, now seen corresponding path program 17 times [2018-11-14 17:36:12,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:12,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:12,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:12,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:12,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:12,125 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:12,125 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:12,125 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:12,148 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:36:12,182 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-11-14 17:36:12,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:12,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:13,077 INFO L256 TraceCheckUtils]: 0: Hoare triple {3173#true} call ULTIMATE.init(); {3173#true} is VALID [2018-11-14 17:36:13,078 INFO L273 TraceCheckUtils]: 1: Hoare triple {3173#true} ~__return_main~0 := 0;~__return_80~0 := 0; {3173#true} is VALID [2018-11-14 17:36:13,078 INFO L273 TraceCheckUtils]: 2: Hoare triple {3173#true} assume true; {3173#true} is VALID [2018-11-14 17:36:13,078 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3173#true} {3173#true} #28#return; {3173#true} is VALID [2018-11-14 17:36:13,079 INFO L256 TraceCheckUtils]: 4: Hoare triple {3173#true} call #t~ret2 := main(); {3173#true} is VALID [2018-11-14 17:36:13,079 INFO L273 TraceCheckUtils]: 5: Hoare triple {3173#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {3173#true} is VALID [2018-11-14 17:36:13,079 INFO L273 TraceCheckUtils]: 6: Hoare triple {3173#true} assume !!(1 <= ~main__n~0); {3173#true} is VALID [2018-11-14 17:36:13,080 INFO L273 TraceCheckUtils]: 7: Hoare triple {3173#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {3199#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:13,080 INFO L273 TraceCheckUtils]: 8: Hoare triple {3199#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3203#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:36:13,081 INFO L273 TraceCheckUtils]: 9: Hoare triple {3203#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3207#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:13,081 INFO L273 TraceCheckUtils]: 10: Hoare triple {3207#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3211#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:13,082 INFO L273 TraceCheckUtils]: 11: Hoare triple {3211#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3215#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:13,082 INFO L273 TraceCheckUtils]: 12: Hoare triple {3215#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3219#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:13,083 INFO L273 TraceCheckUtils]: 13: Hoare triple {3219#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3223#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:13,084 INFO L273 TraceCheckUtils]: 14: Hoare triple {3223#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3227#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:13,085 INFO L273 TraceCheckUtils]: 15: Hoare triple {3227#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3231#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:13,086 INFO L273 TraceCheckUtils]: 16: Hoare triple {3231#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3235#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:13,086 INFO L273 TraceCheckUtils]: 17: Hoare triple {3235#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3239#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:13,087 INFO L273 TraceCheckUtils]: 18: Hoare triple {3239#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3243#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:36:13,088 INFO L273 TraceCheckUtils]: 19: Hoare triple {3243#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3247#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:36:13,089 INFO L273 TraceCheckUtils]: 20: Hoare triple {3247#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3251#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:36:13,090 INFO L273 TraceCheckUtils]: 21: Hoare triple {3251#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3255#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:36:13,091 INFO L273 TraceCheckUtils]: 22: Hoare triple {3255#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3259#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 17:36:13,092 INFO L273 TraceCheckUtils]: 23: Hoare triple {3259#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3263#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 17:36:13,092 INFO L273 TraceCheckUtils]: 24: Hoare triple {3263#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3267#(and (<= main_~main__i~0 18) (= main_~main__sum~0 153) (<= 17 main_~main__n~0))} is VALID [2018-11-14 17:36:13,094 INFO L273 TraceCheckUtils]: 25: Hoare triple {3267#(and (<= main_~main__i~0 18) (= main_~main__sum~0 153) (<= 17 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3271#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:13,094 INFO L273 TraceCheckUtils]: 26: Hoare triple {3271#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {3174#false} is VALID [2018-11-14 17:36:13,095 INFO L273 TraceCheckUtils]: 27: Hoare triple {3174#false} assume !false; {3174#false} is VALID [2018-11-14 17:36:13,097 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:13,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:13,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-11-14 17:36:13,117 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2018-11-14 17:36:13,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:13,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-14 17:36:13,143 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:13,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-14 17:36:13,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-14 17:36:13,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-11-14 17:36:13,145 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 21 states. [2018-11-14 17:36:14,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:14,184 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-14 17:36:14,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-14 17:36:14,185 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2018-11-14 17:36:14,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:14,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 17:36:14,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 33 transitions. [2018-11-14 17:36:14,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 17:36:14,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 33 transitions. [2018-11-14 17:36:14,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 33 transitions. [2018-11-14 17:36:14,223 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:14,224 INFO L225 Difference]: With dead ends: 33 [2018-11-14 17:36:14,224 INFO L226 Difference]: Without dead ends: 30 [2018-11-14 17:36:14,225 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-11-14 17:36:14,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-14 17:36:14,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-14 17:36:14,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:14,278 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2018-11-14 17:36:14,278 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-14 17:36:14,278 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-14 17:36:14,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:14,279 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-14 17:36:14,279 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-14 17:36:14,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:14,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:14,279 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-14 17:36:14,279 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-14 17:36:14,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:14,280 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-14 17:36:14,280 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-14 17:36:14,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:14,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:14,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:14,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:14,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 17:36:14,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-14 17:36:14,281 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-11-14 17:36:14,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:14,281 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-14 17:36:14,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-14 17:36:14,282 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-14 17:36:14,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 17:36:14,282 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:14,282 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:14,282 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:14,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:14,283 INFO L82 PathProgramCache]: Analyzing trace with hash 800608551, now seen corresponding path program 18 times [2018-11-14 17:36:14,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:14,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:14,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:14,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:14,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:14,293 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:14,293 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:14,293 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:14,309 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:36:14,347 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-11-14 17:36:14,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:14,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:14,787 INFO L256 TraceCheckUtils]: 0: Hoare triple {3448#true} call ULTIMATE.init(); {3448#true} is VALID [2018-11-14 17:36:14,787 INFO L273 TraceCheckUtils]: 1: Hoare triple {3448#true} ~__return_main~0 := 0;~__return_80~0 := 0; {3448#true} is VALID [2018-11-14 17:36:14,788 INFO L273 TraceCheckUtils]: 2: Hoare triple {3448#true} assume true; {3448#true} is VALID [2018-11-14 17:36:14,788 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3448#true} {3448#true} #28#return; {3448#true} is VALID [2018-11-14 17:36:14,788 INFO L256 TraceCheckUtils]: 4: Hoare triple {3448#true} call #t~ret2 := main(); {3448#true} is VALID [2018-11-14 17:36:14,788 INFO L273 TraceCheckUtils]: 5: Hoare triple {3448#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {3448#true} is VALID [2018-11-14 17:36:14,788 INFO L273 TraceCheckUtils]: 6: Hoare triple {3448#true} assume !!(1 <= ~main__n~0); {3448#true} is VALID [2018-11-14 17:36:14,789 INFO L273 TraceCheckUtils]: 7: Hoare triple {3448#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {3474#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:14,790 INFO L273 TraceCheckUtils]: 8: Hoare triple {3474#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3478#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:36:14,790 INFO L273 TraceCheckUtils]: 9: Hoare triple {3478#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3482#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:14,791 INFO L273 TraceCheckUtils]: 10: Hoare triple {3482#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3486#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:14,791 INFO L273 TraceCheckUtils]: 11: Hoare triple {3486#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3490#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:14,792 INFO L273 TraceCheckUtils]: 12: Hoare triple {3490#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3494#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:14,793 INFO L273 TraceCheckUtils]: 13: Hoare triple {3494#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3498#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:14,794 INFO L273 TraceCheckUtils]: 14: Hoare triple {3498#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3502#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:14,795 INFO L273 TraceCheckUtils]: 15: Hoare triple {3502#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3506#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:14,796 INFO L273 TraceCheckUtils]: 16: Hoare triple {3506#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3510#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:14,797 INFO L273 TraceCheckUtils]: 17: Hoare triple {3510#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3514#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:14,798 INFO L273 TraceCheckUtils]: 18: Hoare triple {3514#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3518#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:36:14,798 INFO L273 TraceCheckUtils]: 19: Hoare triple {3518#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3522#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:36:14,799 INFO L273 TraceCheckUtils]: 20: Hoare triple {3522#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3526#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:36:14,800 INFO L273 TraceCheckUtils]: 21: Hoare triple {3526#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3530#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:36:14,801 INFO L273 TraceCheckUtils]: 22: Hoare triple {3530#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3534#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 17:36:14,802 INFO L273 TraceCheckUtils]: 23: Hoare triple {3534#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3538#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 17:36:14,803 INFO L273 TraceCheckUtils]: 24: Hoare triple {3538#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3542#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 17:36:14,804 INFO L273 TraceCheckUtils]: 25: Hoare triple {3542#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3546#(and (<= main_~main__i~0 19) (<= 18 main_~main__n~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 17:36:14,805 INFO L273 TraceCheckUtils]: 26: Hoare triple {3546#(and (<= main_~main__i~0 19) (<= 18 main_~main__n~0) (= main_~main__sum~0 171))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3550#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:14,806 INFO L273 TraceCheckUtils]: 27: Hoare triple {3550#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {3449#false} is VALID [2018-11-14 17:36:14,806 INFO L273 TraceCheckUtils]: 28: Hoare triple {3449#false} assume !false; {3449#false} is VALID [2018-11-14 17:36:14,809 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:14,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:14,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-11-14 17:36:14,829 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2018-11-14 17:36:14,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:14,829 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-14 17:36:14,853 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:14,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-14 17:36:14,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-14 17:36:14,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-11-14 17:36:14,854 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 22 states. [2018-11-14 17:36:16,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:16,491 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-14 17:36:16,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-14 17:36:16,491 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2018-11-14 17:36:16,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:16,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 17:36:16,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 34 transitions. [2018-11-14 17:36:16,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 17:36:16,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 34 transitions. [2018-11-14 17:36:16,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 34 transitions. [2018-11-14 17:36:16,914 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:16,915 INFO L225 Difference]: With dead ends: 34 [2018-11-14 17:36:16,915 INFO L226 Difference]: Without dead ends: 31 [2018-11-14 17:36:16,916 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2018-11-14 17:36:16,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-14 17:36:17,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-14 17:36:17,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:17,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-14 17:36:17,022 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-14 17:36:17,022 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-14 17:36:17,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:17,023 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-14 17:36:17,024 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-14 17:36:17,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:17,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:17,024 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-14 17:36:17,024 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-14 17:36:17,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:17,025 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-14 17:36:17,025 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-14 17:36:17,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:17,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:17,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:17,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:17,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 17:36:17,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-11-14 17:36:17,026 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-11-14 17:36:17,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:17,026 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-11-14 17:36:17,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-14 17:36:17,026 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-14 17:36:17,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 17:36:17,027 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:17,027 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:17,027 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:17,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:17,027 INFO L82 PathProgramCache]: Analyzing trace with hash -951001168, now seen corresponding path program 19 times [2018-11-14 17:36:17,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:17,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:17,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:17,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:17,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:17,044 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:17,044 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:17,044 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:17,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:36:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:17,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:17,574 INFO L256 TraceCheckUtils]: 0: Hoare triple {3733#true} call ULTIMATE.init(); {3733#true} is VALID [2018-11-14 17:36:17,575 INFO L273 TraceCheckUtils]: 1: Hoare triple {3733#true} ~__return_main~0 := 0;~__return_80~0 := 0; {3733#true} is VALID [2018-11-14 17:36:17,575 INFO L273 TraceCheckUtils]: 2: Hoare triple {3733#true} assume true; {3733#true} is VALID [2018-11-14 17:36:17,575 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3733#true} {3733#true} #28#return; {3733#true} is VALID [2018-11-14 17:36:17,576 INFO L256 TraceCheckUtils]: 4: Hoare triple {3733#true} call #t~ret2 := main(); {3733#true} is VALID [2018-11-14 17:36:17,576 INFO L273 TraceCheckUtils]: 5: Hoare triple {3733#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {3733#true} is VALID [2018-11-14 17:36:17,576 INFO L273 TraceCheckUtils]: 6: Hoare triple {3733#true} assume !!(1 <= ~main__n~0); {3733#true} is VALID [2018-11-14 17:36:17,578 INFO L273 TraceCheckUtils]: 7: Hoare triple {3733#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {3759#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:17,579 INFO L273 TraceCheckUtils]: 8: Hoare triple {3759#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3763#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:36:17,579 INFO L273 TraceCheckUtils]: 9: Hoare triple {3763#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3767#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:17,580 INFO L273 TraceCheckUtils]: 10: Hoare triple {3767#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3771#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:17,581 INFO L273 TraceCheckUtils]: 11: Hoare triple {3771#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3775#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:17,582 INFO L273 TraceCheckUtils]: 12: Hoare triple {3775#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3779#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:17,582 INFO L273 TraceCheckUtils]: 13: Hoare triple {3779#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3783#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:17,583 INFO L273 TraceCheckUtils]: 14: Hoare triple {3783#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3787#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:17,584 INFO L273 TraceCheckUtils]: 15: Hoare triple {3787#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3791#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:17,585 INFO L273 TraceCheckUtils]: 16: Hoare triple {3791#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3795#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:17,586 INFO L273 TraceCheckUtils]: 17: Hoare triple {3795#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3799#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:17,587 INFO L273 TraceCheckUtils]: 18: Hoare triple {3799#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3803#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:36:17,588 INFO L273 TraceCheckUtils]: 19: Hoare triple {3803#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3807#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:36:17,588 INFO L273 TraceCheckUtils]: 20: Hoare triple {3807#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3811#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:36:17,589 INFO L273 TraceCheckUtils]: 21: Hoare triple {3811#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3815#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:36:17,590 INFO L273 TraceCheckUtils]: 22: Hoare triple {3815#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3819#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 17:36:17,591 INFO L273 TraceCheckUtils]: 23: Hoare triple {3819#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3823#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 17:36:17,592 INFO L273 TraceCheckUtils]: 24: Hoare triple {3823#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3827#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 17:36:17,593 INFO L273 TraceCheckUtils]: 25: Hoare triple {3827#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3831#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 17:36:17,594 INFO L273 TraceCheckUtils]: 26: Hoare triple {3831#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3835#(and (<= main_~main__i~0 20) (= main_~main__sum~0 190) (<= 19 main_~main__n~0))} is VALID [2018-11-14 17:36:17,595 INFO L273 TraceCheckUtils]: 27: Hoare triple {3835#(and (<= main_~main__i~0 20) (= main_~main__sum~0 190) (<= 19 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3839#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:17,596 INFO L273 TraceCheckUtils]: 28: Hoare triple {3839#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {3734#false} is VALID [2018-11-14 17:36:17,596 INFO L273 TraceCheckUtils]: 29: Hoare triple {3734#false} assume !false; {3734#false} is VALID [2018-11-14 17:36:17,598 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:17,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:17,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-11-14 17:36:17,618 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-11-14 17:36:17,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:17,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-14 17:36:17,646 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:17,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-14 17:36:17,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-14 17:36:17,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-11-14 17:36:17,647 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 23 states. [2018-11-14 17:36:19,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:19,403 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-14 17:36:19,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-14 17:36:19,403 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-11-14 17:36:19,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:19,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 17:36:19,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2018-11-14 17:36:19,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 17:36:19,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2018-11-14 17:36:19,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 35 transitions. [2018-11-14 17:36:19,439 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:19,440 INFO L225 Difference]: With dead ends: 35 [2018-11-14 17:36:19,440 INFO L226 Difference]: Without dead ends: 32 [2018-11-14 17:36:19,440 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2018-11-14 17:36:19,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-14 17:36:19,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-14 17:36:19,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:19,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2018-11-14 17:36:19,496 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-14 17:36:19,496 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-14 17:36:19,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:19,498 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-14 17:36:19,498 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-14 17:36:19,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:19,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:19,498 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-14 17:36:19,498 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-14 17:36:19,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:19,499 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-14 17:36:19,499 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-14 17:36:19,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:19,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:19,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:19,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:19,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 17:36:19,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-11-14 17:36:19,501 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-11-14 17:36:19,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:19,501 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-11-14 17:36:19,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-14 17:36:19,502 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-14 17:36:19,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 17:36:19,502 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:19,502 INFO L375 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:19,502 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:19,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:19,503 INFO L82 PathProgramCache]: Analyzing trace with hash 583672391, now seen corresponding path program 20 times [2018-11-14 17:36:19,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:19,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:19,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:19,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:36:19,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:19,513 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:19,513 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:19,513 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:19,540 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:36:19,574 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:36:19,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:19,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:19,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:20,693 INFO L256 TraceCheckUtils]: 0: Hoare triple {4028#true} call ULTIMATE.init(); {4028#true} is VALID [2018-11-14 17:36:20,693 INFO L273 TraceCheckUtils]: 1: Hoare triple {4028#true} ~__return_main~0 := 0;~__return_80~0 := 0; {4028#true} is VALID [2018-11-14 17:36:20,693 INFO L273 TraceCheckUtils]: 2: Hoare triple {4028#true} assume true; {4028#true} is VALID [2018-11-14 17:36:20,694 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4028#true} {4028#true} #28#return; {4028#true} is VALID [2018-11-14 17:36:20,694 INFO L256 TraceCheckUtils]: 4: Hoare triple {4028#true} call #t~ret2 := main(); {4028#true} is VALID [2018-11-14 17:36:20,694 INFO L273 TraceCheckUtils]: 5: Hoare triple {4028#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {4028#true} is VALID [2018-11-14 17:36:20,694 INFO L273 TraceCheckUtils]: 6: Hoare triple {4028#true} assume !!(1 <= ~main__n~0); {4028#true} is VALID [2018-11-14 17:36:20,695 INFO L273 TraceCheckUtils]: 7: Hoare triple {4028#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {4054#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:20,696 INFO L273 TraceCheckUtils]: 8: Hoare triple {4054#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4058#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-14 17:36:20,697 INFO L273 TraceCheckUtils]: 9: Hoare triple {4058#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4062#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:20,698 INFO L273 TraceCheckUtils]: 10: Hoare triple {4062#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4066#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:20,700 INFO L273 TraceCheckUtils]: 11: Hoare triple {4066#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4070#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:20,701 INFO L273 TraceCheckUtils]: 12: Hoare triple {4070#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4074#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:20,707 INFO L273 TraceCheckUtils]: 13: Hoare triple {4074#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4078#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:20,707 INFO L273 TraceCheckUtils]: 14: Hoare triple {4078#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4082#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:20,708 INFO L273 TraceCheckUtils]: 15: Hoare triple {4082#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4086#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:20,708 INFO L273 TraceCheckUtils]: 16: Hoare triple {4086#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4090#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:20,709 INFO L273 TraceCheckUtils]: 17: Hoare triple {4090#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4094#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:20,710 INFO L273 TraceCheckUtils]: 18: Hoare triple {4094#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4098#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:36:20,710 INFO L273 TraceCheckUtils]: 19: Hoare triple {4098#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4102#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:36:20,711 INFO L273 TraceCheckUtils]: 20: Hoare triple {4102#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4106#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:36:20,711 INFO L273 TraceCheckUtils]: 21: Hoare triple {4106#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4110#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:36:20,712 INFO L273 TraceCheckUtils]: 22: Hoare triple {4110#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4114#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 17:36:20,713 INFO L273 TraceCheckUtils]: 23: Hoare triple {4114#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4118#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 17:36:20,714 INFO L273 TraceCheckUtils]: 24: Hoare triple {4118#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4122#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 17:36:20,715 INFO L273 TraceCheckUtils]: 25: Hoare triple {4122#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4126#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 17:36:20,716 INFO L273 TraceCheckUtils]: 26: Hoare triple {4126#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4130#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 17:36:20,717 INFO L273 TraceCheckUtils]: 27: Hoare triple {4130#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4134#(and (<= 20 main_~main__n~0) (<= main_~main__i~0 21) (= main_~main__sum~0 210))} is VALID [2018-11-14 17:36:20,718 INFO L273 TraceCheckUtils]: 28: Hoare triple {4134#(and (<= 20 main_~main__n~0) (<= main_~main__i~0 21) (= main_~main__sum~0 210))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4138#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:20,719 INFO L273 TraceCheckUtils]: 29: Hoare triple {4138#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {4029#false} is VALID [2018-11-14 17:36:20,719 INFO L273 TraceCheckUtils]: 30: Hoare triple {4029#false} assume !false; {4029#false} is VALID [2018-11-14 17:36:20,722 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:20,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:20,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-11-14 17:36:20,744 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2018-11-14 17:36:20,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:20,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 17:36:20,775 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:20,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 17:36:20,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 17:36:20,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-11-14 17:36:20,777 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 24 states. [2018-11-14 17:36:22,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:22,287 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-14 17:36:22,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-14 17:36:22,287 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2018-11-14 17:36:22,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:22,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 17:36:22,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 36 transitions. [2018-11-14 17:36:22,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 17:36:22,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 36 transitions. [2018-11-14 17:36:22,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 36 transitions. [2018-11-14 17:36:22,323 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:22,324 INFO L225 Difference]: With dead ends: 36 [2018-11-14 17:36:22,324 INFO L226 Difference]: Without dead ends: 33 [2018-11-14 17:36:22,325 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-11-14 17:36:22,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-14 17:36:22,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-14 17:36:22,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:22,381 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-14 17:36:22,382 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-14 17:36:22,382 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-14 17:36:22,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:22,383 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-14 17:36:22,383 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-14 17:36:22,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:22,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:22,384 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-14 17:36:22,384 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-14 17:36:22,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:22,384 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-14 17:36:22,384 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-14 17:36:22,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:22,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:22,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:22,385 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:22,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 17:36:22,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-14 17:36:22,386 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-11-14 17:36:22,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:22,386 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-14 17:36:22,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 17:36:22,386 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-14 17:36:22,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 17:36:22,387 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:22,387 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:22,387 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:22,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:22,387 INFO L82 PathProgramCache]: Analyzing trace with hash 913912464, now seen corresponding path program 21 times [2018-11-14 17:36:22,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:22,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:22,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:22,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:22,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:22,397 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:22,397 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:22,397 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:22,413 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:36:22,599 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-14 17:36:22,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:22,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:23,296 INFO L256 TraceCheckUtils]: 0: Hoare triple {4333#true} call ULTIMATE.init(); {4333#true} is VALID [2018-11-14 17:36:23,297 INFO L273 TraceCheckUtils]: 1: Hoare triple {4333#true} ~__return_main~0 := 0;~__return_80~0 := 0; {4333#true} is VALID [2018-11-14 17:36:23,297 INFO L273 TraceCheckUtils]: 2: Hoare triple {4333#true} assume true; {4333#true} is VALID [2018-11-14 17:36:23,297 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4333#true} {4333#true} #28#return; {4333#true} is VALID [2018-11-14 17:36:23,297 INFO L256 TraceCheckUtils]: 4: Hoare triple {4333#true} call #t~ret2 := main(); {4333#true} is VALID [2018-11-14 17:36:23,298 INFO L273 TraceCheckUtils]: 5: Hoare triple {4333#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {4333#true} is VALID [2018-11-14 17:36:23,298 INFO L273 TraceCheckUtils]: 6: Hoare triple {4333#true} assume !!(1 <= ~main__n~0); {4333#true} is VALID [2018-11-14 17:36:23,298 INFO L273 TraceCheckUtils]: 7: Hoare triple {4333#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {4359#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:23,299 INFO L273 TraceCheckUtils]: 8: Hoare triple {4359#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4363#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-14 17:36:23,299 INFO L273 TraceCheckUtils]: 9: Hoare triple {4363#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4367#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:23,300 INFO L273 TraceCheckUtils]: 10: Hoare triple {4367#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4371#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:23,300 INFO L273 TraceCheckUtils]: 11: Hoare triple {4371#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4375#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:23,301 INFO L273 TraceCheckUtils]: 12: Hoare triple {4375#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4379#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:23,302 INFO L273 TraceCheckUtils]: 13: Hoare triple {4379#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4383#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:23,302 INFO L273 TraceCheckUtils]: 14: Hoare triple {4383#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4387#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:23,303 INFO L273 TraceCheckUtils]: 15: Hoare triple {4387#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4391#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:23,304 INFO L273 TraceCheckUtils]: 16: Hoare triple {4391#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4395#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:23,305 INFO L273 TraceCheckUtils]: 17: Hoare triple {4395#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4399#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:23,306 INFO L273 TraceCheckUtils]: 18: Hoare triple {4399#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4403#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:36:23,307 INFO L273 TraceCheckUtils]: 19: Hoare triple {4403#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4407#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:36:23,307 INFO L273 TraceCheckUtils]: 20: Hoare triple {4407#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4411#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:36:23,308 INFO L273 TraceCheckUtils]: 21: Hoare triple {4411#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4415#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:36:23,309 INFO L273 TraceCheckUtils]: 22: Hoare triple {4415#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4419#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 17:36:23,310 INFO L273 TraceCheckUtils]: 23: Hoare triple {4419#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4423#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 17:36:23,311 INFO L273 TraceCheckUtils]: 24: Hoare triple {4423#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4427#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 17:36:23,312 INFO L273 TraceCheckUtils]: 25: Hoare triple {4427#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4431#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 17:36:23,313 INFO L273 TraceCheckUtils]: 26: Hoare triple {4431#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4435#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 17:36:23,313 INFO L273 TraceCheckUtils]: 27: Hoare triple {4435#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4439#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 17:36:23,314 INFO L273 TraceCheckUtils]: 28: Hoare triple {4439#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4443#(and (<= 21 main_~main__n~0) (= main_~main__sum~0 231) (<= main_~main__i~0 22))} is VALID [2018-11-14 17:36:23,315 INFO L273 TraceCheckUtils]: 29: Hoare triple {4443#(and (<= 21 main_~main__n~0) (= main_~main__sum~0 231) (<= main_~main__i~0 22))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4447#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:23,316 INFO L273 TraceCheckUtils]: 30: Hoare triple {4447#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {4334#false} is VALID [2018-11-14 17:36:23,316 INFO L273 TraceCheckUtils]: 31: Hoare triple {4334#false} assume !false; {4334#false} is VALID [2018-11-14 17:36:23,319 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:23,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:23,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-11-14 17:36:23,340 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 32 [2018-11-14 17:36:23,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:23,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-14 17:36:23,370 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:23,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-14 17:36:23,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-14 17:36:23,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-11-14 17:36:23,371 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 25 states. [2018-11-14 17:36:24,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:24,973 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-11-14 17:36:24,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-14 17:36:24,973 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 32 [2018-11-14 17:36:24,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:24,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 17:36:24,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2018-11-14 17:36:24,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 17:36:24,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2018-11-14 17:36:24,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 37 transitions. [2018-11-14 17:36:25,026 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:25,027 INFO L225 Difference]: With dead ends: 37 [2018-11-14 17:36:25,027 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 17:36:25,028 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2018-11-14 17:36:25,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 17:36:25,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-14 17:36:25,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:25,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2018-11-14 17:36:25,098 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-14 17:36:25,098 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-14 17:36:25,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:25,099 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-14 17:36:25,099 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-14 17:36:25,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:25,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:25,099 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-14 17:36:25,099 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-14 17:36:25,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:25,100 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-14 17:36:25,100 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-14 17:36:25,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:25,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:25,100 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:25,100 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:25,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 17:36:25,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-11-14 17:36:25,101 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-11-14 17:36:25,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:25,102 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-11-14 17:36:25,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-14 17:36:25,102 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-14 17:36:25,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-14 17:36:25,102 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:25,102 INFO L375 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:25,103 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:25,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:25,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1733547161, now seen corresponding path program 22 times [2018-11-14 17:36:25,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:25,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:25,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:25,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:25,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:25,112 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:25,112 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:25,113 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:25,130 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:36:25,335 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:36:25,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:25,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:26,224 INFO L256 TraceCheckUtils]: 0: Hoare triple {4648#true} call ULTIMATE.init(); {4648#true} is VALID [2018-11-14 17:36:26,224 INFO L273 TraceCheckUtils]: 1: Hoare triple {4648#true} ~__return_main~0 := 0;~__return_80~0 := 0; {4648#true} is VALID [2018-11-14 17:36:26,224 INFO L273 TraceCheckUtils]: 2: Hoare triple {4648#true} assume true; {4648#true} is VALID [2018-11-14 17:36:26,224 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4648#true} {4648#true} #28#return; {4648#true} is VALID [2018-11-14 17:36:26,225 INFO L256 TraceCheckUtils]: 4: Hoare triple {4648#true} call #t~ret2 := main(); {4648#true} is VALID [2018-11-14 17:36:26,225 INFO L273 TraceCheckUtils]: 5: Hoare triple {4648#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {4648#true} is VALID [2018-11-14 17:36:26,225 INFO L273 TraceCheckUtils]: 6: Hoare triple {4648#true} assume !!(1 <= ~main__n~0); {4648#true} is VALID [2018-11-14 17:36:26,226 INFO L273 TraceCheckUtils]: 7: Hoare triple {4648#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {4674#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:26,227 INFO L273 TraceCheckUtils]: 8: Hoare triple {4674#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4678#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-14 17:36:26,227 INFO L273 TraceCheckUtils]: 9: Hoare triple {4678#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4682#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:26,228 INFO L273 TraceCheckUtils]: 10: Hoare triple {4682#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4686#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:26,229 INFO L273 TraceCheckUtils]: 11: Hoare triple {4686#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4690#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:26,229 INFO L273 TraceCheckUtils]: 12: Hoare triple {4690#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4694#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:26,230 INFO L273 TraceCheckUtils]: 13: Hoare triple {4694#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4698#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:26,230 INFO L273 TraceCheckUtils]: 14: Hoare triple {4698#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4702#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:26,231 INFO L273 TraceCheckUtils]: 15: Hoare triple {4702#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4706#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:26,232 INFO L273 TraceCheckUtils]: 16: Hoare triple {4706#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4710#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:26,233 INFO L273 TraceCheckUtils]: 17: Hoare triple {4710#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4714#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:26,234 INFO L273 TraceCheckUtils]: 18: Hoare triple {4714#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4718#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:36:26,235 INFO L273 TraceCheckUtils]: 19: Hoare triple {4718#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4722#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:36:26,236 INFO L273 TraceCheckUtils]: 20: Hoare triple {4722#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4726#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:36:26,237 INFO L273 TraceCheckUtils]: 21: Hoare triple {4726#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4730#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:36:26,238 INFO L273 TraceCheckUtils]: 22: Hoare triple {4730#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4734#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 17:36:26,238 INFO L273 TraceCheckUtils]: 23: Hoare triple {4734#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4738#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 17:36:26,239 INFO L273 TraceCheckUtils]: 24: Hoare triple {4738#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4742#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 17:36:26,240 INFO L273 TraceCheckUtils]: 25: Hoare triple {4742#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4746#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 17:36:26,241 INFO L273 TraceCheckUtils]: 26: Hoare triple {4746#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4750#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 17:36:26,242 INFO L273 TraceCheckUtils]: 27: Hoare triple {4750#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4754#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 17:36:26,243 INFO L273 TraceCheckUtils]: 28: Hoare triple {4754#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4758#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 17:36:26,244 INFO L273 TraceCheckUtils]: 29: Hoare triple {4758#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4762#(and (<= 22 main_~main__n~0) (<= main_~main__i~0 23) (= main_~main__sum~0 253))} is VALID [2018-11-14 17:36:26,245 INFO L273 TraceCheckUtils]: 30: Hoare triple {4762#(and (<= 22 main_~main__n~0) (<= main_~main__i~0 23) (= main_~main__sum~0 253))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4766#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:26,245 INFO L273 TraceCheckUtils]: 31: Hoare triple {4766#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {4649#false} is VALID [2018-11-14 17:36:26,246 INFO L273 TraceCheckUtils]: 32: Hoare triple {4649#false} assume !false; {4649#false} is VALID [2018-11-14 17:36:26,249 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:26,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:26,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-11-14 17:36:26,268 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 33 [2018-11-14 17:36:26,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:26,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-14 17:36:26,298 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:26,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-14 17:36:26,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-14 17:36:26,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-11-14 17:36:26,299 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 26 states. [2018-11-14 17:36:27,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:27,885 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-14 17:36:27,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-14 17:36:27,885 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 33 [2018-11-14 17:36:27,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:27,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 17:36:27,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2018-11-14 17:36:27,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 17:36:27,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2018-11-14 17:36:27,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 38 transitions. [2018-11-14 17:36:28,278 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:28,279 INFO L225 Difference]: With dead ends: 38 [2018-11-14 17:36:28,279 INFO L226 Difference]: Without dead ends: 35 [2018-11-14 17:36:28,280 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2018-11-14 17:36:28,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-14 17:36:28,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-14 17:36:28,353 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:28,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2018-11-14 17:36:28,353 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-14 17:36:28,353 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-14 17:36:28,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:28,355 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-14 17:36:28,355 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-14 17:36:28,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:28,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:28,356 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-14 17:36:28,356 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-14 17:36:28,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:28,357 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-14 17:36:28,357 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-14 17:36:28,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:28,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:28,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:28,358 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:28,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 17:36:28,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-11-14 17:36:28,358 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-11-14 17:36:28,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:28,359 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-11-14 17:36:28,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-14 17:36:28,359 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-14 17:36:28,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-14 17:36:28,359 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:28,359 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:28,360 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:28,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:28,360 INFO L82 PathProgramCache]: Analyzing trace with hash 2094550384, now seen corresponding path program 23 times [2018-11-14 17:36:28,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:28,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:28,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:28,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:28,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:28,375 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:28,376 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:28,376 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:28,395 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:36:28,440 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-11-14 17:36:28,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:28,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:29,615 INFO L256 TraceCheckUtils]: 0: Hoare triple {4973#true} call ULTIMATE.init(); {4973#true} is VALID [2018-11-14 17:36:29,615 INFO L273 TraceCheckUtils]: 1: Hoare triple {4973#true} ~__return_main~0 := 0;~__return_80~0 := 0; {4973#true} is VALID [2018-11-14 17:36:29,616 INFO L273 TraceCheckUtils]: 2: Hoare triple {4973#true} assume true; {4973#true} is VALID [2018-11-14 17:36:29,616 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4973#true} {4973#true} #28#return; {4973#true} is VALID [2018-11-14 17:36:29,616 INFO L256 TraceCheckUtils]: 4: Hoare triple {4973#true} call #t~ret2 := main(); {4973#true} is VALID [2018-11-14 17:36:29,616 INFO L273 TraceCheckUtils]: 5: Hoare triple {4973#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {4973#true} is VALID [2018-11-14 17:36:29,617 INFO L273 TraceCheckUtils]: 6: Hoare triple {4973#true} assume !!(1 <= ~main__n~0); {4973#true} is VALID [2018-11-14 17:36:29,631 INFO L273 TraceCheckUtils]: 7: Hoare triple {4973#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {4999#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:29,632 INFO L273 TraceCheckUtils]: 8: Hoare triple {4999#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5003#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:36:29,633 INFO L273 TraceCheckUtils]: 9: Hoare triple {5003#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5007#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:29,634 INFO L273 TraceCheckUtils]: 10: Hoare triple {5007#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5011#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:29,635 INFO L273 TraceCheckUtils]: 11: Hoare triple {5011#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5015#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:29,636 INFO L273 TraceCheckUtils]: 12: Hoare triple {5015#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5019#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:29,637 INFO L273 TraceCheckUtils]: 13: Hoare triple {5019#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5023#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:29,638 INFO L273 TraceCheckUtils]: 14: Hoare triple {5023#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5027#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:29,638 INFO L273 TraceCheckUtils]: 15: Hoare triple {5027#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5031#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:29,639 INFO L273 TraceCheckUtils]: 16: Hoare triple {5031#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5035#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:29,640 INFO L273 TraceCheckUtils]: 17: Hoare triple {5035#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5039#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:29,641 INFO L273 TraceCheckUtils]: 18: Hoare triple {5039#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5043#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:36:29,642 INFO L273 TraceCheckUtils]: 19: Hoare triple {5043#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5047#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:36:29,643 INFO L273 TraceCheckUtils]: 20: Hoare triple {5047#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5051#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:36:29,644 INFO L273 TraceCheckUtils]: 21: Hoare triple {5051#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5055#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:36:29,645 INFO L273 TraceCheckUtils]: 22: Hoare triple {5055#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5059#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 17:36:29,646 INFO L273 TraceCheckUtils]: 23: Hoare triple {5059#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5063#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 17:36:29,647 INFO L273 TraceCheckUtils]: 24: Hoare triple {5063#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5067#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 17:36:29,647 INFO L273 TraceCheckUtils]: 25: Hoare triple {5067#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5071#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 17:36:29,648 INFO L273 TraceCheckUtils]: 26: Hoare triple {5071#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5075#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 17:36:29,649 INFO L273 TraceCheckUtils]: 27: Hoare triple {5075#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5079#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 17:36:29,650 INFO L273 TraceCheckUtils]: 28: Hoare triple {5079#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5083#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 17:36:29,651 INFO L273 TraceCheckUtils]: 29: Hoare triple {5083#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5087#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-14 17:36:29,652 INFO L273 TraceCheckUtils]: 30: Hoare triple {5087#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5091#(and (<= main_~main__i~0 24) (= main_~main__sum~0 276) (<= 23 main_~main__n~0))} is VALID [2018-11-14 17:36:29,653 INFO L273 TraceCheckUtils]: 31: Hoare triple {5091#(and (<= main_~main__i~0 24) (= main_~main__sum~0 276) (<= 23 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5095#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:29,654 INFO L273 TraceCheckUtils]: 32: Hoare triple {5095#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {4974#false} is VALID [2018-11-14 17:36:29,654 INFO L273 TraceCheckUtils]: 33: Hoare triple {4974#false} assume !false; {4974#false} is VALID [2018-11-14 17:36:29,656 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:29,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:29,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-11-14 17:36:29,677 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 34 [2018-11-14 17:36:29,677 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:29,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-14 17:36:29,709 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:29,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-14 17:36:29,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-14 17:36:29,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-11-14 17:36:29,710 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 27 states. [2018-11-14 17:36:31,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:31,673 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-14 17:36:31,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-14 17:36:31,674 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 34 [2018-11-14 17:36:31,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:31,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 17:36:31,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2018-11-14 17:36:31,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 17:36:31,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2018-11-14 17:36:31,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 39 transitions. [2018-11-14 17:36:32,134 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:32,135 INFO L225 Difference]: With dead ends: 39 [2018-11-14 17:36:32,135 INFO L226 Difference]: Without dead ends: 36 [2018-11-14 17:36:32,136 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-14 17:36:32,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-14 17:36:32,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-14 17:36:32,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:32,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2018-11-14 17:36:32,205 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-14 17:36:32,205 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-14 17:36:32,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:32,207 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-14 17:36:32,207 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-14 17:36:32,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:32,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:32,208 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-14 17:36:32,208 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-14 17:36:32,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:32,210 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-14 17:36:32,210 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-14 17:36:32,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:32,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:32,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:32,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:32,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 17:36:32,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-11-14 17:36:32,212 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-11-14 17:36:32,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:32,212 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-11-14 17:36:32,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-14 17:36:32,212 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-14 17:36:32,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-14 17:36:32,213 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:32,213 INFO L375 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:32,213 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:32,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:32,213 INFO L82 PathProgramCache]: Analyzing trace with hash 506489991, now seen corresponding path program 24 times [2018-11-14 17:36:32,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:32,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:32,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:32,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:32,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:32,222 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:32,222 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:32,222 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:32,241 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:36:32,319 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-14 17:36:32,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:32,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:33,300 INFO L256 TraceCheckUtils]: 0: Hoare triple {5308#true} call ULTIMATE.init(); {5308#true} is VALID [2018-11-14 17:36:33,301 INFO L273 TraceCheckUtils]: 1: Hoare triple {5308#true} ~__return_main~0 := 0;~__return_80~0 := 0; {5308#true} is VALID [2018-11-14 17:36:33,301 INFO L273 TraceCheckUtils]: 2: Hoare triple {5308#true} assume true; {5308#true} is VALID [2018-11-14 17:36:33,302 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5308#true} {5308#true} #28#return; {5308#true} is VALID [2018-11-14 17:36:33,302 INFO L256 TraceCheckUtils]: 4: Hoare triple {5308#true} call #t~ret2 := main(); {5308#true} is VALID [2018-11-14 17:36:33,302 INFO L273 TraceCheckUtils]: 5: Hoare triple {5308#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {5308#true} is VALID [2018-11-14 17:36:33,302 INFO L273 TraceCheckUtils]: 6: Hoare triple {5308#true} assume !!(1 <= ~main__n~0); {5308#true} is VALID [2018-11-14 17:36:33,303 INFO L273 TraceCheckUtils]: 7: Hoare triple {5308#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {5334#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:33,304 INFO L273 TraceCheckUtils]: 8: Hoare triple {5334#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5338#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:36:33,304 INFO L273 TraceCheckUtils]: 9: Hoare triple {5338#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5342#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:33,305 INFO L273 TraceCheckUtils]: 10: Hoare triple {5342#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5346#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:33,305 INFO L273 TraceCheckUtils]: 11: Hoare triple {5346#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5350#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:33,306 INFO L273 TraceCheckUtils]: 12: Hoare triple {5350#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5354#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:33,307 INFO L273 TraceCheckUtils]: 13: Hoare triple {5354#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5358#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:33,308 INFO L273 TraceCheckUtils]: 14: Hoare triple {5358#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5362#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:33,308 INFO L273 TraceCheckUtils]: 15: Hoare triple {5362#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5366#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:33,309 INFO L273 TraceCheckUtils]: 16: Hoare triple {5366#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5370#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:33,310 INFO L273 TraceCheckUtils]: 17: Hoare triple {5370#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5374#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:33,311 INFO L273 TraceCheckUtils]: 18: Hoare triple {5374#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5378#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:36:33,312 INFO L273 TraceCheckUtils]: 19: Hoare triple {5378#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5382#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:36:33,313 INFO L273 TraceCheckUtils]: 20: Hoare triple {5382#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5386#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:36:33,313 INFO L273 TraceCheckUtils]: 21: Hoare triple {5386#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5390#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:36:33,314 INFO L273 TraceCheckUtils]: 22: Hoare triple {5390#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5394#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 17:36:33,315 INFO L273 TraceCheckUtils]: 23: Hoare triple {5394#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5398#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 17:36:33,316 INFO L273 TraceCheckUtils]: 24: Hoare triple {5398#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5402#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 17:36:33,317 INFO L273 TraceCheckUtils]: 25: Hoare triple {5402#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5406#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 17:36:33,318 INFO L273 TraceCheckUtils]: 26: Hoare triple {5406#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5410#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 17:36:33,318 INFO L273 TraceCheckUtils]: 27: Hoare triple {5410#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5414#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 17:36:33,319 INFO L273 TraceCheckUtils]: 28: Hoare triple {5414#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5418#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 17:36:33,320 INFO L273 TraceCheckUtils]: 29: Hoare triple {5418#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5422#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-14 17:36:33,321 INFO L273 TraceCheckUtils]: 30: Hoare triple {5422#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5426#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-14 17:36:33,322 INFO L273 TraceCheckUtils]: 31: Hoare triple {5426#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5430#(and (<= 24 main_~main__n~0) (= main_~main__sum~0 300) (<= main_~main__i~0 25))} is VALID [2018-11-14 17:36:33,323 INFO L273 TraceCheckUtils]: 32: Hoare triple {5430#(and (<= 24 main_~main__n~0) (= main_~main__sum~0 300) (<= main_~main__i~0 25))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5434#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:33,324 INFO L273 TraceCheckUtils]: 33: Hoare triple {5434#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {5309#false} is VALID [2018-11-14 17:36:33,324 INFO L273 TraceCheckUtils]: 34: Hoare triple {5309#false} assume !false; {5309#false} is VALID [2018-11-14 17:36:33,326 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:33,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:33,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-11-14 17:36:33,347 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 35 [2018-11-14 17:36:33,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:33,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-14 17:36:33,378 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:33,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-14 17:36:33,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-14 17:36:33,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-11-14 17:36:33,379 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 28 states. [2018-11-14 17:36:35,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:35,295 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-11-14 17:36:35,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-14 17:36:35,295 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 35 [2018-11-14 17:36:35,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:35,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 17:36:35,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-11-14 17:36:35,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 17:36:35,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-11-14 17:36:35,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 40 transitions. [2018-11-14 17:36:35,341 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:35,342 INFO L225 Difference]: With dead ends: 40 [2018-11-14 17:36:35,342 INFO L226 Difference]: Without dead ends: 37 [2018-11-14 17:36:35,342 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=755, Unknown=0, NotChecked=0, Total=812 [2018-11-14 17:36:35,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-14 17:36:35,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-14 17:36:35,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:35,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-14 17:36:35,414 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-14 17:36:35,414 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-14 17:36:35,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:35,416 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-11-14 17:36:35,416 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-11-14 17:36:35,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:35,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:35,417 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-14 17:36:35,417 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-14 17:36:35,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:35,418 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-11-14 17:36:35,418 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-11-14 17:36:35,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:35,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:35,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:35,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:35,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 17:36:35,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-11-14 17:36:35,419 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-11-14 17:36:35,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:35,419 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-11-14 17:36:35,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-14 17:36:35,420 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-11-14 17:36:35,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-14 17:36:35,420 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:35,420 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:35,420 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:35,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:35,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1478741936, now seen corresponding path program 25 times [2018-11-14 17:36:35,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:35,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:35,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:35,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:35,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:35,429 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:35,429 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:35,430 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:35,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:36:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:35,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:36,372 INFO L256 TraceCheckUtils]: 0: Hoare triple {5653#true} call ULTIMATE.init(); {5653#true} is VALID [2018-11-14 17:36:36,372 INFO L273 TraceCheckUtils]: 1: Hoare triple {5653#true} ~__return_main~0 := 0;~__return_80~0 := 0; {5653#true} is VALID [2018-11-14 17:36:36,372 INFO L273 TraceCheckUtils]: 2: Hoare triple {5653#true} assume true; {5653#true} is VALID [2018-11-14 17:36:36,373 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5653#true} {5653#true} #28#return; {5653#true} is VALID [2018-11-14 17:36:36,373 INFO L256 TraceCheckUtils]: 4: Hoare triple {5653#true} call #t~ret2 := main(); {5653#true} is VALID [2018-11-14 17:36:36,373 INFO L273 TraceCheckUtils]: 5: Hoare triple {5653#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {5653#true} is VALID [2018-11-14 17:36:36,373 INFO L273 TraceCheckUtils]: 6: Hoare triple {5653#true} assume !!(1 <= ~main__n~0); {5653#true} is VALID [2018-11-14 17:36:36,374 INFO L273 TraceCheckUtils]: 7: Hoare triple {5653#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {5679#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:36,375 INFO L273 TraceCheckUtils]: 8: Hoare triple {5679#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5683#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:36:36,375 INFO L273 TraceCheckUtils]: 9: Hoare triple {5683#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5687#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:36,376 INFO L273 TraceCheckUtils]: 10: Hoare triple {5687#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5691#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:36,376 INFO L273 TraceCheckUtils]: 11: Hoare triple {5691#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5695#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:36,377 INFO L273 TraceCheckUtils]: 12: Hoare triple {5695#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5699#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:36,378 INFO L273 TraceCheckUtils]: 13: Hoare triple {5699#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5703#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:36,379 INFO L273 TraceCheckUtils]: 14: Hoare triple {5703#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5707#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:36,379 INFO L273 TraceCheckUtils]: 15: Hoare triple {5707#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5711#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:36,380 INFO L273 TraceCheckUtils]: 16: Hoare triple {5711#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5715#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:36,381 INFO L273 TraceCheckUtils]: 17: Hoare triple {5715#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5719#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:36,382 INFO L273 TraceCheckUtils]: 18: Hoare triple {5719#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5723#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:36:36,383 INFO L273 TraceCheckUtils]: 19: Hoare triple {5723#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5727#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:36:36,384 INFO L273 TraceCheckUtils]: 20: Hoare triple {5727#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5731#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:36:36,385 INFO L273 TraceCheckUtils]: 21: Hoare triple {5731#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5735#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:36:36,386 INFO L273 TraceCheckUtils]: 22: Hoare triple {5735#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5739#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 17:36:36,386 INFO L273 TraceCheckUtils]: 23: Hoare triple {5739#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5743#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 17:36:36,387 INFO L273 TraceCheckUtils]: 24: Hoare triple {5743#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5747#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 17:36:36,388 INFO L273 TraceCheckUtils]: 25: Hoare triple {5747#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5751#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 17:36:36,389 INFO L273 TraceCheckUtils]: 26: Hoare triple {5751#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5755#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 17:36:36,390 INFO L273 TraceCheckUtils]: 27: Hoare triple {5755#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5759#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 17:36:36,391 INFO L273 TraceCheckUtils]: 28: Hoare triple {5759#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5763#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 17:36:36,391 INFO L273 TraceCheckUtils]: 29: Hoare triple {5763#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5767#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-14 17:36:36,392 INFO L273 TraceCheckUtils]: 30: Hoare triple {5767#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5771#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-14 17:36:36,393 INFO L273 TraceCheckUtils]: 31: Hoare triple {5771#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5775#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-14 17:36:36,394 INFO L273 TraceCheckUtils]: 32: Hoare triple {5775#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5779#(and (= main_~main__sum~0 325) (<= main_~main__i~0 26) (<= 25 main_~main__n~0))} is VALID [2018-11-14 17:36:36,395 INFO L273 TraceCheckUtils]: 33: Hoare triple {5779#(and (= main_~main__sum~0 325) (<= main_~main__i~0 26) (<= 25 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5783#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:36,396 INFO L273 TraceCheckUtils]: 34: Hoare triple {5783#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {5654#false} is VALID [2018-11-14 17:36:36,396 INFO L273 TraceCheckUtils]: 35: Hoare triple {5654#false} assume !false; {5654#false} is VALID [2018-11-14 17:36:36,399 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:36,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:36,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-11-14 17:36:36,419 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 36 [2018-11-14 17:36:36,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:36,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-14 17:36:36,449 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:36,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-14 17:36:36,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-14 17:36:36,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-11-14 17:36:36,450 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 29 states. [2018-11-14 17:36:38,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:38,401 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-11-14 17:36:38,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-14 17:36:38,401 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 36 [2018-11-14 17:36:38,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:38,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 17:36:38,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2018-11-14 17:36:38,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 17:36:38,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2018-11-14 17:36:38,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 41 transitions. [2018-11-14 17:36:38,441 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:38,442 INFO L225 Difference]: With dead ends: 41 [2018-11-14 17:36:38,442 INFO L226 Difference]: Without dead ends: 38 [2018-11-14 17:36:38,443 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=59, Invalid=811, Unknown=0, NotChecked=0, Total=870 [2018-11-14 17:36:38,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-14 17:36:38,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-14 17:36:38,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:38,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2018-11-14 17:36:38,516 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-14 17:36:38,516 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-14 17:36:38,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:38,518 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-14 17:36:38,518 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-14 17:36:38,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:38,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:38,518 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-14 17:36:38,519 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-14 17:36:38,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:38,519 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-14 17:36:38,519 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-14 17:36:38,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:38,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:38,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:38,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:38,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 17:36:38,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-11-14 17:36:38,520 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-11-14 17:36:38,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:38,521 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-11-14 17:36:38,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-14 17:36:38,521 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-14 17:36:38,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 17:36:38,521 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:38,521 INFO L375 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:38,521 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:38,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:38,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1403577767, now seen corresponding path program 26 times [2018-11-14 17:36:38,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:38,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:38,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:38,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:36:38,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:38,530 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:38,530 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:38,530 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:38,541 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:36:38,581 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:36:38,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:38,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:38,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:39,289 INFO L256 TraceCheckUtils]: 0: Hoare triple {6008#true} call ULTIMATE.init(); {6008#true} is VALID [2018-11-14 17:36:39,289 INFO L273 TraceCheckUtils]: 1: Hoare triple {6008#true} ~__return_main~0 := 0;~__return_80~0 := 0; {6008#true} is VALID [2018-11-14 17:36:39,290 INFO L273 TraceCheckUtils]: 2: Hoare triple {6008#true} assume true; {6008#true} is VALID [2018-11-14 17:36:39,290 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6008#true} {6008#true} #28#return; {6008#true} is VALID [2018-11-14 17:36:39,290 INFO L256 TraceCheckUtils]: 4: Hoare triple {6008#true} call #t~ret2 := main(); {6008#true} is VALID [2018-11-14 17:36:39,290 INFO L273 TraceCheckUtils]: 5: Hoare triple {6008#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {6008#true} is VALID [2018-11-14 17:36:39,290 INFO L273 TraceCheckUtils]: 6: Hoare triple {6008#true} assume !!(1 <= ~main__n~0); {6008#true} is VALID [2018-11-14 17:36:39,291 INFO L273 TraceCheckUtils]: 7: Hoare triple {6008#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {6034#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:39,292 INFO L273 TraceCheckUtils]: 8: Hoare triple {6034#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6038#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:36:39,293 INFO L273 TraceCheckUtils]: 9: Hoare triple {6038#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6042#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:39,294 INFO L273 TraceCheckUtils]: 10: Hoare triple {6042#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6046#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:39,294 INFO L273 TraceCheckUtils]: 11: Hoare triple {6046#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6050#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:39,295 INFO L273 TraceCheckUtils]: 12: Hoare triple {6050#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6054#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:39,296 INFO L273 TraceCheckUtils]: 13: Hoare triple {6054#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6058#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:39,297 INFO L273 TraceCheckUtils]: 14: Hoare triple {6058#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6062#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:39,298 INFO L273 TraceCheckUtils]: 15: Hoare triple {6062#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6066#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:39,299 INFO L273 TraceCheckUtils]: 16: Hoare triple {6066#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6070#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:39,300 INFO L273 TraceCheckUtils]: 17: Hoare triple {6070#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6074#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:39,301 INFO L273 TraceCheckUtils]: 18: Hoare triple {6074#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6078#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:36:39,301 INFO L273 TraceCheckUtils]: 19: Hoare triple {6078#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6082#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:36:39,302 INFO L273 TraceCheckUtils]: 20: Hoare triple {6082#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6086#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:36:39,303 INFO L273 TraceCheckUtils]: 21: Hoare triple {6086#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6090#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:36:39,304 INFO L273 TraceCheckUtils]: 22: Hoare triple {6090#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6094#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 17:36:39,305 INFO L273 TraceCheckUtils]: 23: Hoare triple {6094#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6098#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 17:36:39,306 INFO L273 TraceCheckUtils]: 24: Hoare triple {6098#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6102#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 17:36:39,307 INFO L273 TraceCheckUtils]: 25: Hoare triple {6102#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6106#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 17:36:39,308 INFO L273 TraceCheckUtils]: 26: Hoare triple {6106#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6110#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 17:36:39,309 INFO L273 TraceCheckUtils]: 27: Hoare triple {6110#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6114#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 17:36:39,309 INFO L273 TraceCheckUtils]: 28: Hoare triple {6114#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6118#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 17:36:39,310 INFO L273 TraceCheckUtils]: 29: Hoare triple {6118#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6122#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-14 17:36:39,311 INFO L273 TraceCheckUtils]: 30: Hoare triple {6122#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6126#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-14 17:36:39,312 INFO L273 TraceCheckUtils]: 31: Hoare triple {6126#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6130#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-14 17:36:39,313 INFO L273 TraceCheckUtils]: 32: Hoare triple {6130#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6134#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-14 17:36:39,314 INFO L273 TraceCheckUtils]: 33: Hoare triple {6134#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6138#(and (= main_~main__sum~0 351) (<= main_~main__i~0 27) (<= 26 main_~main__n~0))} is VALID [2018-11-14 17:36:39,315 INFO L273 TraceCheckUtils]: 34: Hoare triple {6138#(and (= main_~main__sum~0 351) (<= main_~main__i~0 27) (<= 26 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6142#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:39,316 INFO L273 TraceCheckUtils]: 35: Hoare triple {6142#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {6009#false} is VALID [2018-11-14 17:36:39,316 INFO L273 TraceCheckUtils]: 36: Hoare triple {6009#false} assume !false; {6009#false} is VALID [2018-11-14 17:36:39,319 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:39,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:39,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-11-14 17:36:39,339 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 37 [2018-11-14 17:36:39,339 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:39,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-14 17:36:39,372 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:39,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-14 17:36:39,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-14 17:36:39,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-11-14 17:36:39,373 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 30 states. [2018-11-14 17:36:41,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:41,560 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-14 17:36:41,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-14 17:36:41,560 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 37 [2018-11-14 17:36:41,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:41,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 17:36:41,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2018-11-14 17:36:41,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 17:36:41,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2018-11-14 17:36:41,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 42 transitions. [2018-11-14 17:36:41,932 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:41,934 INFO L225 Difference]: With dead ends: 42 [2018-11-14 17:36:41,934 INFO L226 Difference]: Without dead ends: 39 [2018-11-14 17:36:41,935 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=869, Unknown=0, NotChecked=0, Total=930 [2018-11-14 17:36:41,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-14 17:36:42,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-14 17:36:42,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:42,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2018-11-14 17:36:42,010 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-14 17:36:42,010 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-14 17:36:42,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:42,011 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-14 17:36:42,011 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-14 17:36:42,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:42,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:42,012 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-14 17:36:42,012 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-14 17:36:42,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:42,012 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-14 17:36:42,012 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-14 17:36:42,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:42,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:42,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:42,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:42,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-14 17:36:42,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-11-14 17:36:42,013 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-11-14 17:36:42,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:42,014 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-11-14 17:36:42,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-14 17:36:42,014 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-14 17:36:42,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-14 17:36:42,014 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:42,014 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:42,014 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:42,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:42,015 INFO L82 PathProgramCache]: Analyzing trace with hash 561175344, now seen corresponding path program 27 times [2018-11-14 17:36:42,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:42,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:42,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:42,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:42,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:42,035 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:42,035 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:42,035 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:42,047 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:36:42,345 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-14 17:36:42,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:42,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:43,062 INFO L256 TraceCheckUtils]: 0: Hoare triple {6373#true} call ULTIMATE.init(); {6373#true} is VALID [2018-11-14 17:36:43,062 INFO L273 TraceCheckUtils]: 1: Hoare triple {6373#true} ~__return_main~0 := 0;~__return_80~0 := 0; {6373#true} is VALID [2018-11-14 17:36:43,063 INFO L273 TraceCheckUtils]: 2: Hoare triple {6373#true} assume true; {6373#true} is VALID [2018-11-14 17:36:43,063 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6373#true} {6373#true} #28#return; {6373#true} is VALID [2018-11-14 17:36:43,063 INFO L256 TraceCheckUtils]: 4: Hoare triple {6373#true} call #t~ret2 := main(); {6373#true} is VALID [2018-11-14 17:36:43,063 INFO L273 TraceCheckUtils]: 5: Hoare triple {6373#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {6373#true} is VALID [2018-11-14 17:36:43,063 INFO L273 TraceCheckUtils]: 6: Hoare triple {6373#true} assume !!(1 <= ~main__n~0); {6373#true} is VALID [2018-11-14 17:36:43,064 INFO L273 TraceCheckUtils]: 7: Hoare triple {6373#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {6399#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:43,065 INFO L273 TraceCheckUtils]: 8: Hoare triple {6399#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6403#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:36:43,066 INFO L273 TraceCheckUtils]: 9: Hoare triple {6403#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6407#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:43,066 INFO L273 TraceCheckUtils]: 10: Hoare triple {6407#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6411#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:43,067 INFO L273 TraceCheckUtils]: 11: Hoare triple {6411#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6415#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:43,067 INFO L273 TraceCheckUtils]: 12: Hoare triple {6415#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6419#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:43,068 INFO L273 TraceCheckUtils]: 13: Hoare triple {6419#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6423#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:43,069 INFO L273 TraceCheckUtils]: 14: Hoare triple {6423#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6427#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:43,070 INFO L273 TraceCheckUtils]: 15: Hoare triple {6427#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6431#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:43,071 INFO L273 TraceCheckUtils]: 16: Hoare triple {6431#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6435#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:43,071 INFO L273 TraceCheckUtils]: 17: Hoare triple {6435#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6439#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:43,091 INFO L273 TraceCheckUtils]: 18: Hoare triple {6439#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6443#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:36:43,093 INFO L273 TraceCheckUtils]: 19: Hoare triple {6443#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6447#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:36:43,094 INFO L273 TraceCheckUtils]: 20: Hoare triple {6447#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6451#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:36:43,094 INFO L273 TraceCheckUtils]: 21: Hoare triple {6451#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6455#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:36:43,095 INFO L273 TraceCheckUtils]: 22: Hoare triple {6455#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6459#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 17:36:43,095 INFO L273 TraceCheckUtils]: 23: Hoare triple {6459#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6463#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 17:36:43,096 INFO L273 TraceCheckUtils]: 24: Hoare triple {6463#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6467#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 17:36:43,097 INFO L273 TraceCheckUtils]: 25: Hoare triple {6467#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6471#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 17:36:43,097 INFO L273 TraceCheckUtils]: 26: Hoare triple {6471#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6475#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 17:36:43,098 INFO L273 TraceCheckUtils]: 27: Hoare triple {6475#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6479#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 17:36:43,099 INFO L273 TraceCheckUtils]: 28: Hoare triple {6479#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6483#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 17:36:43,100 INFO L273 TraceCheckUtils]: 29: Hoare triple {6483#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6487#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-14 17:36:43,101 INFO L273 TraceCheckUtils]: 30: Hoare triple {6487#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6491#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-14 17:36:43,102 INFO L273 TraceCheckUtils]: 31: Hoare triple {6491#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6495#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-14 17:36:43,102 INFO L273 TraceCheckUtils]: 32: Hoare triple {6495#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6499#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-14 17:36:43,103 INFO L273 TraceCheckUtils]: 33: Hoare triple {6499#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6503#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-14 17:36:43,104 INFO L273 TraceCheckUtils]: 34: Hoare triple {6503#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6507#(and (<= 27 main_~main__n~0) (= main_~main__sum~0 378) (<= main_~main__i~0 28))} is VALID [2018-11-14 17:36:43,105 INFO L273 TraceCheckUtils]: 35: Hoare triple {6507#(and (<= 27 main_~main__n~0) (= main_~main__sum~0 378) (<= main_~main__i~0 28))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6511#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:43,106 INFO L273 TraceCheckUtils]: 36: Hoare triple {6511#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {6374#false} is VALID [2018-11-14 17:36:43,106 INFO L273 TraceCheckUtils]: 37: Hoare triple {6374#false} assume !false; {6374#false} is VALID [2018-11-14 17:36:43,109 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:43,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:43,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-11-14 17:36:43,131 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 38 [2018-11-14 17:36:43,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:43,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-14 17:36:43,164 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:43,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-14 17:36:43,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-14 17:36:43,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-11-14 17:36:43,165 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 31 states. [2018-11-14 17:36:45,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:45,418 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-11-14 17:36:45,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-14 17:36:45,418 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 38 [2018-11-14 17:36:45,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:45,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 17:36:45,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-11-14 17:36:45,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 17:36:45,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-11-14 17:36:45,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 43 transitions. [2018-11-14 17:36:45,465 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:45,466 INFO L225 Difference]: With dead ends: 43 [2018-11-14 17:36:45,466 INFO L226 Difference]: Without dead ends: 40 [2018-11-14 17:36:45,467 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=929, Unknown=0, NotChecked=0, Total=992 [2018-11-14 17:36:45,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-14 17:36:45,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-14 17:36:45,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:45,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-14 17:36:45,562 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-14 17:36:45,562 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-14 17:36:45,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:45,563 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-11-14 17:36:45,564 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-11-14 17:36:45,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:45,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:45,564 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-14 17:36:45,565 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-14 17:36:45,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:45,565 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-11-14 17:36:45,565 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-11-14 17:36:45,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:45,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:45,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:45,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:45,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-14 17:36:45,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-11-14 17:36:45,567 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-11-14 17:36:45,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:45,567 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-11-14 17:36:45,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-14 17:36:45,567 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-11-14 17:36:45,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-14 17:36:45,568 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:45,568 INFO L375 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:45,568 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:45,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:45,568 INFO L82 PathProgramCache]: Analyzing trace with hash 216504007, now seen corresponding path program 28 times [2018-11-14 17:36:45,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:45,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:45,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:45,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:45,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:45,577 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:45,577 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:45,577 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:45,605 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:36:45,857 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:36:45,857 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:45,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:46,711 INFO L256 TraceCheckUtils]: 0: Hoare triple {6748#true} call ULTIMATE.init(); {6748#true} is VALID [2018-11-14 17:36:46,711 INFO L273 TraceCheckUtils]: 1: Hoare triple {6748#true} ~__return_main~0 := 0;~__return_80~0 := 0; {6748#true} is VALID [2018-11-14 17:36:46,711 INFO L273 TraceCheckUtils]: 2: Hoare triple {6748#true} assume true; {6748#true} is VALID [2018-11-14 17:36:46,711 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6748#true} {6748#true} #28#return; {6748#true} is VALID [2018-11-14 17:36:46,711 INFO L256 TraceCheckUtils]: 4: Hoare triple {6748#true} call #t~ret2 := main(); {6748#true} is VALID [2018-11-14 17:36:46,712 INFO L273 TraceCheckUtils]: 5: Hoare triple {6748#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {6748#true} is VALID [2018-11-14 17:36:46,712 INFO L273 TraceCheckUtils]: 6: Hoare triple {6748#true} assume !!(1 <= ~main__n~0); {6748#true} is VALID [2018-11-14 17:36:46,712 INFO L273 TraceCheckUtils]: 7: Hoare triple {6748#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {6774#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:46,713 INFO L273 TraceCheckUtils]: 8: Hoare triple {6774#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6778#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-14 17:36:46,713 INFO L273 TraceCheckUtils]: 9: Hoare triple {6778#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6782#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:46,714 INFO L273 TraceCheckUtils]: 10: Hoare triple {6782#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6786#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:46,714 INFO L273 TraceCheckUtils]: 11: Hoare triple {6786#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6790#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:46,715 INFO L273 TraceCheckUtils]: 12: Hoare triple {6790#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6794#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:46,715 INFO L273 TraceCheckUtils]: 13: Hoare triple {6794#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6798#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:46,716 INFO L273 TraceCheckUtils]: 14: Hoare triple {6798#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6802#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:46,717 INFO L273 TraceCheckUtils]: 15: Hoare triple {6802#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6806#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:46,718 INFO L273 TraceCheckUtils]: 16: Hoare triple {6806#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6810#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:46,719 INFO L273 TraceCheckUtils]: 17: Hoare triple {6810#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6814#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:46,720 INFO L273 TraceCheckUtils]: 18: Hoare triple {6814#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6818#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:36:46,721 INFO L273 TraceCheckUtils]: 19: Hoare triple {6818#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6822#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:36:46,722 INFO L273 TraceCheckUtils]: 20: Hoare triple {6822#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6826#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:36:46,723 INFO L273 TraceCheckUtils]: 21: Hoare triple {6826#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6830#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:36:46,724 INFO L273 TraceCheckUtils]: 22: Hoare triple {6830#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6834#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 17:36:46,724 INFO L273 TraceCheckUtils]: 23: Hoare triple {6834#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6838#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 17:36:46,725 INFO L273 TraceCheckUtils]: 24: Hoare triple {6838#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6842#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 17:36:46,726 INFO L273 TraceCheckUtils]: 25: Hoare triple {6842#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6846#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 17:36:46,727 INFO L273 TraceCheckUtils]: 26: Hoare triple {6846#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6850#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 17:36:46,728 INFO L273 TraceCheckUtils]: 27: Hoare triple {6850#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6854#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 17:36:46,729 INFO L273 TraceCheckUtils]: 28: Hoare triple {6854#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6858#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 17:36:46,730 INFO L273 TraceCheckUtils]: 29: Hoare triple {6858#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6862#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-14 17:36:46,731 INFO L273 TraceCheckUtils]: 30: Hoare triple {6862#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6866#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-14 17:36:46,732 INFO L273 TraceCheckUtils]: 31: Hoare triple {6866#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6870#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-14 17:36:46,732 INFO L273 TraceCheckUtils]: 32: Hoare triple {6870#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6874#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-14 17:36:46,733 INFO L273 TraceCheckUtils]: 33: Hoare triple {6874#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6878#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-14 17:36:46,734 INFO L273 TraceCheckUtils]: 34: Hoare triple {6878#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6882#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-14 17:36:46,735 INFO L273 TraceCheckUtils]: 35: Hoare triple {6882#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6886#(and (<= 28 main_~main__n~0) (<= main_~main__i~0 29) (= main_~main__sum~0 406))} is VALID [2018-11-14 17:36:46,736 INFO L273 TraceCheckUtils]: 36: Hoare triple {6886#(and (<= 28 main_~main__n~0) (<= main_~main__i~0 29) (= main_~main__sum~0 406))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6890#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:46,737 INFO L273 TraceCheckUtils]: 37: Hoare triple {6890#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {6749#false} is VALID [2018-11-14 17:36:46,737 INFO L273 TraceCheckUtils]: 38: Hoare triple {6749#false} assume !false; {6749#false} is VALID [2018-11-14 17:36:46,741 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:46,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:46,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-11-14 17:36:46,761 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 39 [2018-11-14 17:36:46,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:46,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-14 17:36:46,808 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:46,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-14 17:36:46,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-14 17:36:46,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-11-14 17:36:46,810 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 32 states. [2018-11-14 17:36:49,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:49,133 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-11-14 17:36:49,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-14 17:36:49,133 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 39 [2018-11-14 17:36:49,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:49,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 17:36:49,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2018-11-14 17:36:49,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 17:36:49,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2018-11-14 17:36:49,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 44 transitions. [2018-11-14 17:36:49,179 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:49,180 INFO L225 Difference]: With dead ends: 44 [2018-11-14 17:36:49,180 INFO L226 Difference]: Without dead ends: 41 [2018-11-14 17:36:49,181 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=991, Unknown=0, NotChecked=0, Total=1056 [2018-11-14 17:36:49,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-14 17:36:49,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-14 17:36:49,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:49,261 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 41 states. [2018-11-14 17:36:49,262 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-14 17:36:49,262 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-14 17:36:49,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:49,263 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-11-14 17:36:49,263 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-11-14 17:36:49,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:49,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:49,263 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-14 17:36:49,264 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-14 17:36:49,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:49,264 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-11-14 17:36:49,264 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-11-14 17:36:49,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:49,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:49,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:49,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:49,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 17:36:49,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-11-14 17:36:49,265 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-11-14 17:36:49,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:49,266 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-11-14 17:36:49,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-14 17:36:49,266 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-11-14 17:36:49,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-14 17:36:49,266 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:49,266 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:49,266 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:49,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:49,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1878372848, now seen corresponding path program 29 times [2018-11-14 17:36:49,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:49,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:49,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:49,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:49,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:49,275 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:49,275 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:49,275 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:49,292 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:36:49,351 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-11-14 17:36:49,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:49,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:50,178 INFO L256 TraceCheckUtils]: 0: Hoare triple {7133#true} call ULTIMATE.init(); {7133#true} is VALID [2018-11-14 17:36:50,178 INFO L273 TraceCheckUtils]: 1: Hoare triple {7133#true} ~__return_main~0 := 0;~__return_80~0 := 0; {7133#true} is VALID [2018-11-14 17:36:50,179 INFO L273 TraceCheckUtils]: 2: Hoare triple {7133#true} assume true; {7133#true} is VALID [2018-11-14 17:36:50,179 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7133#true} {7133#true} #28#return; {7133#true} is VALID [2018-11-14 17:36:50,179 INFO L256 TraceCheckUtils]: 4: Hoare triple {7133#true} call #t~ret2 := main(); {7133#true} is VALID [2018-11-14 17:36:50,179 INFO L273 TraceCheckUtils]: 5: Hoare triple {7133#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {7133#true} is VALID [2018-11-14 17:36:50,179 INFO L273 TraceCheckUtils]: 6: Hoare triple {7133#true} assume !!(1 <= ~main__n~0); {7133#true} is VALID [2018-11-14 17:36:50,180 INFO L273 TraceCheckUtils]: 7: Hoare triple {7133#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {7159#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:50,180 INFO L273 TraceCheckUtils]: 8: Hoare triple {7159#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7163#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:36:50,181 INFO L273 TraceCheckUtils]: 9: Hoare triple {7163#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7167#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:50,181 INFO L273 TraceCheckUtils]: 10: Hoare triple {7167#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7171#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:50,182 INFO L273 TraceCheckUtils]: 11: Hoare triple {7171#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7175#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:50,182 INFO L273 TraceCheckUtils]: 12: Hoare triple {7175#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7179#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:50,183 INFO L273 TraceCheckUtils]: 13: Hoare triple {7179#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7183#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:50,184 INFO L273 TraceCheckUtils]: 14: Hoare triple {7183#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7187#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:50,185 INFO L273 TraceCheckUtils]: 15: Hoare triple {7187#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7191#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:50,186 INFO L273 TraceCheckUtils]: 16: Hoare triple {7191#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7195#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:50,186 INFO L273 TraceCheckUtils]: 17: Hoare triple {7195#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7199#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:50,187 INFO L273 TraceCheckUtils]: 18: Hoare triple {7199#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7203#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:36:50,188 INFO L273 TraceCheckUtils]: 19: Hoare triple {7203#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7207#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:36:50,189 INFO L273 TraceCheckUtils]: 20: Hoare triple {7207#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7211#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:36:50,190 INFO L273 TraceCheckUtils]: 21: Hoare triple {7211#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7215#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:36:50,191 INFO L273 TraceCheckUtils]: 22: Hoare triple {7215#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7219#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 17:36:50,192 INFO L273 TraceCheckUtils]: 23: Hoare triple {7219#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7223#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 17:36:50,193 INFO L273 TraceCheckUtils]: 24: Hoare triple {7223#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7227#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 17:36:50,194 INFO L273 TraceCheckUtils]: 25: Hoare triple {7227#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7231#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 17:36:50,194 INFO L273 TraceCheckUtils]: 26: Hoare triple {7231#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7235#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 17:36:50,195 INFO L273 TraceCheckUtils]: 27: Hoare triple {7235#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7239#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 17:36:50,196 INFO L273 TraceCheckUtils]: 28: Hoare triple {7239#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7243#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 17:36:50,197 INFO L273 TraceCheckUtils]: 29: Hoare triple {7243#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7247#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-14 17:36:50,198 INFO L273 TraceCheckUtils]: 30: Hoare triple {7247#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7251#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-14 17:36:50,199 INFO L273 TraceCheckUtils]: 31: Hoare triple {7251#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7255#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-14 17:36:50,200 INFO L273 TraceCheckUtils]: 32: Hoare triple {7255#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7259#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-14 17:36:50,200 INFO L273 TraceCheckUtils]: 33: Hoare triple {7259#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7263#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-14 17:36:50,201 INFO L273 TraceCheckUtils]: 34: Hoare triple {7263#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7267#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-14 17:36:50,202 INFO L273 TraceCheckUtils]: 35: Hoare triple {7267#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7271#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-14 17:36:50,203 INFO L273 TraceCheckUtils]: 36: Hoare triple {7271#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7275#(and (= main_~main__sum~0 435) (<= main_~main__i~0 30) (<= 29 main_~main__n~0))} is VALID [2018-11-14 17:36:50,204 INFO L273 TraceCheckUtils]: 37: Hoare triple {7275#(and (= main_~main__sum~0 435) (<= main_~main__i~0 30) (<= 29 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7279#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:50,205 INFO L273 TraceCheckUtils]: 38: Hoare triple {7279#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {7134#false} is VALID [2018-11-14 17:36:50,205 INFO L273 TraceCheckUtils]: 39: Hoare triple {7134#false} assume !false; {7134#false} is VALID [2018-11-14 17:36:50,209 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:50,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:50,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-11-14 17:36:50,229 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 40 [2018-11-14 17:36:50,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:50,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-14 17:36:50,266 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:50,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-14 17:36:50,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-14 17:36:50,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-11-14 17:36:50,267 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 33 states. [2018-11-14 17:36:52,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:52,855 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-14 17:36:52,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-14 17:36:52,855 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 40 [2018-11-14 17:36:52,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:52,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 17:36:52,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2018-11-14 17:36:52,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 17:36:52,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2018-11-14 17:36:52,858 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 45 transitions. [2018-11-14 17:36:52,971 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:52,972 INFO L225 Difference]: With dead ends: 45 [2018-11-14 17:36:52,972 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 17:36:52,973 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=67, Invalid=1055, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 17:36:52,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 17:36:53,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-14 17:36:53,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:53,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-14 17:36:53,096 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-14 17:36:53,097 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-14 17:36:53,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:53,098 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-14 17:36:53,098 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-14 17:36:53,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:53,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:53,098 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-14 17:36:53,098 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-14 17:36:53,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:53,099 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-14 17:36:53,099 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-14 17:36:53,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:53,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:53,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:53,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:53,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 17:36:53,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-11-14 17:36:53,100 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-11-14 17:36:53,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:53,100 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-11-14 17:36:53,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-14 17:36:53,101 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-14 17:36:53,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-14 17:36:53,101 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:53,101 INFO L375 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:53,102 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:53,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:53,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1899921383, now seen corresponding path program 30 times [2018-11-14 17:36:53,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:53,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:53,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:53,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:53,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:53,110 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:53,110 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:53,110 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:53,123 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:36:53,262 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-11-14 17:36:53,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:53,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:54,250 INFO L256 TraceCheckUtils]: 0: Hoare triple {7528#true} call ULTIMATE.init(); {7528#true} is VALID [2018-11-14 17:36:54,250 INFO L273 TraceCheckUtils]: 1: Hoare triple {7528#true} ~__return_main~0 := 0;~__return_80~0 := 0; {7528#true} is VALID [2018-11-14 17:36:54,250 INFO L273 TraceCheckUtils]: 2: Hoare triple {7528#true} assume true; {7528#true} is VALID [2018-11-14 17:36:54,251 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7528#true} {7528#true} #28#return; {7528#true} is VALID [2018-11-14 17:36:54,251 INFO L256 TraceCheckUtils]: 4: Hoare triple {7528#true} call #t~ret2 := main(); {7528#true} is VALID [2018-11-14 17:36:54,251 INFO L273 TraceCheckUtils]: 5: Hoare triple {7528#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {7528#true} is VALID [2018-11-14 17:36:54,251 INFO L273 TraceCheckUtils]: 6: Hoare triple {7528#true} assume !!(1 <= ~main__n~0); {7528#true} is VALID [2018-11-14 17:36:54,252 INFO L273 TraceCheckUtils]: 7: Hoare triple {7528#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {7554#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:54,253 INFO L273 TraceCheckUtils]: 8: Hoare triple {7554#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7558#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:36:54,253 INFO L273 TraceCheckUtils]: 9: Hoare triple {7558#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7562#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:54,254 INFO L273 TraceCheckUtils]: 10: Hoare triple {7562#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7566#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:54,254 INFO L273 TraceCheckUtils]: 11: Hoare triple {7566#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7570#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:54,255 INFO L273 TraceCheckUtils]: 12: Hoare triple {7570#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7574#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:54,276 INFO L273 TraceCheckUtils]: 13: Hoare triple {7574#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7578#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:54,293 INFO L273 TraceCheckUtils]: 14: Hoare triple {7578#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7582#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:54,306 INFO L273 TraceCheckUtils]: 15: Hoare triple {7582#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7586#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:54,315 INFO L273 TraceCheckUtils]: 16: Hoare triple {7586#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7590#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:54,327 INFO L273 TraceCheckUtils]: 17: Hoare triple {7590#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7594#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:54,340 INFO L273 TraceCheckUtils]: 18: Hoare triple {7594#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7598#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:36:54,352 INFO L273 TraceCheckUtils]: 19: Hoare triple {7598#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7602#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:36:54,364 INFO L273 TraceCheckUtils]: 20: Hoare triple {7602#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7606#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:36:54,365 INFO L273 TraceCheckUtils]: 21: Hoare triple {7606#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7610#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:36:54,369 INFO L273 TraceCheckUtils]: 22: Hoare triple {7610#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7614#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 17:36:54,369 INFO L273 TraceCheckUtils]: 23: Hoare triple {7614#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7618#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 17:36:54,370 INFO L273 TraceCheckUtils]: 24: Hoare triple {7618#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7622#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 17:36:54,370 INFO L273 TraceCheckUtils]: 25: Hoare triple {7622#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7626#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 17:36:54,371 INFO L273 TraceCheckUtils]: 26: Hoare triple {7626#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7630#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 17:36:54,372 INFO L273 TraceCheckUtils]: 27: Hoare triple {7630#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7634#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 17:36:54,372 INFO L273 TraceCheckUtils]: 28: Hoare triple {7634#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7638#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 17:36:54,373 INFO L273 TraceCheckUtils]: 29: Hoare triple {7638#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7642#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-14 17:36:54,374 INFO L273 TraceCheckUtils]: 30: Hoare triple {7642#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7646#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-14 17:36:54,375 INFO L273 TraceCheckUtils]: 31: Hoare triple {7646#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7650#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-14 17:36:54,376 INFO L273 TraceCheckUtils]: 32: Hoare triple {7650#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7654#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-14 17:36:54,377 INFO L273 TraceCheckUtils]: 33: Hoare triple {7654#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7658#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-14 17:36:54,378 INFO L273 TraceCheckUtils]: 34: Hoare triple {7658#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7662#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-14 17:36:54,378 INFO L273 TraceCheckUtils]: 35: Hoare triple {7662#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7666#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-14 17:36:54,379 INFO L273 TraceCheckUtils]: 36: Hoare triple {7666#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7670#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-14 17:36:54,380 INFO L273 TraceCheckUtils]: 37: Hoare triple {7670#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7674#(and (<= main_~main__i~0 31) (= main_~main__sum~0 465) (<= 30 main_~main__n~0))} is VALID [2018-11-14 17:36:54,382 INFO L273 TraceCheckUtils]: 38: Hoare triple {7674#(and (<= main_~main__i~0 31) (= main_~main__sum~0 465) (<= 30 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7678#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:54,382 INFO L273 TraceCheckUtils]: 39: Hoare triple {7678#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {7529#false} is VALID [2018-11-14 17:36:54,382 INFO L273 TraceCheckUtils]: 40: Hoare triple {7529#false} assume !false; {7529#false} is VALID [2018-11-14 17:36:54,386 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:54,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:54,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-11-14 17:36:54,406 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 41 [2018-11-14 17:36:54,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:54,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-14 17:36:54,444 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:54,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-14 17:36:54,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-14 17:36:54,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 17:36:54,445 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 34 states. [2018-11-14 17:36:57,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:57,223 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-14 17:36:57,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-14 17:36:57,223 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 41 [2018-11-14 17:36:57,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:57,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 17:36:57,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2018-11-14 17:36:57,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 17:36:57,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2018-11-14 17:36:57,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 46 transitions. [2018-11-14 17:36:57,272 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:57,273 INFO L225 Difference]: With dead ends: 46 [2018-11-14 17:36:57,273 INFO L226 Difference]: Without dead ends: 43 [2018-11-14 17:36:57,274 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=1121, Unknown=0, NotChecked=0, Total=1190 [2018-11-14 17:36:57,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-14 17:36:57,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-14 17:36:57,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:57,372 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2018-11-14 17:36:57,372 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-14 17:36:57,372 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-14 17:36:57,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:57,373 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-11-14 17:36:57,374 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-11-14 17:36:57,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:57,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:57,374 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-14 17:36:57,374 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-14 17:36:57,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:57,375 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-11-14 17:36:57,375 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-11-14 17:36:57,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:57,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:57,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:57,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:57,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-14 17:36:57,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-11-14 17:36:57,376 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-11-14 17:36:57,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:57,376 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-11-14 17:36:57,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-14 17:36:57,376 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-11-14 17:36:57,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-14 17:36:57,377 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:57,377 INFO L375 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:57,377 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:57,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:57,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1232041744, now seen corresponding path program 31 times [2018-11-14 17:36:57,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:57,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:57,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:57,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:57,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:57,386 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:57,387 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:57,387 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:57,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:36:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:57,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:58,429 INFO L256 TraceCheckUtils]: 0: Hoare triple {7933#true} call ULTIMATE.init(); {7933#true} is VALID [2018-11-14 17:36:58,429 INFO L273 TraceCheckUtils]: 1: Hoare triple {7933#true} ~__return_main~0 := 0;~__return_80~0 := 0; {7933#true} is VALID [2018-11-14 17:36:58,429 INFO L273 TraceCheckUtils]: 2: Hoare triple {7933#true} assume true; {7933#true} is VALID [2018-11-14 17:36:58,429 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7933#true} {7933#true} #28#return; {7933#true} is VALID [2018-11-14 17:36:58,430 INFO L256 TraceCheckUtils]: 4: Hoare triple {7933#true} call #t~ret2 := main(); {7933#true} is VALID [2018-11-14 17:36:58,430 INFO L273 TraceCheckUtils]: 5: Hoare triple {7933#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {7933#true} is VALID [2018-11-14 17:36:58,430 INFO L273 TraceCheckUtils]: 6: Hoare triple {7933#true} assume !!(1 <= ~main__n~0); {7933#true} is VALID [2018-11-14 17:36:58,431 INFO L273 TraceCheckUtils]: 7: Hoare triple {7933#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {7959#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:58,431 INFO L273 TraceCheckUtils]: 8: Hoare triple {7959#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7963#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-14 17:36:58,432 INFO L273 TraceCheckUtils]: 9: Hoare triple {7963#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7967#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:58,432 INFO L273 TraceCheckUtils]: 10: Hoare triple {7967#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7971#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:58,433 INFO L273 TraceCheckUtils]: 11: Hoare triple {7971#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7975#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:58,434 INFO L273 TraceCheckUtils]: 12: Hoare triple {7975#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7979#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:58,435 INFO L273 TraceCheckUtils]: 13: Hoare triple {7979#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7983#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:58,436 INFO L273 TraceCheckUtils]: 14: Hoare triple {7983#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7987#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:58,437 INFO L273 TraceCheckUtils]: 15: Hoare triple {7987#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7991#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:58,437 INFO L273 TraceCheckUtils]: 16: Hoare triple {7991#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7995#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:58,438 INFO L273 TraceCheckUtils]: 17: Hoare triple {7995#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7999#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:58,439 INFO L273 TraceCheckUtils]: 18: Hoare triple {7999#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8003#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:36:58,440 INFO L273 TraceCheckUtils]: 19: Hoare triple {8003#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8007#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:36:58,441 INFO L273 TraceCheckUtils]: 20: Hoare triple {8007#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8011#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:36:58,442 INFO L273 TraceCheckUtils]: 21: Hoare triple {8011#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8015#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:36:58,443 INFO L273 TraceCheckUtils]: 22: Hoare triple {8015#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8019#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 17:36:58,444 INFO L273 TraceCheckUtils]: 23: Hoare triple {8019#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8023#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 17:36:58,445 INFO L273 TraceCheckUtils]: 24: Hoare triple {8023#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8027#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 17:36:58,446 INFO L273 TraceCheckUtils]: 25: Hoare triple {8027#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8031#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 17:36:58,446 INFO L273 TraceCheckUtils]: 26: Hoare triple {8031#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8035#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 17:36:58,447 INFO L273 TraceCheckUtils]: 27: Hoare triple {8035#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8039#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 17:36:58,448 INFO L273 TraceCheckUtils]: 28: Hoare triple {8039#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8043#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 17:36:58,449 INFO L273 TraceCheckUtils]: 29: Hoare triple {8043#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8047#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-14 17:36:58,450 INFO L273 TraceCheckUtils]: 30: Hoare triple {8047#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8051#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-14 17:36:58,451 INFO L273 TraceCheckUtils]: 31: Hoare triple {8051#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8055#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-14 17:36:58,451 INFO L273 TraceCheckUtils]: 32: Hoare triple {8055#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8059#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-14 17:36:58,452 INFO L273 TraceCheckUtils]: 33: Hoare triple {8059#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8063#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-14 17:36:58,453 INFO L273 TraceCheckUtils]: 34: Hoare triple {8063#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8067#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-14 17:36:58,454 INFO L273 TraceCheckUtils]: 35: Hoare triple {8067#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8071#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-14 17:36:58,455 INFO L273 TraceCheckUtils]: 36: Hoare triple {8071#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8075#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-14 17:36:58,456 INFO L273 TraceCheckUtils]: 37: Hoare triple {8075#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8079#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-14 17:36:58,457 INFO L273 TraceCheckUtils]: 38: Hoare triple {8079#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8083#(and (<= 31 main_~main__n~0) (= main_~main__sum~0 496) (<= main_~main__i~0 32))} is VALID [2018-11-14 17:36:58,458 INFO L273 TraceCheckUtils]: 39: Hoare triple {8083#(and (<= 31 main_~main__n~0) (= main_~main__sum~0 496) (<= main_~main__i~0 32))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8087#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:58,459 INFO L273 TraceCheckUtils]: 40: Hoare triple {8087#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {7934#false} is VALID [2018-11-14 17:36:58,459 INFO L273 TraceCheckUtils]: 41: Hoare triple {7934#false} assume !false; {7934#false} is VALID [2018-11-14 17:36:58,463 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:58,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:58,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-11-14 17:36:58,483 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 42 [2018-11-14 17:36:58,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:58,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-14 17:36:58,522 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:58,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-14 17:36:58,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-14 17:36:58,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-11-14 17:36:58,524 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 35 states. [2018-11-14 17:37:01,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:01,410 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-11-14 17:37:01,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-14 17:37:01,410 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 42 [2018-11-14 17:37:01,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:37:01,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 17:37:01,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2018-11-14 17:37:01,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 17:37:01,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2018-11-14 17:37:01,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 47 transitions. [2018-11-14 17:37:01,455 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:01,456 INFO L225 Difference]: With dead ends: 47 [2018-11-14 17:37:01,456 INFO L226 Difference]: Without dead ends: 44 [2018-11-14 17:37:01,458 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=1189, Unknown=0, NotChecked=0, Total=1260 [2018-11-14 17:37:01,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-14 17:37:01,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-14 17:37:01,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:37:01,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2018-11-14 17:37:01,569 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-14 17:37:01,570 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-14 17:37:01,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:01,571 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-11-14 17:37:01,571 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-14 17:37:01,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:01,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:01,571 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-14 17:37:01,571 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-14 17:37:01,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:01,572 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-11-14 17:37:01,572 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-14 17:37:01,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:01,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:01,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:37:01,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:37:01,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 17:37:01,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-11-14 17:37:01,574 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-11-14 17:37:01,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:37:01,574 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-11-14 17:37:01,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-14 17:37:01,574 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-14 17:37:01,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-14 17:37:01,575 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:37:01,575 INFO L375 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:37:01,575 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:37:01,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:37:01,575 INFO L82 PathProgramCache]: Analyzing trace with hash 461349127, now seen corresponding path program 32 times [2018-11-14 17:37:01,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:37:01,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:37:01,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:01,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:37:01,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:01,584 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:37:01,584 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:37:01,584 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:37:01,595 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:37:01,642 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:37:01,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:37:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:01,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:37:02,570 INFO L256 TraceCheckUtils]: 0: Hoare triple {8348#true} call ULTIMATE.init(); {8348#true} is VALID [2018-11-14 17:37:02,570 INFO L273 TraceCheckUtils]: 1: Hoare triple {8348#true} ~__return_main~0 := 0;~__return_80~0 := 0; {8348#true} is VALID [2018-11-14 17:37:02,570 INFO L273 TraceCheckUtils]: 2: Hoare triple {8348#true} assume true; {8348#true} is VALID [2018-11-14 17:37:02,571 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8348#true} {8348#true} #28#return; {8348#true} is VALID [2018-11-14 17:37:02,571 INFO L256 TraceCheckUtils]: 4: Hoare triple {8348#true} call #t~ret2 := main(); {8348#true} is VALID [2018-11-14 17:37:02,571 INFO L273 TraceCheckUtils]: 5: Hoare triple {8348#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {8348#true} is VALID [2018-11-14 17:37:02,571 INFO L273 TraceCheckUtils]: 6: Hoare triple {8348#true} assume !!(1 <= ~main__n~0); {8348#true} is VALID [2018-11-14 17:37:02,572 INFO L273 TraceCheckUtils]: 7: Hoare triple {8348#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {8374#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:37:02,573 INFO L273 TraceCheckUtils]: 8: Hoare triple {8374#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8378#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-14 17:37:02,573 INFO L273 TraceCheckUtils]: 9: Hoare triple {8378#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8382#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:37:02,574 INFO L273 TraceCheckUtils]: 10: Hoare triple {8382#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8386#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:37:02,574 INFO L273 TraceCheckUtils]: 11: Hoare triple {8386#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8390#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:37:02,575 INFO L273 TraceCheckUtils]: 12: Hoare triple {8390#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8394#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:37:02,575 INFO L273 TraceCheckUtils]: 13: Hoare triple {8394#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8398#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:37:02,576 INFO L273 TraceCheckUtils]: 14: Hoare triple {8398#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8402#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:37:02,577 INFO L273 TraceCheckUtils]: 15: Hoare triple {8402#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8406#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:37:02,578 INFO L273 TraceCheckUtils]: 16: Hoare triple {8406#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8410#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:37:02,578 INFO L273 TraceCheckUtils]: 17: Hoare triple {8410#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8414#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:37:02,579 INFO L273 TraceCheckUtils]: 18: Hoare triple {8414#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8418#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:37:02,580 INFO L273 TraceCheckUtils]: 19: Hoare triple {8418#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8422#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:37:02,581 INFO L273 TraceCheckUtils]: 20: Hoare triple {8422#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8426#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:37:02,582 INFO L273 TraceCheckUtils]: 21: Hoare triple {8426#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8430#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:37:02,583 INFO L273 TraceCheckUtils]: 22: Hoare triple {8430#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8434#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 17:37:02,583 INFO L273 TraceCheckUtils]: 23: Hoare triple {8434#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8438#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 17:37:02,584 INFO L273 TraceCheckUtils]: 24: Hoare triple {8438#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8442#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 17:37:02,585 INFO L273 TraceCheckUtils]: 25: Hoare triple {8442#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8446#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 17:37:02,586 INFO L273 TraceCheckUtils]: 26: Hoare triple {8446#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8450#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 17:37:02,587 INFO L273 TraceCheckUtils]: 27: Hoare triple {8450#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8454#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 17:37:02,588 INFO L273 TraceCheckUtils]: 28: Hoare triple {8454#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8458#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 17:37:02,588 INFO L273 TraceCheckUtils]: 29: Hoare triple {8458#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8462#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-14 17:37:02,589 INFO L273 TraceCheckUtils]: 30: Hoare triple {8462#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8466#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-14 17:37:02,590 INFO L273 TraceCheckUtils]: 31: Hoare triple {8466#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8470#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-14 17:37:02,591 INFO L273 TraceCheckUtils]: 32: Hoare triple {8470#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8474#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-14 17:37:02,592 INFO L273 TraceCheckUtils]: 33: Hoare triple {8474#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8478#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-14 17:37:02,592 INFO L273 TraceCheckUtils]: 34: Hoare triple {8478#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8482#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-14 17:37:02,593 INFO L273 TraceCheckUtils]: 35: Hoare triple {8482#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8486#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-14 17:37:02,594 INFO L273 TraceCheckUtils]: 36: Hoare triple {8486#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8490#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-14 17:37:02,595 INFO L273 TraceCheckUtils]: 37: Hoare triple {8490#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8494#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-14 17:37:02,596 INFO L273 TraceCheckUtils]: 38: Hoare triple {8494#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8498#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-14 17:37:02,597 INFO L273 TraceCheckUtils]: 39: Hoare triple {8498#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8502#(and (<= 32 main_~main__n~0) (<= main_~main__i~0 33) (= main_~main__sum~0 528))} is VALID [2018-11-14 17:37:02,598 INFO L273 TraceCheckUtils]: 40: Hoare triple {8502#(and (<= 32 main_~main__n~0) (<= main_~main__i~0 33) (= main_~main__sum~0 528))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8506#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:37:02,598 INFO L273 TraceCheckUtils]: 41: Hoare triple {8506#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {8349#false} is VALID [2018-11-14 17:37:02,599 INFO L273 TraceCheckUtils]: 42: Hoare triple {8349#false} assume !false; {8349#false} is VALID [2018-11-14 17:37:02,603 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:02,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:37:02,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-11-14 17:37:02,624 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 43 [2018-11-14 17:37:02,624 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:37:02,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-14 17:37:02,697 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:02,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-14 17:37:02,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-14 17:37:02,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-11-14 17:37:02,698 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 36 states. [2018-11-14 17:37:05,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:05,678 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-11-14 17:37:05,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-14 17:37:05,679 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 43 [2018-11-14 17:37:05,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:37:05,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 17:37:05,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2018-11-14 17:37:05,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 17:37:05,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2018-11-14 17:37:05,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 48 transitions. [2018-11-14 17:37:05,723 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:05,724 INFO L225 Difference]: With dead ends: 48 [2018-11-14 17:37:05,725 INFO L226 Difference]: Without dead ends: 45 [2018-11-14 17:37:05,726 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=1259, Unknown=0, NotChecked=0, Total=1332 [2018-11-14 17:37:05,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-14 17:37:05,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-14 17:37:05,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:37:05,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 45 states. [2018-11-14 17:37:05,816 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2018-11-14 17:37:05,816 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2018-11-14 17:37:05,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:05,817 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-14 17:37:05,818 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-11-14 17:37:05,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:05,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:05,818 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2018-11-14 17:37:05,818 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2018-11-14 17:37:05,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:05,819 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-14 17:37:05,819 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-11-14 17:37:05,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:05,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:05,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:37:05,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:37:05,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-14 17:37:05,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-11-14 17:37:05,820 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-11-14 17:37:05,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:37:05,821 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-11-14 17:37:05,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-14 17:37:05,821 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-11-14 17:37:05,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-14 17:37:05,821 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:37:05,821 INFO L375 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:37:05,822 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:37:05,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:37:05,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1416858576, now seen corresponding path program 33 times [2018-11-14 17:37:05,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:37:05,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:37:05,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:05,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:37:05,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:05,830 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:37:05,831 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:37:05,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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:37:05,845 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:37:06,840 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-14 17:37:06,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:37:06,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:06,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:37:07,990 INFO L256 TraceCheckUtils]: 0: Hoare triple {8773#true} call ULTIMATE.init(); {8773#true} is VALID [2018-11-14 17:37:07,990 INFO L273 TraceCheckUtils]: 1: Hoare triple {8773#true} ~__return_main~0 := 0;~__return_80~0 := 0; {8773#true} is VALID [2018-11-14 17:37:07,990 INFO L273 TraceCheckUtils]: 2: Hoare triple {8773#true} assume true; {8773#true} is VALID [2018-11-14 17:37:07,990 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8773#true} {8773#true} #28#return; {8773#true} is VALID [2018-11-14 17:37:07,991 INFO L256 TraceCheckUtils]: 4: Hoare triple {8773#true} call #t~ret2 := main(); {8773#true} is VALID [2018-11-14 17:37:07,991 INFO L273 TraceCheckUtils]: 5: Hoare triple {8773#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {8773#true} is VALID [2018-11-14 17:37:07,991 INFO L273 TraceCheckUtils]: 6: Hoare triple {8773#true} assume !!(1 <= ~main__n~0); {8773#true} is VALID [2018-11-14 17:37:07,991 INFO L273 TraceCheckUtils]: 7: Hoare triple {8773#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {8799#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:37:07,992 INFO L273 TraceCheckUtils]: 8: Hoare triple {8799#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8803#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-14 17:37:07,992 INFO L273 TraceCheckUtils]: 9: Hoare triple {8803#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8807#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:37:07,993 INFO L273 TraceCheckUtils]: 10: Hoare triple {8807#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8811#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:37:07,994 INFO L273 TraceCheckUtils]: 11: Hoare triple {8811#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8815#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:37:07,994 INFO L273 TraceCheckUtils]: 12: Hoare triple {8815#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8819#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:37:07,995 INFO L273 TraceCheckUtils]: 13: Hoare triple {8819#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8823#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:37:07,996 INFO L273 TraceCheckUtils]: 14: Hoare triple {8823#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8827#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:37:07,997 INFO L273 TraceCheckUtils]: 15: Hoare triple {8827#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8831#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:37:07,998 INFO L273 TraceCheckUtils]: 16: Hoare triple {8831#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8835#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:37:07,999 INFO L273 TraceCheckUtils]: 17: Hoare triple {8835#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8839#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:37:08,000 INFO L273 TraceCheckUtils]: 18: Hoare triple {8839#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8843#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:37:08,001 INFO L273 TraceCheckUtils]: 19: Hoare triple {8843#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8847#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:37:08,002 INFO L273 TraceCheckUtils]: 20: Hoare triple {8847#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8851#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:37:08,003 INFO L273 TraceCheckUtils]: 21: Hoare triple {8851#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8855#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:37:08,004 INFO L273 TraceCheckUtils]: 22: Hoare triple {8855#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8859#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 17:37:08,005 INFO L273 TraceCheckUtils]: 23: Hoare triple {8859#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8863#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 17:37:08,006 INFO L273 TraceCheckUtils]: 24: Hoare triple {8863#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8867#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 17:37:08,006 INFO L273 TraceCheckUtils]: 25: Hoare triple {8867#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8871#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 17:37:08,007 INFO L273 TraceCheckUtils]: 26: Hoare triple {8871#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8875#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 17:37:08,008 INFO L273 TraceCheckUtils]: 27: Hoare triple {8875#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8879#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 17:37:08,009 INFO L273 TraceCheckUtils]: 28: Hoare triple {8879#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8883#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 17:37:08,010 INFO L273 TraceCheckUtils]: 29: Hoare triple {8883#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8887#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-14 17:37:08,011 INFO L273 TraceCheckUtils]: 30: Hoare triple {8887#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8891#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-14 17:37:08,012 INFO L273 TraceCheckUtils]: 31: Hoare triple {8891#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8895#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-14 17:37:08,013 INFO L273 TraceCheckUtils]: 32: Hoare triple {8895#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8899#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-14 17:37:08,014 INFO L273 TraceCheckUtils]: 33: Hoare triple {8899#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8903#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-14 17:37:08,014 INFO L273 TraceCheckUtils]: 34: Hoare triple {8903#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8907#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-14 17:37:08,015 INFO L273 TraceCheckUtils]: 35: Hoare triple {8907#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8911#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-14 17:37:08,016 INFO L273 TraceCheckUtils]: 36: Hoare triple {8911#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8915#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-14 17:37:08,017 INFO L273 TraceCheckUtils]: 37: Hoare triple {8915#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8919#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-14 17:37:08,018 INFO L273 TraceCheckUtils]: 38: Hoare triple {8919#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8923#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-14 17:37:08,019 INFO L273 TraceCheckUtils]: 39: Hoare triple {8923#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8927#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-14 17:37:08,020 INFO L273 TraceCheckUtils]: 40: Hoare triple {8927#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8931#(and (<= main_~main__i~0 34) (= main_~main__sum~0 561) (<= 33 main_~main__n~0))} is VALID [2018-11-14 17:37:08,021 INFO L273 TraceCheckUtils]: 41: Hoare triple {8931#(and (<= main_~main__i~0 34) (= main_~main__sum~0 561) (<= 33 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8935#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:37:08,022 INFO L273 TraceCheckUtils]: 42: Hoare triple {8935#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {8774#false} is VALID [2018-11-14 17:37:08,022 INFO L273 TraceCheckUtils]: 43: Hoare triple {8774#false} assume !false; {8774#false} is VALID [2018-11-14 17:37:08,028 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:08,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:37:08,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-11-14 17:37:08,050 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 44 [2018-11-14 17:37:08,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:37:08,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-14 17:37:08,089 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:08,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-14 17:37:08,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-14 17:37:08,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-11-14 17:37:08,091 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 37 states. [2018-11-14 17:37:11,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:11,435 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-11-14 17:37:11,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-14 17:37:11,435 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 44 [2018-11-14 17:37:11,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:37:11,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 17:37:11,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2018-11-14 17:37:11,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 17:37:11,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2018-11-14 17:37:11,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 49 transitions. [2018-11-14 17:37:11,535 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:11,535 INFO L225 Difference]: With dead ends: 49 [2018-11-14 17:37:11,536 INFO L226 Difference]: Without dead ends: 46 [2018-11-14 17:37:11,536 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=75, Invalid=1331, Unknown=0, NotChecked=0, Total=1406 [2018-11-14 17:37:11,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-14 17:37:11,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-14 17:37:11,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:37:11,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2018-11-14 17:37:11,742 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-14 17:37:11,742 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-14 17:37:11,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:11,743 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-14 17:37:11,744 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-14 17:37:11,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:11,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:11,744 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-14 17:37:11,744 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-14 17:37:11,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:11,745 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-14 17:37:11,745 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-14 17:37:11,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:11,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:11,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:37:11,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:37:11,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-14 17:37:11,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-11-14 17:37:11,747 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-11-14 17:37:11,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:37:11,747 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-11-14 17:37:11,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-14 17:37:11,747 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-14 17:37:11,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-14 17:37:11,748 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:37:11,748 INFO L375 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:37:11,748 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:37:11,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:37:11,749 INFO L82 PathProgramCache]: Analyzing trace with hash 972880423, now seen corresponding path program 34 times [2018-11-14 17:37:11,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:37:11,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:37:11,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:11,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:37:11,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:11,758 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:37:11,758 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:37:11,758 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:37:11,768 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:37:12,110 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:37:12,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:37:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:12,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:37:13,051 INFO L256 TraceCheckUtils]: 0: Hoare triple {9208#true} call ULTIMATE.init(); {9208#true} is VALID [2018-11-14 17:37:13,051 INFO L273 TraceCheckUtils]: 1: Hoare triple {9208#true} ~__return_main~0 := 0;~__return_80~0 := 0; {9208#true} is VALID [2018-11-14 17:37:13,051 INFO L273 TraceCheckUtils]: 2: Hoare triple {9208#true} assume true; {9208#true} is VALID [2018-11-14 17:37:13,051 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9208#true} {9208#true} #28#return; {9208#true} is VALID [2018-11-14 17:37:13,052 INFO L256 TraceCheckUtils]: 4: Hoare triple {9208#true} call #t~ret2 := main(); {9208#true} is VALID [2018-11-14 17:37:13,052 INFO L273 TraceCheckUtils]: 5: Hoare triple {9208#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {9208#true} is VALID [2018-11-14 17:37:13,052 INFO L273 TraceCheckUtils]: 6: Hoare triple {9208#true} assume !!(1 <= ~main__n~0); {9208#true} is VALID [2018-11-14 17:37:13,052 INFO L273 TraceCheckUtils]: 7: Hoare triple {9208#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {9234#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:37:13,053 INFO L273 TraceCheckUtils]: 8: Hoare triple {9234#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9238#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-14 17:37:13,053 INFO L273 TraceCheckUtils]: 9: Hoare triple {9238#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9242#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:37:13,054 INFO L273 TraceCheckUtils]: 10: Hoare triple {9242#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9246#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:37:13,054 INFO L273 TraceCheckUtils]: 11: Hoare triple {9246#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9250#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:37:13,055 INFO L273 TraceCheckUtils]: 12: Hoare triple {9250#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9254#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:37:13,055 INFO L273 TraceCheckUtils]: 13: Hoare triple {9254#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9258#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:37:13,056 INFO L273 TraceCheckUtils]: 14: Hoare triple {9258#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9262#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:37:13,057 INFO L273 TraceCheckUtils]: 15: Hoare triple {9262#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9266#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:37:13,058 INFO L273 TraceCheckUtils]: 16: Hoare triple {9266#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9270#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:37:13,059 INFO L273 TraceCheckUtils]: 17: Hoare triple {9270#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9274#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:37:13,060 INFO L273 TraceCheckUtils]: 18: Hoare triple {9274#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9278#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:37:13,061 INFO L273 TraceCheckUtils]: 19: Hoare triple {9278#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9282#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:37:13,062 INFO L273 TraceCheckUtils]: 20: Hoare triple {9282#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9286#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:37:13,062 INFO L273 TraceCheckUtils]: 21: Hoare triple {9286#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9290#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:37:13,063 INFO L273 TraceCheckUtils]: 22: Hoare triple {9290#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9294#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 17:37:13,064 INFO L273 TraceCheckUtils]: 23: Hoare triple {9294#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9298#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 17:37:13,065 INFO L273 TraceCheckUtils]: 24: Hoare triple {9298#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9302#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 17:37:13,066 INFO L273 TraceCheckUtils]: 25: Hoare triple {9302#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9306#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 17:37:13,067 INFO L273 TraceCheckUtils]: 26: Hoare triple {9306#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9310#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 17:37:13,068 INFO L273 TraceCheckUtils]: 27: Hoare triple {9310#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9314#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 17:37:13,068 INFO L273 TraceCheckUtils]: 28: Hoare triple {9314#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9318#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 17:37:13,069 INFO L273 TraceCheckUtils]: 29: Hoare triple {9318#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9322#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-14 17:37:13,070 INFO L273 TraceCheckUtils]: 30: Hoare triple {9322#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9326#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-14 17:37:13,071 INFO L273 TraceCheckUtils]: 31: Hoare triple {9326#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9330#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-14 17:37:13,072 INFO L273 TraceCheckUtils]: 32: Hoare triple {9330#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9334#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-14 17:37:13,073 INFO L273 TraceCheckUtils]: 33: Hoare triple {9334#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9338#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-14 17:37:13,074 INFO L273 TraceCheckUtils]: 34: Hoare triple {9338#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9342#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-14 17:37:13,074 INFO L273 TraceCheckUtils]: 35: Hoare triple {9342#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9346#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-14 17:37:13,075 INFO L273 TraceCheckUtils]: 36: Hoare triple {9346#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9350#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-14 17:37:13,076 INFO L273 TraceCheckUtils]: 37: Hoare triple {9350#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9354#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-14 17:37:13,077 INFO L273 TraceCheckUtils]: 38: Hoare triple {9354#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9358#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-14 17:37:13,078 INFO L273 TraceCheckUtils]: 39: Hoare triple {9358#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9362#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-14 17:37:13,079 INFO L273 TraceCheckUtils]: 40: Hoare triple {9362#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9366#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} is VALID [2018-11-14 17:37:13,080 INFO L273 TraceCheckUtils]: 41: Hoare triple {9366#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9370#(and (<= main_~main__i~0 35) (<= 34 main_~main__n~0) (= main_~main__sum~0 595))} is VALID [2018-11-14 17:37:13,081 INFO L273 TraceCheckUtils]: 42: Hoare triple {9370#(and (<= main_~main__i~0 35) (<= 34 main_~main__n~0) (= main_~main__sum~0 595))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9374#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:37:13,082 INFO L273 TraceCheckUtils]: 43: Hoare triple {9374#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {9209#false} is VALID [2018-11-14 17:37:13,082 INFO L273 TraceCheckUtils]: 44: Hoare triple {9209#false} assume !false; {9209#false} is VALID [2018-11-14 17:37:13,086 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:13,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:37:13,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-11-14 17:37:13,105 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 45 [2018-11-14 17:37:13,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:37:13,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-14 17:37:13,145 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:13,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-14 17:37:13,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-14 17:37:13,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-11-14 17:37:13,146 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 38 states. [2018-11-14 17:37:16,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:16,579 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-11-14 17:37:16,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-14 17:37:16,579 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 45 [2018-11-14 17:37:16,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:37:16,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 17:37:16,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2018-11-14 17:37:16,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 17:37:16,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2018-11-14 17:37:16,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 50 transitions. [2018-11-14 17:37:16,661 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-14 17:37:16,661 INFO L225 Difference]: With dead ends: 50 [2018-11-14 17:37:16,661 INFO L226 Difference]: Without dead ends: 47 [2018-11-14 17:37:16,662 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-14 17:37:16,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-14 17:37:16,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-14 17:37:16,875 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:37:16,876 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2018-11-14 17:37:16,876 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-14 17:37:16,876 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-14 17:37:16,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:16,877 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-11-14 17:37:16,878 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-11-14 17:37:16,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:16,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:16,879 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-14 17:37:16,879 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-14 17:37:16,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:16,880 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-11-14 17:37:16,880 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-11-14 17:37:16,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:16,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:16,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:37:16,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:37:16,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 17:37:16,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-11-14 17:37:16,881 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-11-14 17:37:16,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:37:16,882 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-11-14 17:37:16,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-14 17:37:16,882 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-11-14 17:37:16,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-14 17:37:16,882 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:37:16,883 INFO L375 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:37:16,883 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:37:16,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:37:16,883 INFO L82 PathProgramCache]: Analyzing trace with hash 94459568, now seen corresponding path program 35 times [2018-11-14 17:37:16,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:37:16,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:37:16,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:16,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:37:16,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:16,892 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:37:16,892 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:37:16,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 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-14 17:37:16,909 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:37:16,980 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-11-14 17:37:16,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:37:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:17,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:37:18,084 INFO L256 TraceCheckUtils]: 0: Hoare triple {9653#true} call ULTIMATE.init(); {9653#true} is VALID [2018-11-14 17:37:18,085 INFO L273 TraceCheckUtils]: 1: Hoare triple {9653#true} ~__return_main~0 := 0;~__return_80~0 := 0; {9653#true} is VALID [2018-11-14 17:37:18,085 INFO L273 TraceCheckUtils]: 2: Hoare triple {9653#true} assume true; {9653#true} is VALID [2018-11-14 17:37:18,085 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9653#true} {9653#true} #28#return; {9653#true} is VALID [2018-11-14 17:37:18,085 INFO L256 TraceCheckUtils]: 4: Hoare triple {9653#true} call #t~ret2 := main(); {9653#true} is VALID [2018-11-14 17:37:18,085 INFO L273 TraceCheckUtils]: 5: Hoare triple {9653#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {9653#true} is VALID [2018-11-14 17:37:18,086 INFO L273 TraceCheckUtils]: 6: Hoare triple {9653#true} assume !!(1 <= ~main__n~0); {9653#true} is VALID [2018-11-14 17:37:18,086 INFO L273 TraceCheckUtils]: 7: Hoare triple {9653#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {9679#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:37:18,087 INFO L273 TraceCheckUtils]: 8: Hoare triple {9679#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9683#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-14 17:37:18,088 INFO L273 TraceCheckUtils]: 9: Hoare triple {9683#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9687#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:37:18,088 INFO L273 TraceCheckUtils]: 10: Hoare triple {9687#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9691#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:37:18,089 INFO L273 TraceCheckUtils]: 11: Hoare triple {9691#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9695#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:37:18,090 INFO L273 TraceCheckUtils]: 12: Hoare triple {9695#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9699#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:37:18,090 INFO L273 TraceCheckUtils]: 13: Hoare triple {9699#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9703#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:37:18,091 INFO L273 TraceCheckUtils]: 14: Hoare triple {9703#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9707#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:37:18,092 INFO L273 TraceCheckUtils]: 15: Hoare triple {9707#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9711#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:37:18,093 INFO L273 TraceCheckUtils]: 16: Hoare triple {9711#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9715#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:37:18,094 INFO L273 TraceCheckUtils]: 17: Hoare triple {9715#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9719#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:37:18,095 INFO L273 TraceCheckUtils]: 18: Hoare triple {9719#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9723#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:37:18,096 INFO L273 TraceCheckUtils]: 19: Hoare triple {9723#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9727#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:37:18,097 INFO L273 TraceCheckUtils]: 20: Hoare triple {9727#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9731#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:37:18,098 INFO L273 TraceCheckUtils]: 21: Hoare triple {9731#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9735#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:37:18,099 INFO L273 TraceCheckUtils]: 22: Hoare triple {9735#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9739#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 17:37:18,099 INFO L273 TraceCheckUtils]: 23: Hoare triple {9739#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9743#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 17:37:18,100 INFO L273 TraceCheckUtils]: 24: Hoare triple {9743#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9747#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 17:37:18,101 INFO L273 TraceCheckUtils]: 25: Hoare triple {9747#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9751#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 17:37:18,102 INFO L273 TraceCheckUtils]: 26: Hoare triple {9751#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9755#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 17:37:18,103 INFO L273 TraceCheckUtils]: 27: Hoare triple {9755#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9759#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 17:37:18,104 INFO L273 TraceCheckUtils]: 28: Hoare triple {9759#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9763#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 17:37:18,105 INFO L273 TraceCheckUtils]: 29: Hoare triple {9763#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9767#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-14 17:37:18,106 INFO L273 TraceCheckUtils]: 30: Hoare triple {9767#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9771#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-14 17:37:18,107 INFO L273 TraceCheckUtils]: 31: Hoare triple {9771#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9775#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-14 17:37:18,107 INFO L273 TraceCheckUtils]: 32: Hoare triple {9775#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9779#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-14 17:37:18,108 INFO L273 TraceCheckUtils]: 33: Hoare triple {9779#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9783#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-14 17:37:18,109 INFO L273 TraceCheckUtils]: 34: Hoare triple {9783#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9787#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-14 17:37:18,110 INFO L273 TraceCheckUtils]: 35: Hoare triple {9787#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9791#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-14 17:37:18,111 INFO L273 TraceCheckUtils]: 36: Hoare triple {9791#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9795#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-14 17:37:18,112 INFO L273 TraceCheckUtils]: 37: Hoare triple {9795#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9799#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-14 17:37:18,113 INFO L273 TraceCheckUtils]: 38: Hoare triple {9799#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9803#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-14 17:37:18,114 INFO L273 TraceCheckUtils]: 39: Hoare triple {9803#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9807#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-14 17:37:18,115 INFO L273 TraceCheckUtils]: 40: Hoare triple {9807#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9811#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} is VALID [2018-11-14 17:37:18,115 INFO L273 TraceCheckUtils]: 41: Hoare triple {9811#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9815#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} is VALID [2018-11-14 17:37:18,136 INFO L273 TraceCheckUtils]: 42: Hoare triple {9815#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {9819#(and (<= main_~main__i~0 36) (= main_~main__sum~0 630) (<= 35 main_~main__n~0))} is VALID [2018-11-14 17:37:18,138 INFO L273 TraceCheckUtils]: 43: Hoare triple {9819#(and (<= main_~main__i~0 36) (= main_~main__sum~0 630) (<= 35 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) 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-14 17:37:18,138 INFO L273 TraceCheckUtils]: 44: Hoare triple {9823#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {9654#false} is VALID [2018-11-14 17:37:18,138 INFO L273 TraceCheckUtils]: 45: Hoare triple {9654#false} assume !false; {9654#false} is VALID [2018-11-14 17:37:18,142 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-14 17:37:18,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:37:18,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-11-14 17:37:18,164 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 46 [2018-11-14 17:37:18,164 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:37:18,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2018-11-14 17:37:18,206 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:18,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-14 17:37:18,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-14 17:37:18,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-11-14 17:37:18,208 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 39 states.