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.epf -i ../../../trunk/examples/svcomp/loop-acceleration/underapprox_false-unreach-call1_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 04:59:54,968 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 04:59:54,970 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 04:59:54,986 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 04:59:54,987 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 04:59:54,989 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 04:59:54,992 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 04:59:54,996 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 04:59:54,998 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 04:59:55,000 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 04:59:55,004 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 04:59:55,004 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 04:59:55,005 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 04:59:55,009 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 04:59:55,011 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 04:59:55,011 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 04:59:55,021 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 04:59:55,026 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 04:59:55,030 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 04:59:55,035 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 04:59:55,036 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 04:59:55,037 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 04:59:55,043 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 04:59:55,044 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 04:59:55,044 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 04:59:55,045 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 04:59:55,048 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 04:59:55,049 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 04:59:55,049 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 04:59:55,050 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 04:59:55,052 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 04:59:55,053 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 04:59:55,053 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 04:59:55,053 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 04:59:55,056 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 04:59:55,057 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 04:59:55,058 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 04:59:55,086 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 04:59:55,086 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 04:59:55,088 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 04:59:55,088 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 04:59:55,088 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 04:59:55,089 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 04:59:55,089 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 04:59:55,089 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 04:59:55,089 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 04:59:55,090 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 04:59:55,090 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 04:59:55,090 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 04:59:55,091 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 04:59:55,091 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 04:59:55,091 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 04:59:55,093 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 04:59:55,093 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 04:59:55,093 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 04:59:55,093 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 04:59:55,093 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 04:59:55,095 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 04:59:55,095 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 04:59:55,095 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 04:59:55,095 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 04:59:55,096 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 04:59:55,096 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 04:59:55,096 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 04:59:55,096 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 04:59:55,097 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 04:59:55,097 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 04:59:55,097 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 04:59:55,097 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 04:59:55,097 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 04:59:55,098 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 04:59:55,167 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 04:59:55,182 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 04:59:55,186 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 04:59:55,188 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 04:59:55,189 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 04:59:55,190 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/underapprox_false-unreach-call1_true-termination.i [2018-11-07 04:59:55,258 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7adf20a3/2b36d446e0f2435db48cf23a9bdde7a3/FLAG7dddc76a3 [2018-11-07 04:59:55,731 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 04:59:55,731 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_false-unreach-call1_true-termination.i [2018-11-07 04:59:55,739 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7adf20a3/2b36d446e0f2435db48cf23a9bdde7a3/FLAG7dddc76a3 [2018-11-07 04:59:55,754 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7adf20a3/2b36d446e0f2435db48cf23a9bdde7a3 [2018-11-07 04:59:55,764 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 04:59:55,766 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 04:59:55,767 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 04:59:55,767 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 04:59:55,771 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 04:59:55,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:59:55" (1/1) ... [2018-11-07 04:59:55,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b49af9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:55, skipping insertion in model container [2018-11-07 04:59:55,776 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:59:55" (1/1) ... [2018-11-07 04:59:55,787 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 04:59:55,813 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 04:59:56,053 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 04:59:56,058 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 04:59:56,075 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 04:59:56,094 INFO L193 MainTranslator]: Completed translation [2018-11-07 04:59:56,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:56 WrapperNode [2018-11-07 04:59:56,095 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 04:59:56,096 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 04:59:56,096 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 04:59:56,096 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 04:59:56,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:56" (1/1) ... [2018-11-07 04:59:56,113 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:56" (1/1) ... [2018-11-07 04:59:56,121 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 04:59:56,121 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 04:59:56,122 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 04:59:56,122 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 04:59:56,133 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:56" (1/1) ... [2018-11-07 04:59:56,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:56" (1/1) ... [2018-11-07 04:59:56,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:56" (1/1) ... [2018-11-07 04:59:56,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:56" (1/1) ... [2018-11-07 04:59:56,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:56" (1/1) ... [2018-11-07 04:59:56,147 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:56" (1/1) ... [2018-11-07 04:59:56,149 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:56" (1/1) ... [2018-11-07 04:59:56,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 04:59:56,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 04:59:56,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 04:59:56,152 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 04:59:56,153 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:56" (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 04:59:56,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 04:59:56,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 04:59:56,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 04:59:56,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 04:59:56,290 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 04:59:56,290 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 04:59:56,290 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 04:59:56,291 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 04:59:56,504 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 04:59:56,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:59:56 BoogieIcfgContainer [2018-11-07 04:59:56,505 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 04:59:56,506 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 04:59:56,506 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 04:59:56,509 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 04:59:56,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:59:55" (1/3) ... [2018-11-07 04:59:56,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc04348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:59:56, skipping insertion in model container [2018-11-07 04:59:56,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:56" (2/3) ... [2018-11-07 04:59:56,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc04348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:59:56, skipping insertion in model container [2018-11-07 04:59:56,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:59:56" (3/3) ... [2018-11-07 04:59:56,513 INFO L112 eAbstractionObserver]: Analyzing ICFG underapprox_false-unreach-call1_true-termination.i [2018-11-07 04:59:56,521 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 04:59:56,528 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 04:59:56,543 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 04:59:56,573 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 04:59:56,573 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 04:59:56,574 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 04:59:56,574 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 04:59:56,574 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 04:59:56,574 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 04:59:56,574 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 04:59:56,575 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 04:59:56,594 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-07 04:59:56,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-07 04:59:56,600 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:56,601 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:56,604 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:56,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:56,610 INFO L82 PathProgramCache]: Analyzing trace with hash -10373566, now seen corresponding path program 1 times [2018-11-07 04:59:56,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:56,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:56,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:59:56,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:56,664 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:56,717 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 04:59:56,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:59:56,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 04:59:56,720 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:59:56,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 04:59:56,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 04:59:56,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 04:59:56,740 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-07 04:59:56,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:59:56,761 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-07 04:59:56,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 04:59:56,763 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-07 04:59:56,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:59:56,770 INFO L225 Difference]: With dead ends: 29 [2018-11-07 04:59:56,771 INFO L226 Difference]: Without dead ends: 12 [2018-11-07 04:59:56,774 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 04:59:56,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-07 04:59:56,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-07 04:59:56,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-07 04:59:56,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-07 04:59:56,807 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-07 04:59:56,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:59:56,808 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-07 04:59:56,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 04:59:56,808 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-07 04:59:56,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-07 04:59:56,809 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:56,809 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:56,809 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:56,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:56,810 INFO L82 PathProgramCache]: Analyzing trace with hash -571410792, now seen corresponding path program 1 times [2018-11-07 04:59:56,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:56,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:56,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:59:56,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:56,812 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:56,943 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 04:59:56,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:59:56,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 04:59:56,944 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:59:56,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 04:59:56,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 04:59:56,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 04:59:56,948 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2018-11-07 04:59:56,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:59:56,998 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-07 04:59:56,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 04:59:56,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-07 04:59:56,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:59:56,999 INFO L225 Difference]: With dead ends: 19 [2018-11-07 04:59:57,000 INFO L226 Difference]: Without dead ends: 14 [2018-11-07 04:59:57,001 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 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 04:59:57,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-07 04:59:57,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-07 04:59:57,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-07 04:59:57,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-07 04:59:57,006 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-11-07 04:59:57,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:59:57,006 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-07 04:59:57,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 04:59:57,006 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-07 04:59:57,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-07 04:59:57,007 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:57,007 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:57,008 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:57,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:57,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1625028318, now seen corresponding path program 1 times [2018-11-07 04:59:57,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:57,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:57,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:59:57,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:57,010 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:57,148 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 04:59:57,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:57,149 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:59:57,150 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-11-07 04:59:57,152 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [20], [23], [25], [31], [32], [33], [35] [2018-11-07 04:59:57,202 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:59:57,203 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:59:57,332 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 04:59:57,565 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 04:59:57,566 INFO L272 AbstractInterpreter]: Visited 12 different actions 77 times. Merged at 3 different actions 31 times. Widened at 1 different actions 7 times. Found 1 fixpoints after 1 different actions. Largest state had 3 variables. [2018-11-07 04:59:57,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:57,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 04:59:57,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:57,610 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 04:59:57,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:59:57,622 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:59:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:57,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:59:57,701 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 04:59:57,702 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:59:57,807 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 04:59:57,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:59:57,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-07 04:59:57,829 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:59:57,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 04:59:57,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 04:59:57,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 04:59:57,830 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 4 states. [2018-11-07 04:59:57,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:59:57,850 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-07 04:59:57,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 04:59:57,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-07 04:59:57,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:59:57,853 INFO L225 Difference]: With dead ends: 21 [2018-11-07 04:59:57,853 INFO L226 Difference]: Without dead ends: 16 [2018-11-07 04:59:57,854 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 04:59:57,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-07 04:59:57,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-07 04:59:57,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-07 04:59:57,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-07 04:59:57,859 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-11-07 04:59:57,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:59:57,859 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-07 04:59:57,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 04:59:57,859 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-07 04:59:57,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 04:59:57,860 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:57,860 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:57,860 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:57,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:57,861 INFO L82 PathProgramCache]: Analyzing trace with hash -720896604, now seen corresponding path program 2 times [2018-11-07 04:59:57,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:57,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:57,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:59:57,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:57,863 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:58,029 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:58,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:58,029 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:59:58,030 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:59:58,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:59:58,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:58,030 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 04:59:58,050 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:59:58,050 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:59:58,074 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 04:59:58,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:59:58,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:59:58,136 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:58,136 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:59:58,352 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:58,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:59:58,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-11-07 04:59:58,373 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:59:58,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 04:59:58,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 04:59:58,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-07 04:59:58,375 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 5 states. [2018-11-07 04:59:58,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:59:58,413 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-07 04:59:58,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 04:59:58,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-07 04:59:58,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:59:58,414 INFO L225 Difference]: With dead ends: 23 [2018-11-07 04:59:58,414 INFO L226 Difference]: Without dead ends: 18 [2018-11-07 04:59:58,415 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-07 04:59:58,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-07 04:59:58,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-07 04:59:58,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-07 04:59:58,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-07 04:59:58,420 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-11-07 04:59:58,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:59:58,420 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-07 04:59:58,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 04:59:58,421 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-07 04:59:58,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 04:59:58,421 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:58,422 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:58,422 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:58,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:58,422 INFO L82 PathProgramCache]: Analyzing trace with hash -296916246, now seen corresponding path program 3 times [2018-11-07 04:59:58,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:58,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:58,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:59:58,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:58,424 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:58,569 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:58,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:58,569 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:59:58,570 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:59:58,570 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:59:58,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:58,570 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 04:59:58,582 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:59:58,583 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:59:58,594 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:59:58,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:59:58,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:59:58,612 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:58,612 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:59:58,811 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:58,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:59:58,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-11-07 04:59:58,831 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:59:58,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 04:59:58,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 04:59:58,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-07 04:59:58,833 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 6 states. [2018-11-07 04:59:58,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:59:58,872 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-07 04:59:58,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 04:59:58,873 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-07 04:59:58,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:59:58,874 INFO L225 Difference]: With dead ends: 25 [2018-11-07 04:59:58,874 INFO L226 Difference]: Without dead ends: 20 [2018-11-07 04:59:58,875 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-07 04:59:58,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-07 04:59:58,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-07 04:59:58,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-07 04:59:58,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-07 04:59:58,880 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-11-07 04:59:58,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:59:58,880 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-07 04:59:58,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 04:59:58,880 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-07 04:59:58,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 04:59:58,881 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:58,881 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:58,882 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:58,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:58,882 INFO L82 PathProgramCache]: Analyzing trace with hash -873685328, now seen corresponding path program 4 times [2018-11-07 04:59:58,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:58,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:58,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:59:58,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:58,884 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:58,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:59,020 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:59,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:59,021 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:59:59,021 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:59:59,021 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:59:59,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:59,021 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 04:59:59,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:59:59,039 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:59:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:59,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:59:59,089 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:59,090 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:59:59,573 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:59,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:59:59,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-11-07 04:59:59,594 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:59:59,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 04:59:59,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 04:59:59,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-07 04:59:59,595 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 7 states. [2018-11-07 04:59:59,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:59:59,639 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-07 04:59:59,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 04:59:59,641 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-07 04:59:59,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:59:59,642 INFO L225 Difference]: With dead ends: 27 [2018-11-07 04:59:59,642 INFO L226 Difference]: Without dead ends: 22 [2018-11-07 04:59:59,643 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-07 04:59:59,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-07 04:59:59,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-07 04:59:59,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-07 04:59:59,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-07 04:59:59,648 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2018-11-07 04:59:59,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:59:59,649 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-07 04:59:59,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 04:59:59,649 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-07 04:59:59,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-07 04:59:59,650 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:59,650 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:59,650 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:59,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:59,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1097991946, now seen corresponding path program 5 times [2018-11-07 04:59:59,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:59,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:59,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:59:59,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:59,652 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:59,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:59,819 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:59,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:59,820 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:59:59,820 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:59:59,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:59:59,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:59,821 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 04:59:59,838 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:59:59,839 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:59:59,900 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 04:59:59,900 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:59:59,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:59:59,925 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:59,925 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:00,080 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:00,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:00,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-11-07 05:00:00,102 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:00,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 05:00:00,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 05:00:00,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-11-07 05:00:00,103 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 8 states. [2018-11-07 05:00:00,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:00,183 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-07 05:00:00,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 05:00:00,186 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-11-07 05:00:00,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:00,187 INFO L225 Difference]: With dead ends: 29 [2018-11-07 05:00:00,187 INFO L226 Difference]: Without dead ends: 24 [2018-11-07 05:00:00,188 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-11-07 05:00:00,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-07 05:00:00,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-07 05:00:00,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-07 05:00:00,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-07 05:00:00,193 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-11-07 05:00:00,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:00,193 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-07 05:00:00,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 05:00:00,193 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-07 05:00:00,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 05:00:00,194 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:00,194 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:00,194 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:00,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:00,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1908287044, now seen corresponding path program 6 times [2018-11-07 05:00:00,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:00,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:00,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:00:00,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:00,196 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-07 05:00:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-07 05:00:00,239 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-07 05:00:00,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:00:00 BoogieIcfgContainer [2018-11-07 05:00:00,269 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 05:00:00,270 INFO L168 Benchmark]: Toolchain (without parser) took 4504.96 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.7 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -582.8 MB). Peak memory consumption was 165.9 MB. Max. memory is 7.1 GB. [2018-11-07 05:00:00,272 INFO L168 Benchmark]: CDTParser took 0.27 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 05:00:00,273 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.43 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 05:00:00,274 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.54 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 05:00:00,274 INFO L168 Benchmark]: Boogie Preprocessor took 29.45 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 05:00:00,275 INFO L168 Benchmark]: RCFGBuilder took 353.88 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -803.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-07 05:00:00,276 INFO L168 Benchmark]: TraceAbstraction took 3763.29 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 210.0 MB). Peak memory consumption was 210.0 MB. Max. memory is 7.1 GB. [2018-11-07 05:00:00,281 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.27 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 328.43 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 25.54 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 29.45 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 353.88 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -803.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3763.29 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 210.0 MB). Peak memory consumption was 210.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L9] unsigned int x = 0; [L10] unsigned int y = 1; VAL [x=0, y=1] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=1, y=2] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=2, y=4] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=3, y=8] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=4, y=16] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=5, y=32] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=6, y=64] [L11] COND FALSE !(x < 6) VAL [x=6, y=64] [L15] CALL __VERIFIER_assert(y != 64) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 18 locations, 1 error locations. UNSAFE Result, 3.7s OverallTime, 8 OverallIterations, 7 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 99 SDtfs, 0 SDslu, 239 SDs, 0 SdLazy, 133 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 200 GetRequests, 154 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 214 NumberOfCodeBlocks, 214 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 259 ConstructedInterpolants, 0 QuantifiedInterpolants, 16181 SizeOfPredicates, 5 NumberOfNonLiveVariables, 215 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 17 InterpolantComputations, 2 PerfectInterpolantSequences, 0/210 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...