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/loops/sum01_bug02_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 10:25:46,573 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 10:25:46,575 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 10:25:46,587 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 10:25:46,587 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 10:25:46,588 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 10:25:46,589 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 10:25:46,591 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 10:25:46,593 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 10:25:46,594 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 10:25:46,594 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 10:25:46,595 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 10:25:46,596 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 10:25:46,597 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 10:25:46,598 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 10:25:46,599 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 10:25:46,599 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 10:25:46,601 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 10:25:46,603 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 10:25:46,605 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 10:25:46,606 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 10:25:46,607 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 10:25:46,609 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 10:25:46,609 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 10:25:46,609 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 10:25:46,610 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 10:25:46,611 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 10:25:46,612 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 10:25:46,613 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 10:25:46,614 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 10:25:46,614 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 10:25:46,615 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 10:25:46,615 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 10:25:46,615 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 10:25:46,616 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 10:25:46,616 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 10:25:46,617 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:25:46,633 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 10:25:46,634 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 10:25:46,635 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 10:25:46,635 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 10:25:46,635 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 10:25:46,635 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 10:25:46,635 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 10:25:46,636 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 10:25:46,636 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 10:25:46,636 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 10:25:46,636 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 10:25:46,636 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 10:25:46,639 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 10:25:46,639 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 10:25:46,640 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 10:25:46,640 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 10:25:46,640 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 10:25:46,640 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 10:25:46,640 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 10:25:46,641 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 10:25:46,641 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 10:25:46,641 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 10:25:46,641 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 10:25:46,641 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 10:25:46,643 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 10:25:46,643 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 10:25:46,643 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:25:46,643 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 10:25:46,643 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 10:25:46,644 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 10:25:46,644 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 10:25:46,644 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 10:25:46,645 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 10:25:46,645 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 10:25:46,645 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 10:25:46,645 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 10:25:46,700 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 10:25:46,716 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 10:25:46,720 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 10:25:46,722 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 10:25:46,722 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 10:25:46,723 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01_bug02_false-unreach-call_true-termination.i [2018-11-07 10:25:46,786 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88e523e3e/05e1ab43a1974cb295504f2f0f26d75f/FLAG5e632307c [2018-11-07 10:25:47,198 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 10:25:47,198 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02_false-unreach-call_true-termination.i [2018-11-07 10:25:47,205 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88e523e3e/05e1ab43a1974cb295504f2f0f26d75f/FLAG5e632307c [2018-11-07 10:25:47,228 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88e523e3e/05e1ab43a1974cb295504f2f0f26d75f [2018-11-07 10:25:47,240 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 10:25:47,242 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 10:25:47,242 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 10:25:47,243 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 10:25:47,246 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 10:25:47,247 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:25:47" (1/1) ... [2018-11-07 10:25:47,250 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25ab8b3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:47, skipping insertion in model container [2018-11-07 10:25:47,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:25:47" (1/1) ... [2018-11-07 10:25:47,261 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 10:25:47,285 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 10:25:47,527 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:25:47,531 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 10:25:47,551 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:25:47,569 INFO L193 MainTranslator]: Completed translation [2018-11-07 10:25:47,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:47 WrapperNode [2018-11-07 10:25:47,570 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 10:25:47,571 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 10:25:47,571 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 10:25:47,571 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 10:25:47,580 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:25:47" (1/1) ... [2018-11-07 10:25:47,586 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:25:47" (1/1) ... [2018-11-07 10:25:47,593 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 10:25:47,593 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 10:25:47,594 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 10:25:47,594 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 10:25:47,604 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:47" (1/1) ... [2018-11-07 10:25:47,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:47" (1/1) ... [2018-11-07 10:25:47,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:47" (1/1) ... [2018-11-07 10:25:47,605 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:47" (1/1) ... [2018-11-07 10:25:47,609 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:47" (1/1) ... [2018-11-07 10:25:47,614 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:47" (1/1) ... [2018-11-07 10:25:47,615 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:47" (1/1) ... [2018-11-07 10:25:47,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 10:25:47,617 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 10:25:47,617 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 10:25:47,617 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 10:25:47,618 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:47" (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:25:47,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 10:25:47,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 10:25:47,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 10:25:47,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 10:25:47,752 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 10:25:47,752 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 10:25:47,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 10:25:47,752 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 10:25:47,992 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 10:25:47,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:25:47 BoogieIcfgContainer [2018-11-07 10:25:47,993 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 10:25:47,995 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 10:25:47,995 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 10:25:48,003 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 10:25:48,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:25:47" (1/3) ... [2018-11-07 10:25:48,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1873e5a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:25:48, skipping insertion in model container [2018-11-07 10:25:48,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:47" (2/3) ... [2018-11-07 10:25:48,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1873e5a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:25:48, skipping insertion in model container [2018-11-07 10:25:48,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:25:47" (3/3) ... [2018-11-07 10:25:48,008 INFO L112 eAbstractionObserver]: Analyzing ICFG sum01_bug02_false-unreach-call_true-termination.i [2018-11-07 10:25:48,021 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 10:25:48,030 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 10:25:48,052 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 10:25:48,097 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 10:25:48,098 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 10:25:48,098 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 10:25:48,098 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 10:25:48,098 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 10:25:48,098 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 10:25:48,098 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 10:25:48,098 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 10:25:48,116 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-07 10:25:48,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-07 10:25:48,123 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:48,124 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:25:48,126 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:48,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:48,132 INFO L82 PathProgramCache]: Analyzing trace with hash -2007171518, now seen corresponding path program 1 times [2018-11-07 10:25:48,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:48,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:48,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:48,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:48,184 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:48,254 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:25:48,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:25:48,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 10:25:48,256 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:25:48,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 10:25:48,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 10:25:48,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 10:25:48,276 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-07 10:25:48,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:48,295 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-07 10:25:48,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 10:25:48,296 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-07 10:25:48,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:48,304 INFO L225 Difference]: With dead ends: 32 [2018-11-07 10:25:48,304 INFO L226 Difference]: Without dead ends: 15 [2018-11-07 10:25:48,307 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:25:48,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-07 10:25:48,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-07 10:25:48,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-07 10:25:48,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-07 10:25:48,342 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2018-11-07 10:25:48,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:48,343 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-07 10:25:48,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 10:25:48,343 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-07 10:25:48,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-07 10:25:48,344 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:48,344 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:25:48,344 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:48,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:48,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1715017247, now seen corresponding path program 1 times [2018-11-07 10:25:48,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:48,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:48,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:48,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:48,347 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:48,457 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:25:48,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:25:48,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 10:25:48,458 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:25:48,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:25:48,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:25:48,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:25:48,460 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 5 states. [2018-11-07 10:25:48,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:48,520 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-07 10:25:48,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:25:48,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-07 10:25:48,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:48,522 INFO L225 Difference]: With dead ends: 25 [2018-11-07 10:25:48,523 INFO L226 Difference]: Without dead ends: 20 [2018-11-07 10:25:48,524 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:25:48,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-07 10:25:48,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-07 10:25:48,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-07 10:25:48,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-07 10:25:48,529 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 11 [2018-11-07 10:25:48,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:48,529 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-07 10:25:48,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:25:48,529 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-07 10:25:48,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-07 10:25:48,530 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:48,530 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:25:48,531 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:48,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:48,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1428843034, now seen corresponding path program 1 times [2018-11-07 10:25:48,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:48,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:48,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:48,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:48,533 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:48,938 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-11-07 10:25:49,133 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-11-07 10:25:49,198 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:25:49,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:49,199 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:25:49,200 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-11-07 10:25:49,202 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [13], [16], [20], [22], [28], [31], [33], [39], [40], [41], [43] [2018-11-07 10:25:49,240 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:25:49,241 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:25:49,420 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:25:49,421 INFO L272 AbstractInterpreter]: Visited 15 different actions 44 times. Merged at 6 different actions 18 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 7 variables. [2018-11-07 10:25:49,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:49,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:25:49,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:49,446 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:25:49,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:49,459 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:25:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:49,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:25:49,857 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:25:49,858 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:25:50,540 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:25:50,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:25:50,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2018-11-07 10:25:50,562 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:25:50,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 10:25:50,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 10:25:50,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2018-11-07 10:25:50,565 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 14 states. [2018-11-07 10:25:50,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:50,974 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-07 10:25:50,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 10:25:50,975 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 16 [2018-11-07 10:25:50,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:50,978 INFO L225 Difference]: With dead ends: 45 [2018-11-07 10:25:50,978 INFO L226 Difference]: Without dead ends: 39 [2018-11-07 10:25:50,979 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 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-07 10:25:50,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-07 10:25:50,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2018-11-07 10:25:50,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-07 10:25:50,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-07 10:25:50,988 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 16 [2018-11-07 10:25:50,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:50,988 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-07 10:25:50,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 10:25:50,989 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-07 10:25:50,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-07 10:25:50,990 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:50,990 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:25:50,990 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:50,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:50,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1947322111, now seen corresponding path program 1 times [2018-11-07 10:25:50,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:50,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:50,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:50,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:50,993 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:51,065 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:25:51,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:51,066 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:25:51,066 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-11-07 10:25:51,066 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [13], [16], [18], [20], [22], [28], [31], [33], [39], [40], [41], [43] [2018-11-07 10:25:51,068 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:25:51,069 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:25:51,131 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:25:51,131 INFO L272 AbstractInterpreter]: Visited 16 different actions 48 times. Merged at 6 different actions 18 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 7 variables. [2018-11-07 10:25:51,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:51,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:25:51,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:51,143 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:25:51,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:51,161 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:25:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:51,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:25:51,265 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:25:51,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:25:51,313 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:25:51,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:25:51,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2018-11-07 10:25:51,333 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:25:51,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 10:25:51,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 10:25:51,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2018-11-07 10:25:51,335 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 8 states. [2018-11-07 10:25:51,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:51,435 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-07 10:25:51,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:25:51,436 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-11-07 10:25:51,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:51,437 INFO L225 Difference]: With dead ends: 42 [2018-11-07 10:25:51,437 INFO L226 Difference]: Without dead ends: 27 [2018-11-07 10:25:51,438 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2018-11-07 10:25:51,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-07 10:25:51,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-07 10:25:51,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-07 10:25:51,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-07 10:25:51,443 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 21 [2018-11-07 10:25:51,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:51,443 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-07 10:25:51,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 10:25:51,444 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-07 10:25:51,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-07 10:25:51,445 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:51,445 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:25:51,445 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:51,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:51,446 INFO L82 PathProgramCache]: Analyzing trace with hash 994455866, now seen corresponding path program 2 times [2018-11-07 10:25:51,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:51,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:51,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:51,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:51,447 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:51,781 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-07 10:25:51,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:51,782 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:25:51,782 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:25:51,782 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:25:51,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:51,782 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:25:51,791 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:25:51,791 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:25:51,815 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-07 10:25:51,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:25:51,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:25:52,201 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:25:52,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:25:52,772 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:25:52,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:25:52,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 30 [2018-11-07 10:25:52,792 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:25:52,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 10:25:52,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 10:25:52,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2018-11-07 10:25:52,796 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 19 states. [2018-11-07 10:25:53,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:53,536 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-11-07 10:25:53,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 10:25:53,536 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 26 [2018-11-07 10:25:53,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:53,537 INFO L225 Difference]: With dead ends: 50 [2018-11-07 10:25:53,537 INFO L226 Difference]: Without dead ends: 44 [2018-11-07 10:25:53,539 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=288, Invalid=1604, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 10:25:53,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-07 10:25:53,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 28. [2018-11-07 10:25:53,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-07 10:25:53,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-07 10:25:53,545 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 26 [2018-11-07 10:25:53,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:53,545 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-07 10:25:53,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 10:25:53,546 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-07 10:25:53,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-07 10:25:53,546 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:53,547 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:25:53,547 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:53,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:53,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1674514236, now seen corresponding path program 2 times [2018-11-07 10:25:53,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:53,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:53,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:25:53,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:53,549 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:53,627 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:25:53,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:53,628 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:25:53,628 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:25:53,628 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:25:53,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:53,628 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:25:53,638 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:25:53,638 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:25:53,651 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-07 10:25:53,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:25:53,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:25:53,734 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:25:53,735 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:25:53,846 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:25:53,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:25:53,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2018-11-07 10:25:53,877 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:25:53,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 10:25:53,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 10:25:53,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=130, Unknown=0, NotChecked=0, Total=240 [2018-11-07 10:25:53,878 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 12 states. [2018-11-07 10:25:53,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:53,946 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-07 10:25:53,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 10:25:53,950 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-11-07 10:25:53,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:53,951 INFO L225 Difference]: With dead ends: 44 [2018-11-07 10:25:53,951 INFO L226 Difference]: Without dead ends: 34 [2018-11-07 10:25:53,952 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=130, Unknown=0, NotChecked=0, Total=240 [2018-11-07 10:25:53,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-07 10:25:53,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-07 10:25:53,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-07 10:25:53,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-11-07 10:25:53,957 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 26 [2018-11-07 10:25:53,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:53,958 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-11-07 10:25:53,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 10:25:53,958 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-07 10:25:53,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-07 10:25:53,959 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:53,959 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:25:53,959 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:53,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:53,960 INFO L82 PathProgramCache]: Analyzing trace with hash 162653665, now seen corresponding path program 3 times [2018-11-07 10:25:53,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:53,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:53,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:25:53,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:53,961 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:54,074 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:25:54,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:54,075 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:25:54,075 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:25:54,075 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:25:54,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:54,076 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:25:54,084 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:25:54,085 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:25:54,105 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:25:54,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:25:54,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:25:54,275 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:25:54,275 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:25:54,348 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:25:54,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:25:54,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2018-11-07 10:25:54,368 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:25:54,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 10:25:54,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 10:25:54,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=174, Unknown=0, NotChecked=0, Total=306 [2018-11-07 10:25:54,370 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 16 states. [2018-11-07 10:25:54,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:54,477 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-07 10:25:54,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 10:25:54,480 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2018-11-07 10:25:54,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:54,481 INFO L225 Difference]: With dead ends: 49 [2018-11-07 10:25:54,481 INFO L226 Difference]: Without dead ends: 39 [2018-11-07 10:25:54,482 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=174, Unknown=0, NotChecked=0, Total=306 [2018-11-07 10:25:54,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-07 10:25:54,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-07 10:25:54,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-07 10:25:54,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-11-07 10:25:54,488 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 31 [2018-11-07 10:25:54,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:54,488 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-07 10:25:54,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 10:25:54,489 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-07 10:25:54,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-07 10:25:54,490 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:54,490 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:25:54,490 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:54,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:54,491 INFO L82 PathProgramCache]: Analyzing trace with hash 129265244, now seen corresponding path program 4 times [2018-11-07 10:25:54,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:54,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:54,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:25:54,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:54,492 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:54,673 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 18 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:25:54,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:54,673 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:25:54,673 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:25:54,673 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:25:54,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:54,674 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 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-07 10:25:54,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:54,684 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:25:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:54,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:25:54,815 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 18 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:25:54,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:25:55,020 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 18 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:25:55,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:25:55,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2018-11-07 10:25:55,051 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:25:55,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 10:25:55,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 10:25:55,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-11-07 10:25:55,056 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 20 states. [2018-11-07 10:25:55,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:55,425 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-11-07 10:25:55,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 10:25:55,426 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-11-07 10:25:55,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:55,427 INFO L225 Difference]: With dead ends: 55 [2018-11-07 10:25:55,427 INFO L226 Difference]: Without dead ends: 45 [2018-11-07 10:25:55,428 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 55 SyntacticMatches, 9 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-11-07 10:25:55,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-07 10:25:55,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-11-07 10:25:55,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-07 10:25:55,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-11-07 10:25:55,438 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 36 [2018-11-07 10:25:55,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:55,439 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-11-07 10:25:55,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 10:25:55,439 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-07 10:25:55,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-07 10:25:55,440 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:55,440 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:25:55,440 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:55,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:55,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1609235137, now seen corresponding path program 5 times [2018-11-07 10:25:55,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:55,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:55,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:55,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:55,442 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-07 10:25:55,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-07 10:25:55,521 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-07 10:25:55,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:25:55 BoogieIcfgContainer [2018-11-07 10:25:55,572 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 10:25:55,573 INFO L168 Benchmark]: Toolchain (without parser) took 8332.55 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 726.7 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -228.6 MB). Peak memory consumption was 498.1 MB. Max. memory is 7.1 GB. [2018-11-07 10:25:55,576 INFO L168 Benchmark]: CDTParser took 0.20 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:25:55,576 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.60 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:25:55,584 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.61 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:25:55,585 INFO L168 Benchmark]: Boogie Preprocessor took 22.98 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:25:55,585 INFO L168 Benchmark]: RCFGBuilder took 377.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 726.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -769.2 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2018-11-07 10:25:55,586 INFO L168 Benchmark]: TraceAbstraction took 7577.08 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: 530.0 MB). Peak memory consumption was 530.0 MB. Max. memory is 7.1 GB. [2018-11-07 10:25:55,593 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.20 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 327.60 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.61 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 22.98 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 377.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 726.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -769.2 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7577.08 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: 530.0 MB). Peak memory consumption was 530.0 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, j=10, n=__VERIFIER_nondet_uint(), sn=0; [L12] int i, j=10, n=__VERIFIER_nondet_uint(), sn=0; [L13] i=1 VAL [i=1, j=10, n=0, n=6] [L13] COND TRUE i<=n VAL [i=1, j=10, n=6, n=0] [L14] COND TRUE i