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-EXP.epf -i ../../../trunk/examples/svcomp/loop-new/half_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 10:40:51,404 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 10:40:51,406 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 10:40:51,421 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 10:40:51,421 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 10:40:51,422 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 10:40:51,423 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 10:40:51,425 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 10:40:51,426 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 10:40:51,427 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 10:40:51,428 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 10:40:51,428 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 10:40:51,429 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 10:40:51,430 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 10:40:51,431 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 10:40:51,432 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 10:40:51,434 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 10:40:51,438 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 10:40:51,440 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 10:40:51,449 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 10:40:51,450 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 10:40:51,451 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 10:40:51,454 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 10:40:51,454 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 10:40:51,454 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 10:40:51,457 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 10:40:51,458 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 10:40:51,458 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 10:40:51,459 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 10:40:51,460 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 10:40:51,460 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 10:40:51,461 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 10:40:51,461 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 10:40:51,461 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 10:40:51,462 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 10:40:51,463 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 10:40:51,463 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 10:40:51,479 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 10:40:51,480 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 10:40:51,480 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 10:40:51,481 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 10:40:51,481 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 10:40:51,481 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 10:40:51,481 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 10:40:51,481 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 10:40:51,482 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 10:40:51,482 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 10:40:51,482 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 10:40:51,482 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 10:40:51,482 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 10:40:51,482 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 10:40:51,483 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 10:40:51,483 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 10:40:51,484 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 10:40:51,484 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 10:40:51,484 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 10:40:51,484 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 10:40:51,484 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 10:40:51,484 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 10:40:51,485 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 10:40:51,485 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 10:40:51,485 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 10:40:51,485 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 10:40:51,485 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:40:51,486 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 10:40:51,486 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 10:40:51,486 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 10:40:51,486 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 10:40:51,486 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 10:40:51,487 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 10:40:51,487 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 10:40:51,487 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 10:40:51,487 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 10:40:51,540 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 10:40:51,559 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 10:40:51,566 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 10:40:51,568 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 10:40:51,568 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 10:40:51,570 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/half_true-unreach-call_true-termination.i [2018-11-07 10:40:51,636 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b6bce674/e07b1d3410914332903b6c8b317e032e/FLAG165e538b5 [2018-11-07 10:40:52,042 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 10:40:52,042 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/half_true-unreach-call_true-termination.i [2018-11-07 10:40:52,048 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b6bce674/e07b1d3410914332903b6c8b317e032e/FLAG165e538b5 [2018-11-07 10:40:52,061 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b6bce674/e07b1d3410914332903b6c8b317e032e [2018-11-07 10:40:52,074 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 10:40:52,075 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 10:40:52,076 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 10:40:52,076 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 10:40:52,080 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 10:40:52,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:40:52" (1/1) ... [2018-11-07 10:40:52,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6698ba59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:52, skipping insertion in model container [2018-11-07 10:40:52,084 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:40:52" (1/1) ... [2018-11-07 10:40:52,094 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 10:40:52,115 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 10:40:52,310 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:40:52,314 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 10:40:52,336 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:40:52,355 INFO L193 MainTranslator]: Completed translation [2018-11-07 10:40:52,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:52 WrapperNode [2018-11-07 10:40:52,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 10:40:52,356 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 10:40:52,357 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 10:40:52,357 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 10:40:52,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:52" (1/1) ... [2018-11-07 10:40:52,373 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:52" (1/1) ... [2018-11-07 10:40:52,379 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 10:40:52,379 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 10:40:52,380 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 10:40:52,380 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 10:40:52,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:52" (1/1) ... [2018-11-07 10:40:52,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:52" (1/1) ... [2018-11-07 10:40:52,392 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:52" (1/1) ... [2018-11-07 10:40:52,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:52" (1/1) ... [2018-11-07 10:40:52,396 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:52" (1/1) ... [2018-11-07 10:40:52,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:52" (1/1) ... [2018-11-07 10:40:52,402 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:52" (1/1) ... [2018-11-07 10:40:52,406 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 10:40:52,406 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 10:40:52,406 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 10:40:52,407 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 10:40:52,407 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:52" (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-07 10:40:52,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 10:40:52,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 10:40:52,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 10:40:52,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 10:40:52,538 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 10:40:52,538 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 10:40:52,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 10:40:52,539 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 10:40:52,771 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 10:40:52,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:40:52 BoogieIcfgContainer [2018-11-07 10:40:52,772 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 10:40:52,773 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 10:40:52,773 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 10:40:52,776 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 10:40:52,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:40:52" (1/3) ... [2018-11-07 10:40:52,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@186305f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:40:52, skipping insertion in model container [2018-11-07 10:40:52,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:40:52" (2/3) ... [2018-11-07 10:40:52,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@186305f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:40:52, skipping insertion in model container [2018-11-07 10:40:52,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:40:52" (3/3) ... [2018-11-07 10:40:52,780 INFO L112 eAbstractionObserver]: Analyzing ICFG half_true-unreach-call_true-termination.i [2018-11-07 10:40:52,790 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 10:40:52,798 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 10:40:52,817 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 10:40:52,860 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 10:40:52,860 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 10:40:52,860 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 10:40:52,861 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 10:40:52,861 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 10:40:52,861 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 10:40:52,861 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 10:40:52,861 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 10:40:52,883 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-07 10:40:52,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-07 10:40:52,890 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:52,891 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:52,893 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:52,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:52,900 INFO L82 PathProgramCache]: Analyzing trace with hash 439143249, now seen corresponding path program 1 times [2018-11-07 10:40:52,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:52,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:52,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:52,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:52,951 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:52,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:53,010 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-07 10:40:53,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:40:53,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 10:40:53,013 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:40:53,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 10:40:53,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 10:40:53,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 10:40:53,036 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-11-07 10:40:53,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:53,058 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-07 10:40:53,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 10:40:53,059 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-07 10:40:53,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:53,068 INFO L225 Difference]: With dead ends: 34 [2018-11-07 10:40:53,069 INFO L226 Difference]: Without dead ends: 15 [2018-11-07 10:40:53,072 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-07 10:40:53,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-07 10:40:53,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-07 10:40:53,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-07 10:40:53,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-07 10:40:53,109 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2018-11-07 10:40:53,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:53,109 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-07 10:40:53,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 10:40:53,110 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-07 10:40:53,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-07 10:40:53,111 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:53,111 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:53,111 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:53,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:53,112 INFO L82 PathProgramCache]: Analyzing trace with hash 299545522, now seen corresponding path program 1 times [2018-11-07 10:40:53,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:53,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:53,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:53,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:53,114 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:53,608 WARN L179 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-11-07 10:40:53,754 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2018-11-07 10:40:53,980 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-07 10:40:53,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:40:53,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-07 10:40:53,981 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:40:53,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 10:40:53,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 10:40:53,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-07 10:40:53,984 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 7 states. [2018-11-07 10:40:54,178 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-07 10:40:54,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:54,340 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-07 10:40:54,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 10:40:54,340 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-11-07 10:40:54,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:54,344 INFO L225 Difference]: With dead ends: 29 [2018-11-07 10:40:54,344 INFO L226 Difference]: Without dead ends: 24 [2018-11-07 10:40:54,345 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-07 10:40:54,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-07 10:40:54,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2018-11-07 10:40:54,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-07 10:40:54,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-07 10:40:54,352 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2018-11-07 10:40:54,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:54,353 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-07 10:40:54,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 10:40:54,353 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-07 10:40:54,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-07 10:40:54,354 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:54,354 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:54,354 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:54,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:54,355 INFO L82 PathProgramCache]: Analyzing trace with hash 2077692347, now seen corresponding path program 1 times [2018-11-07 10:40:54,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:54,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:54,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:54,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:54,357 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:54,666 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-07 10:40:54,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:54,666 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:54,667 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-11-07 10:40:54,671 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [15], [17], [20], [24], [31], [34], [36], [42], [43], [44], [46] [2018-11-07 10:40:54,724 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:40:54,725 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:40:54,934 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:40:54,938 INFO L272 AbstractInterpreter]: Visited 15 different actions 23 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 6 variables. [2018-11-07 10:40:54,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:54,953 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:40:54,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:54,954 INFO L194 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-07 10:40:54,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:54,973 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:40:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:55,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:55,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-07 10:40:55,212 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:55,703 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-07 10:40:55,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:55,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 14 [2018-11-07 10:40:55,723 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:55,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 10:40:55,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 10:40:55,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-11-07 10:40:55,725 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 11 states. [2018-11-07 10:40:56,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:56,082 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-11-07 10:40:56,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 10:40:56,083 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-11-07 10:40:56,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:56,084 INFO L225 Difference]: With dead ends: 44 [2018-11-07 10:40:56,084 INFO L226 Difference]: Without dead ends: 39 [2018-11-07 10:40:56,086 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2018-11-07 10:40:56,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-07 10:40:56,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 25. [2018-11-07 10:40:56,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-07 10:40:56,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-07 10:40:56,093 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2018-11-07 10:40:56,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:56,094 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-07 10:40:56,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 10:40:56,094 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-07 10:40:56,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-07 10:40:56,095 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:56,095 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:56,095 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:56,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:56,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1259125948, now seen corresponding path program 2 times [2018-11-07 10:40:56,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:56,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:56,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:56,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:56,098 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:56,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:56,195 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:40:56,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:56,195 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:56,195 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:56,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:56,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:56,196 INFO L194 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-07 10:40:56,206 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:40:56,206 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:40:56,219 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 10:40:56,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:56,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:56,312 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 10:40:56,312 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:56,411 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 10:40:56,433 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 10:40:56,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [4] total 9 [2018-11-07 10:40:56,434 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:40:56,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:40:56,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:40:56,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-07 10:40:56,435 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 5 states. [2018-11-07 10:40:56,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:56,497 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2018-11-07 10:40:56,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:40:56,498 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-07 10:40:56,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:56,499 INFO L225 Difference]: With dead ends: 38 [2018-11-07 10:40:56,499 INFO L226 Difference]: Without dead ends: 29 [2018-11-07 10:40:56,500 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-07 10:40:56,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-07 10:40:56,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-11-07 10:40:56,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-07 10:40:56,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-07 10:40:56,508 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 20 [2018-11-07 10:40:56,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:56,509 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-07 10:40:56,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:40:56,509 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-07 10:40:56,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-07 10:40:56,510 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:56,510 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:56,510 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:56,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:56,511 INFO L82 PathProgramCache]: Analyzing trace with hash -2068472574, now seen corresponding path program 1 times [2018-11-07 10:40:56,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:56,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:56,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:56,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:56,512 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:56,830 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-11-07 10:40:56,949 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:40:56,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:56,949 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:56,950 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-11-07 10:40:56,950 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [15], [17], [20], [22], [24], [31], [34], [36], [42], [43], [44], [46] [2018-11-07 10:40:56,952 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:40:56,952 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:40:57,050 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:40:57,051 INFO L272 AbstractInterpreter]: Visited 16 different actions 36 times. Merged at 6 different actions 10 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 6 variables. [2018-11-07 10:40:57,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:57,090 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:40:57,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:57,090 INFO L194 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-07 10:40:57,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:57,106 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:40:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:57,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:57,353 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:40:57,353 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:57,782 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:40:57,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:57,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 26 [2018-11-07 10:40:57,802 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:57,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 10:40:57,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 10:40:57,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2018-11-07 10:40:57,805 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 17 states. [2018-11-07 10:40:58,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:58,411 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2018-11-07 10:40:58,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 10:40:58,413 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2018-11-07 10:40:58,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:58,415 INFO L225 Difference]: With dead ends: 64 [2018-11-07 10:40:58,415 INFO L226 Difference]: Without dead ends: 47 [2018-11-07 10:40:58,416 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=185, Invalid=807, Unknown=0, NotChecked=0, Total=992 [2018-11-07 10:40:58,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-07 10:40:58,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2018-11-07 10:40:58,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-07 10:40:58,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-11-07 10:40:58,432 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 20 [2018-11-07 10:40:58,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:58,432 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-11-07 10:40:58,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 10:40:58,432 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-11-07 10:40:58,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-07 10:40:58,433 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:58,433 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:58,434 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:58,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:58,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1810307136, now seen corresponding path program 1 times [2018-11-07 10:40:58,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:58,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:58,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:58,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:58,437 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:58,505 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 10:40:58,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:40:58,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 10:40:58,506 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:40:58,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:40:58,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:40:58,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:40:58,507 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 3 states. [2018-11-07 10:40:58,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:58,544 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-11-07 10:40:58,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:40:58,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-07 10:40:58,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:58,546 INFO L225 Difference]: With dead ends: 53 [2018-11-07 10:40:58,546 INFO L226 Difference]: Without dead ends: 37 [2018-11-07 10:40:58,548 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:40:58,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-07 10:40:58,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-07 10:40:58,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-07 10:40:58,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-11-07 10:40:58,554 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 20 [2018-11-07 10:40:58,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:58,555 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-11-07 10:40:58,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:40:58,555 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-11-07 10:40:58,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-07 10:40:58,556 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:58,556 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:58,556 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:58,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:58,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1593220633, now seen corresponding path program 2 times [2018-11-07 10:40:58,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:58,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:58,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:58,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:58,558 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:58,810 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-07 10:40:58,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:58,811 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:58,811 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:58,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:40:58,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:58,812 INFO L194 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-07 10:40:58,825 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:40:58,826 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:40:58,855 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 10:40:58,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:58,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:59,097 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 10:40:59,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:59,225 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 26 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-07 10:40:59,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:59,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2018-11-07 10:40:59,254 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:59,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 10:40:59,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 10:40:59,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-11-07 10:40:59,256 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 12 states. [2018-11-07 10:40:59,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:59,730 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-11-07 10:40:59,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 10:40:59,731 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-11-07 10:40:59,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:59,732 INFO L225 Difference]: With dead ends: 52 [2018-11-07 10:40:59,732 INFO L226 Difference]: Without dead ends: 39 [2018-11-07 10:40:59,733 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2018-11-07 10:40:59,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-07 10:40:59,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-07 10:40:59,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-07 10:40:59,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-11-07 10:40:59,739 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 32 [2018-11-07 10:40:59,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:59,740 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-11-07 10:40:59,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 10:40:59,740 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-11-07 10:40:59,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-07 10:40:59,741 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:59,741 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:59,742 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:59,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:59,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1794670498, now seen corresponding path program 3 times [2018-11-07 10:40:59,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:59,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:59,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:59,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:59,744 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:41:00,208 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 10:41:00,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:00,209 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:41:00,209 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:41:00,209 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:41:00,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:41:00,210 INFO L194 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-07 10:41:00,221 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:41:00,221 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:41:00,245 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:41:00,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:41:00,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:41:00,673 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:41:00,673 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:41:07,097 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:41:07,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:41:07,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 17] total 39 [2018-11-07 10:41:07,118 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:41:07,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 10:41:07,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 10:41:07,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1247, Unknown=15, NotChecked=0, Total=1482 [2018-11-07 10:41:07,120 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 25 states. [2018-11-07 10:41:08,057 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-11-07 10:41:08,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:41:08,793 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-11-07 10:41:08,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 10:41:08,793 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 36 [2018-11-07 10:41:08,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:41:08,794 INFO L225 Difference]: With dead ends: 47 [2018-11-07 10:41:08,794 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 10:41:08,798 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=516, Invalid=2775, Unknown=15, NotChecked=0, Total=3306 [2018-11-07 10:41:08,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 10:41:08,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 10:41:08,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 10:41:08,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 10:41:08,799 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2018-11-07 10:41:08,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:41:08,799 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 10:41:08,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-07 10:41:08,800 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 10:41:08,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 10:41:08,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 10:41:09,073 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 21 [2018-11-07 10:41:09,095 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-07 10:41:09,095 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 10:41:09,095 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 10:41:09,096 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-07 10:41:09,096 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 10:41:09,096 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 10:41:09,096 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 22) the Hoare annotation is: true [2018-11-07 10:41:09,096 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 22) no Hoare annotation was computed. [2018-11-07 10:41:09,096 INFO L425 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-11-07 10:41:09,096 INFO L425 ceAbstractionStarter]: For program point L16(lines 16 18) no Hoare annotation was computed. [2018-11-07 10:41:09,096 INFO L425 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-11-07 10:41:09,096 INFO L425 ceAbstractionStarter]: For program point L15-1(lines 15 19) no Hoare annotation was computed. [2018-11-07 10:41:09,096 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 22) no Hoare annotation was computed. [2018-11-07 10:41:09,096 INFO L425 ceAbstractionStarter]: For program point L15-3(lines 15 19) no Hoare annotation was computed. [2018-11-07 10:41:09,097 INFO L421 ceAbstractionStarter]: At program point L15-4(lines 15 19) the Hoare annotation is: (let ((.cse0 (<= 0 main_~i~0)) (.cse1 (* 2 main_~n~0)) (.cse2 (<= main_~n~0 main_~k~0))) (or (and .cse0 (<= main_~i~0 .cse1) (<= .cse1 main_~i~0) .cse2) (let ((.cse3 (+ main_~i~0 1))) (and (<= .cse3 .cse1) .cse0 (<= .cse1 .cse3) .cse2)) (and (<= 0 main_~n~0) (<= main_~n~0 0) (= main_~i~0 0)))) [2018-11-07 10:41:09,097 INFO L421 ceAbstractionStarter]: At program point L15-5(lines 15 19) the Hoare annotation is: (and (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)) (<= main_~k~0 main_~n~0)) [2018-11-07 10:41:09,097 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-07 10:41:09,097 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-07 10:41:09,097 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-07 10:41:09,097 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-07 10:41:09,097 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-07 10:41:09,097 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-07 10:41:09,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:41:09 BoogieIcfgContainer [2018-11-07 10:41:09,111 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 10:41:09,112 INFO L168 Benchmark]: Toolchain (without parser) took 17037.96 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 874.5 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -813.7 MB). Peak memory consumption was 60.8 MB. Max. memory is 7.1 GB. [2018-11-07 10:41:09,114 INFO L168 Benchmark]: CDTParser took 0.33 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-07 10:41:09,114 INFO L168 Benchmark]: CACSL2BoogieTranslator took 279.99 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-07 10:41:09,115 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.63 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-07 10:41:09,115 INFO L168 Benchmark]: Boogie Preprocessor took 26.63 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-07 10:41:09,116 INFO L168 Benchmark]: RCFGBuilder took 365.93 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 759.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -813.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-07 10:41:09,117 INFO L168 Benchmark]: TraceAbstraction took 16338.38 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 114.8 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -11.0 MB). Peak memory consumption was 103.8 MB. Max. memory is 7.1 GB. [2018-11-07 10:41:09,122 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.33 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 279.99 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 22.63 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 26.63 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 365.93 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 759.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -813.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16338.38 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 114.8 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -11.0 MB). Peak memory consumption was 103.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: ((((0 <= i && i <= 2 * n) && 2 * n <= i) && n <= k) || (((i + 1 <= 2 * n && 0 <= i) && 2 * n <= i + 1) && n <= k)) || ((0 <= n && n <= 0) && i == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. SAFE Result, 16.2s OverallTime, 8 OverallIterations, 7 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 120 SDtfs, 119 SDslu, 583 SDs, 0 SdLazy, 827 SolverSat, 52 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 346 GetRequests, 188 SyntacticMatches, 16 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1204 ImplicationChecksByTransitivity, 12.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 37 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 17 PreInvPairs, 31 NumberOfFragments, 65 HoareAnnotationTreeSize, 17 FomulaSimplifications, 248 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 376 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 291 NumberOfCodeBlocks, 275 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 397 ConstructedInterpolants, 30 QuantifiedInterpolants, 75122 SizeOfPredicates, 18 NumberOfNonLiveVariables, 243 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 18 InterpolantComputations, 5 PerfectInterpolantSequences, 144/428 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...