java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loops/sum01_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 20:27:40,276 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 20:27:40,278 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 20:27:40,291 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 20:27:40,291 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 20:27:40,292 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 20:27:40,293 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 20:27:40,295 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 20:27:40,297 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 20:27:40,298 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 20:27:40,299 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 20:27:40,299 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 20:27:40,300 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 20:27:40,301 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 20:27:40,302 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 20:27:40,303 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 20:27:40,304 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 20:27:40,306 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 20:27:40,308 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 20:27:40,309 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 20:27:40,310 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 20:27:40,312 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 20:27:40,314 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 20:27:40,315 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 20:27:40,315 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 20:27:40,316 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 20:27:40,317 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 20:27:40,318 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 20:27:40,318 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 20:27:40,320 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 20:27:40,320 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 20:27:40,321 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 20:27:40,321 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 20:27:40,321 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 20:27:40,322 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 20:27:40,323 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 20:27:40,323 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 20:27:40,339 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 20:27:40,340 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 20:27:40,343 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 20:27:40,343 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 20:27:40,344 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 20:27:40,344 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 20:27:40,344 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 20:27:40,344 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 20:27:40,345 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 20:27:40,345 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 20:27:40,345 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 20:27:40,345 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 20:27:40,345 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 20:27:40,346 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 20:27:40,346 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 20:27:40,346 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 20:27:40,348 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 20:27:40,348 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 20:27:40,348 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 20:27:40,349 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 20:27:40,349 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 20:27:40,349 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 20:27:40,349 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 20:27:40,349 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 20:27:40,350 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 20:27:40,350 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:27:40,350 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 20:27:40,350 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 20:27:40,351 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 20:27:40,351 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 20:27:40,351 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 20:27:40,351 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 20:27:40,351 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 20:27:40,352 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 20:27:40,352 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 20:27:40,423 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 20:27:40,440 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 20:27:40,444 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 20:27:40,445 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 20:27:40,446 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 20:27:40,447 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01_false-unreach-call_true-termination.i [2018-11-12 20:27:40,510 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ae5ba82f/ae6914a1d28146adad0e1881b872275e/FLAG92f7e9af2 [2018-11-12 20:27:40,975 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 20:27:40,978 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_false-unreach-call_true-termination.i [2018-11-12 20:27:40,986 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ae5ba82f/ae6914a1d28146adad0e1881b872275e/FLAG92f7e9af2 [2018-11-12 20:27:41,001 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ae5ba82f/ae6914a1d28146adad0e1881b872275e [2018-11-12 20:27:41,012 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 20:27:41,013 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 20:27:41,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 20:27:41,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 20:27:41,018 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 20:27:41,019 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:27:41" (1/1) ... [2018-11-12 20:27:41,023 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c83a8bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:27:41, skipping insertion in model container [2018-11-12 20:27:41,023 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:27:41" (1/1) ... [2018-11-12 20:27:41,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 20:27:41,056 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 20:27:41,259 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:27:41,263 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 20:27:41,281 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:27:41,296 INFO L193 MainTranslator]: Completed translation [2018-11-12 20:27:41,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:27:41 WrapperNode [2018-11-12 20:27:41,297 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 20:27:41,297 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 20:27:41,298 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 20:27:41,298 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 20:27:41,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:27:41" (1/1) ... [2018-11-12 20:27:41,310 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:27:41" (1/1) ... [2018-11-12 20:27:41,315 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 20:27:41,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 20:27:41,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 20:27:41,316 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 20:27:41,324 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:27:41" (1/1) ... [2018-11-12 20:27:41,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:27:41" (1/1) ... [2018-11-12 20:27:41,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:27:41" (1/1) ... [2018-11-12 20:27:41,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:27:41" (1/1) ... [2018-11-12 20:27:41,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:27:41" (1/1) ... [2018-11-12 20:27:41,336 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:27:41" (1/1) ... [2018-11-12 20:27:41,337 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:27:41" (1/1) ... [2018-11-12 20:27:41,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 20:27:41,339 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 20:27:41,339 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 20:27:41,340 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 20:27:41,341 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:27:41" (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-12 20:27:41,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 20:27:41,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 20:27:41,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 20:27:41,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 20:27:41,483 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 20:27:41,483 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 20:27:41,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-12 20:27:41,484 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-12 20:27:41,712 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 20:27:41,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:27:41 BoogieIcfgContainer [2018-11-12 20:27:41,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 20:27:41,714 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 20:27:41,714 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 20:27:41,718 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 20:27:41,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:27:41" (1/3) ... [2018-11-12 20:27:41,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f86151c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:27:41, skipping insertion in model container [2018-11-12 20:27:41,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:27:41" (2/3) ... [2018-11-12 20:27:41,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f86151c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:27:41, skipping insertion in model container [2018-11-12 20:27:41,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:27:41" (3/3) ... [2018-11-12 20:27:41,722 INFO L112 eAbstractionObserver]: Analyzing ICFG sum01_false-unreach-call_true-termination.i [2018-11-12 20:27:41,732 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 20:27:41,741 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 20:27:41,772 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 20:27:41,830 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 20:27:41,831 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 20:27:41,831 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 20:27:41,831 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 20:27:41,831 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 20:27:41,832 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 20:27:41,832 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 20:27:41,832 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 20:27:41,853 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-12 20:27:41,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-12 20:27:41,861 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:27:41,862 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:27:41,867 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:27:41,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:27:41,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1713253442, now seen corresponding path program 1 times [2018-11-12 20:27:41,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:27:41,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:41,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:27:41,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:41,935 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:27:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:27:42,000 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-12 20:27:42,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:27:42,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-12 20:27:42,002 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:27:42,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-12 20:27:42,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-12 20:27:42,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:27:42,022 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-12 20:27:42,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:27:42,042 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-12 20:27:42,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-12 20:27:42,044 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-12 20:27:42,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:27:42,053 INFO L225 Difference]: With dead ends: 31 [2018-11-12 20:27:42,053 INFO L226 Difference]: Without dead ends: 14 [2018-11-12 20:27:42,057 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:27:42,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-12 20:27:42,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-12 20:27:42,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-12 20:27:42,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-12 20:27:42,097 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2018-11-12 20:27:42,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:27:42,098 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-12 20:27:42,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-12 20:27:42,098 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-12 20:27:42,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-12 20:27:42,099 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:27:42,100 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:27:42,100 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:27:42,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:27:42,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1143179357, now seen corresponding path program 1 times [2018-11-12 20:27:42,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:27:42,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:42,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:27:42,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:42,103 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:27:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:27:42,386 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-12 20:27:42,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:27:42,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 20:27:42,387 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:27:42,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 20:27:42,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 20:27:42,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-12 20:27:42,390 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2018-11-12 20:27:42,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:27:42,518 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-12 20:27:42,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-12 20:27:42,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-12 20:27:42,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:27:42,520 INFO L225 Difference]: With dead ends: 23 [2018-11-12 20:27:42,520 INFO L226 Difference]: Without dead ends: 18 [2018-11-12 20:27:42,521 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:27:42,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-12 20:27:42,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-12 20:27:42,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-12 20:27:42,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-11-12 20:27:42,527 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 11 [2018-11-12 20:27:42,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:27:42,527 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-12 20:27:42,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 20:27:42,528 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-12 20:27:42,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-12 20:27:42,528 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:27:42,529 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:27:42,529 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:27:42,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:27:42,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1652058138, now seen corresponding path program 1 times [2018-11-12 20:27:42,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:27:42,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:42,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:27:42,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:42,531 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:27:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:27:42,963 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-11-12 20:27:43,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:43,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:27:43,213 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:27:43,213 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-11-12 20:27:43,215 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [13], [16], [20], [26], [29], [31], [37], [38], [39], [41] [2018-11-12 20:27:43,250 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:27:43,251 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:27:43,350 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:27:43,595 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:27:43,598 INFO L272 AbstractInterpreter]: Visited 14 different actions 76 times. Merged at 5 different actions 35 times. Widened at 1 different actions 3 times. Performed 193 root evaluator evaluations with a maximum evaluation depth of 6. Performed 193 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2018-11-12 20:27:43,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:27:43,609 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:27:43,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:27:43,610 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:27:43,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:27:43,627 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:27:43,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:27:43,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:27:44,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:44,031 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:27:44,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:44,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:27:44,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2018-11-12 20:27:44,718 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:27:44,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-12 20:27:44,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-12 20:27:44,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2018-11-12 20:27:44,723 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 14 states. [2018-11-12 20:27:45,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:27:45,122 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-11-12 20:27:45,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 20:27:45,123 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2018-11-12 20:27:45,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:27:45,124 INFO L225 Difference]: With dead ends: 43 [2018-11-12 20:27:45,124 INFO L226 Difference]: Without dead ends: 26 [2018-11-12 20:27:45,125 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2018-11-12 20:27:45,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-12 20:27:45,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-11-12 20:27:45,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-12 20:27:45,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-12 20:27:45,134 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 15 [2018-11-12 20:27:45,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:27:45,134 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-12 20:27:45,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-12 20:27:45,134 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-12 20:27:45,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-12 20:27:45,135 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:27:45,135 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:27:45,138 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:27:45,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:27:45,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1873071752, now seen corresponding path program 2 times [2018-11-12 20:27:45,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:27:45,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:45,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:27:45,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:45,140 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:27:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:27:45,421 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-12 20:27:45,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:27:45,422 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:27:45,422 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:27:45,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:27:45,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:27:45,423 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:27:45,438 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:27:45,438 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:27:45,465 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-12 20:27:45,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:27:45,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:27:45,741 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:45,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:27:46,276 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:46,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:27:46,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 30 [2018-11-12 20:27:46,297 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:27:46,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-12 20:27:46,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-12 20:27:46,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2018-11-12 20:27:46,298 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 19 states. [2018-11-12 20:27:46,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:27:46,995 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2018-11-12 20:27:46,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-12 20:27:46,997 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-11-12 20:27:46,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:27:46,998 INFO L225 Difference]: With dead ends: 47 [2018-11-12 20:27:46,998 INFO L226 Difference]: Without dead ends: 34 [2018-11-12 20:27:47,000 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=288, Invalid=1604, Unknown=0, NotChecked=0, Total=1892 [2018-11-12 20:27:47,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-12 20:27:47,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-12 20:27:47,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-12 20:27:47,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-11-12 20:27:47,006 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 23 [2018-11-12 20:27:47,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:27:47,007 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-11-12 20:27:47,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-12 20:27:47,007 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-12 20:27:47,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-12 20:27:47,008 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:27:47,008 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:27:47,009 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:27:47,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:27:47,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1162834632, now seen corresponding path program 1 times [2018-11-12 20:27:47,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:27:47,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:47,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:27:47,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:47,011 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:27:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:27:47,110 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:47,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:27:47,111 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:27:47,111 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-11-12 20:27:47,112 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [13], [16], [18], [20], [26], [29], [31], [37], [38], [39], [41] [2018-11-12 20:27:47,113 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:27:47,113 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:27:47,118 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:27:47,277 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:27:47,278 INFO L272 AbstractInterpreter]: Visited 15 different actions 107 times. Merged at 6 different actions 48 times. Widened at 1 different actions 5 times. Performed 281 root evaluator evaluations with a maximum evaluation depth of 6. Performed 281 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 6 fixpoints after 2 different actions. Largest state had 5 variables. [2018-11-12 20:27:47,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:27:47,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:27:47,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:27:47,288 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:27:47,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:27:47,298 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:27:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:27:47,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:27:47,320 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:47,321 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:27:47,460 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:47,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:27:47,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2018-11-12 20:27:47,480 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:27:47,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 20:27:47,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 20:27:47,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-12 20:27:47,482 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 7 states. [2018-11-12 20:27:47,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:27:47,547 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-11-12 20:27:47,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:27:47,549 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-11-12 20:27:47,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:27:47,550 INFO L225 Difference]: With dead ends: 47 [2018-11-12 20:27:47,551 INFO L226 Difference]: Without dead ends: 38 [2018-11-12 20:27:47,551 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-12 20:27:47,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-12 20:27:47,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-11-12 20:27:47,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-12 20:27:47,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-11-12 20:27:47,558 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 31 [2018-11-12 20:27:47,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:27:47,558 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-11-12 20:27:47,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 20:27:47,558 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-11-12 20:27:47,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-12 20:27:47,560 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:27:47,560 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:27:47,560 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:27:47,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:27:47,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1192139823, now seen corresponding path program 2 times [2018-11-12 20:27:47,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:27:47,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:47,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:27:47,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:47,562 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:27:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:27:47,669 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:47,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:27:47,670 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:27:47,670 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:27:47,670 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:27:47,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:27:47,671 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:27:47,691 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:27:47,692 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:27:47,717 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-12 20:27:47,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:27:47,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:27:47,727 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:47,727 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:27:47,829 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:47,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:27:47,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 11 [2018-11-12 20:27:47,849 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:27:47,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-12 20:27:47,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-12 20:27:47,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-12 20:27:47,850 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 8 states. [2018-11-12 20:27:48,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:27:48,035 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-12 20:27:48,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 20:27:48,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-11-12 20:27:48,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:27:48,038 INFO L225 Difference]: With dead ends: 51 [2018-11-12 20:27:48,038 INFO L226 Difference]: Without dead ends: 42 [2018-11-12 20:27:48,038 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-12 20:27:48,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-12 20:27:48,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-12 20:27:48,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-12 20:27:48,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-11-12 20:27:48,045 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 35 [2018-11-12 20:27:48,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:27:48,045 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-11-12 20:27:48,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-12 20:27:48,045 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-11-12 20:27:48,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-12 20:27:48,046 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:27:48,047 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:27:48,047 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:27:48,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:27:48,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1196316582, now seen corresponding path program 3 times [2018-11-12 20:27:48,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:27:48,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:48,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:27:48,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:48,049 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:27:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:27:48,259 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 20 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:48,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:27:48,259 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:27:48,260 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:27:48,260 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:27:48,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:27:48,260 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:27:48,269 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:27:48,269 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:27:48,282 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:27:48,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:27:48,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:27:48,294 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 20 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:48,294 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:27:48,437 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 20 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:48,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:27:48,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2018-11-12 20:27:48,458 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:27:48,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 20:27:48,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 20:27:48,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-12 20:27:48,459 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 9 states. [2018-11-12 20:27:48,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:27:48,524 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-11-12 20:27:48,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 20:27:48,524 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-11-12 20:27:48,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:27:48,525 INFO L225 Difference]: With dead ends: 55 [2018-11-12 20:27:48,526 INFO L226 Difference]: Without dead ends: 46 [2018-11-12 20:27:48,526 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 72 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-12 20:27:48,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-12 20:27:48,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-11-12 20:27:48,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-12 20:27:48,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-11-12 20:27:48,533 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 39 [2018-11-12 20:27:48,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:27:48,533 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-11-12 20:27:48,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 20:27:48,534 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-11-12 20:27:48,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-12 20:27:48,535 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:27:48,535 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:27:48,535 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:27:48,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:27:48,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1640333213, now seen corresponding path program 4 times [2018-11-12 20:27:48,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:27:48,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:48,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:27:48,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:48,537 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:27:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:27:48,684 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 23 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:48,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:27:48,684 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:27:48,685 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:27:48,685 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:27:48,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:27:48,685 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:27:48,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:27:48,697 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:27:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:27:48,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:27:48,733 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 23 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:48,734 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:27:48,835 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 23 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:48,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:27:48,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 11 [2018-11-12 20:27:48,857 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:27:48,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 20:27:48,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 20:27:48,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-12 20:27:48,858 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 10 states. [2018-11-12 20:27:48,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:27:48,944 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-11-12 20:27:48,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-12 20:27:48,945 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-11-12 20:27:48,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:27:48,947 INFO L225 Difference]: With dead ends: 59 [2018-11-12 20:27:48,947 INFO L226 Difference]: Without dead ends: 50 [2018-11-12 20:27:48,947 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 79 SyntacticMatches, 7 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-12 20:27:48,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-12 20:27:48,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-11-12 20:27:48,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-12 20:27:48,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-11-12 20:27:48,954 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 43 [2018-11-12 20:27:48,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:27:48,955 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-11-12 20:27:48,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 20:27:48,955 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-11-12 20:27:48,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-12 20:27:48,956 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:27:48,956 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:27:48,957 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:27:48,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:27:48,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1679174636, now seen corresponding path program 5 times [2018-11-12 20:27:48,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:27:48,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:48,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:27:48,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:48,959 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:27:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:27:49,187 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 26 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:49,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:27:49,187 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:27:49,188 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:27:49,188 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:27:49,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:27:49,188 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:27:49,197 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:27:49,197 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:27:49,235 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-12 20:27:49,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:27:49,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:27:49,248 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 26 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:49,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:27:49,347 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 26 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:49,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:27:49,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 11 [2018-11-12 20:27:49,368 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:27:49,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 20:27:49,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 20:27:49,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-12 20:27:49,370 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 11 states. [2018-11-12 20:27:49,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:27:49,453 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-11-12 20:27:49,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-12 20:27:49,453 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-11-12 20:27:49,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:27:49,455 INFO L225 Difference]: With dead ends: 63 [2018-11-12 20:27:49,455 INFO L226 Difference]: Without dead ends: 54 [2018-11-12 20:27:49,456 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 86 SyntacticMatches, 9 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-12 20:27:49,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-12 20:27:49,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-11-12 20:27:49,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-12 20:27:49,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-11-12 20:27:49,462 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 47 [2018-11-12 20:27:49,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:27:49,463 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-11-12 20:27:49,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 20:27:49,463 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-11-12 20:27:49,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-12 20:27:49,464 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:27:49,465 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:27:49,465 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:27:49,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:27:49,465 INFO L82 PathProgramCache]: Analyzing trace with hash 900655861, now seen corresponding path program 6 times [2018-11-12 20:27:49,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:27:49,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:49,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:27:49,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:49,467 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:27:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-12 20:27:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-12 20:27:49,514 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-12 20:27:49,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 08:27:49 BoogieIcfgContainer [2018-11-12 20:27:49,551 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 20:27:49,552 INFO L168 Benchmark]: Toolchain (without parser) took 8539.49 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 739.2 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -189.7 MB). Peak memory consumption was 549.5 MB. Max. memory is 7.1 GB. [2018-11-12 20:27:49,553 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:27:49,554 INFO L168 Benchmark]: CACSL2BoogieTranslator took 282.69 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-12 20:27:49,555 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.12 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:27:49,555 INFO L168 Benchmark]: Boogie Preprocessor took 23.09 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:27:49,556 INFO L168 Benchmark]: RCFGBuilder took 374.26 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 739.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -789.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-12 20:27:49,557 INFO L168 Benchmark]: TraceAbstraction took 7836.73 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 588.7 MB). Peak memory consumption was 588.7 MB. Max. memory is 7.1 GB. [2018-11-12 20:27:49,562 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 282.69 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 18.12 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.09 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 374.26 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 739.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -789.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7836.73 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 588.7 MB). Peak memory consumption was 588.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L13] i=1 VAL [i=1, n=10, n=0] [L13] COND TRUE i<=n VAL [i=1, n=10, n=0] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=1, n=10, n=2] [L13] i++ VAL [i=2, n=10, n=2] [L13] COND TRUE i<=n VAL [i=2, n=2, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=2, n=4, n=10] [L13] i++ VAL [i=3, n=10, n=4] [L13] COND TRUE i<=n VAL [i=3, n=10, n=4] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=3, n=6, n=10] [L13] i++ VAL [i=4, n=10, n=6] [L13] COND TRUE i<=n VAL [i=4, n=10, n=6] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=4, n=10, n=8] [L13] i++ VAL [i=5, n=10, n=8] [L13] COND TRUE i<=n VAL [i=5, n=8, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=5, n=10, n=10] [L13] i++ VAL [i=6, n=10, n=10] [L13] COND TRUE i<=n VAL [i=6, n=10, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=6, n=12, n=10] [L13] i++ VAL [i=7, n=12, n=10] [L13] COND TRUE i<=n VAL [i=7, n=10, n=12] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=7, n=10, n=14] [L13] i++ VAL [i=8, n=14, n=10] [L13] COND TRUE i<=n VAL [i=8, n=10, n=14] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=8, n=10, n=16] [L13] i++ VAL [i=9, n=10, n=16] [L13] COND TRUE i<=n VAL [i=9, n=16, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=9, n=18, n=10] [L13] i++ VAL [i=10, n=18, n=10] [L13] COND TRUE i<=n VAL [i=10, n=18, n=10] [L14] COND FALSE !(i<10) VAL [i=10, n=10, n=18] [L13] i++ VAL [i=11, n=10, n=18] [L13] COND FALSE !(i<=n) VAL [i=11, n=18, n=10] [L17] CALL __VERIFIER_assert(sn==n*(2) || sn == 0) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 7.7s OverallTime, 10 OverallIterations, 11 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 117 SDtfs, 59 SDslu, 488 SDs, 0 SdLazy, 459 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 552 GetRequests, 411 SyntacticMatches, 27 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 8 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 538 NumberOfCodeBlocks, 538 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 697 ConstructedInterpolants, 12 QuantifiedInterpolants, 73813 SizeOfPredicates, 13 NumberOfNonLiveVariables, 452 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 308/1590 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...