java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-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/linear_search_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 12:23:52,243 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 12:23:52,246 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 12:23:52,263 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 12:23:52,264 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 12:23:52,268 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 12:23:52,269 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 12:23:52,272 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 12:23:52,274 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 12:23:52,276 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 12:23:52,277 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 12:23:52,279 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 12:23:52,280 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 12:23:52,281 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 12:23:52,288 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 12:23:52,289 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 12:23:52,290 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 12:23:52,292 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 12:23:52,304 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 12:23:52,308 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 12:23:52,309 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 12:23:52,311 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 12:23:52,314 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 12:23:52,314 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 12:23:52,315 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 12:23:52,316 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 12:23:52,317 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 12:23:52,317 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 12:23:52,318 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 12:23:52,319 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 12:23:52,319 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 12:23:52,320 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 12:23:52,320 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 12:23:52,321 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 12:23:52,324 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 12:23:52,325 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 12:23:52,326 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-24 12:23:52,345 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 12:23:52,345 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 12:23:52,347 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 12:23:52,347 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 12:23:52,348 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 12:23:52,348 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 12:23:52,348 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 12:23:52,348 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 12:23:52,348 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 12:23:52,349 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 12:23:52,349 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 12:23:52,349 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 12:23:52,349 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 12:23:52,349 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 12:23:52,350 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 12:23:52,350 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 12:23:52,351 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 12:23:52,351 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 12:23:52,351 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 12:23:52,352 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 12:23:52,352 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 12:23:52,352 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 12:23:52,352 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 12:23:52,352 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 12:23:52,353 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 12:23:52,353 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 12:23:52,353 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 12:23:52,353 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 12:23:52,353 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 12:23:52,354 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 12:23:52,354 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 12:23:52,354 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 12:23:52,355 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 12:23:52,355 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 12:23:52,355 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 12:23:52,355 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 12:23:52,425 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 12:23:52,437 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 12:23:52,441 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 12:23:52,443 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 12:23:52,443 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 12:23:52,444 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/linear_search_false-unreach-call.i [2018-10-24 12:23:52,497 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/fb25e3111/8e4946535ec04853bdccade1399d1f28/FLAG1e02ec0da [2018-10-24 12:23:52,974 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 12:23:52,975 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search_false-unreach-call.i [2018-10-24 12:23:52,983 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/fb25e3111/8e4946535ec04853bdccade1399d1f28/FLAG1e02ec0da [2018-10-24 12:23:53,007 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/fb25e3111/8e4946535ec04853bdccade1399d1f28 [2018-10-24 12:23:53,020 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 12:23:53,023 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 12:23:53,024 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 12:23:53,024 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 12:23:53,029 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 12:23:53,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:23:53" (1/1) ... [2018-10-24 12:23:53,033 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d8d5e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:53, skipping insertion in model container [2018-10-24 12:23:53,034 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:23:53" (1/1) ... [2018-10-24 12:23:53,044 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 12:23:53,066 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 12:23:53,261 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:23:53,272 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 12:23:53,300 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:23:53,324 INFO L193 MainTranslator]: Completed translation [2018-10-24 12:23:53,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:53 WrapperNode [2018-10-24 12:23:53,325 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 12:23:53,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 12:23:53,326 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 12:23:53,326 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 12:23:53,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:53" (1/1) ... [2018-10-24 12:23:53,350 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:53" (1/1) ... [2018-10-24 12:23:53,380 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 12:23:53,380 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 12:23:53,380 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 12:23:53,382 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 12:23:53,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:53" (1/1) ... [2018-10-24 12:23:53,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:53" (1/1) ... [2018-10-24 12:23:53,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:53" (1/1) ... [2018-10-24 12:23:53,396 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:53" (1/1) ... [2018-10-24 12:23:53,411 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:53" (1/1) ... [2018-10-24 12:23:53,416 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:53" (1/1) ... [2018-10-24 12:23:53,419 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:53" (1/1) ... [2018-10-24 12:23:53,429 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 12:23:53,430 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 12:23:53,430 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 12:23:53,430 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 12:23:53,433 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 12:23:53,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 12:23:53,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 12:23:53,603 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2018-10-24 12:23:53,603 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2018-10-24 12:23:53,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 12:23:53,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 12:23:53,603 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 12:23:53,604 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 12:23:53,604 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-24 12:23:53,604 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-24 12:23:54,042 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 12:23:54,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:23:54 BoogieIcfgContainer [2018-10-24 12:23:54,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 12:23:54,044 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 12:23:54,044 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 12:23:54,048 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 12:23:54,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:23:53" (1/3) ... [2018-10-24 12:23:54,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6219fefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:23:54, skipping insertion in model container [2018-10-24 12:23:54,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:53" (2/3) ... [2018-10-24 12:23:54,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6219fefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:23:54, skipping insertion in model container [2018-10-24 12:23:54,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:23:54" (3/3) ... [2018-10-24 12:23:54,052 INFO L112 eAbstractionObserver]: Analyzing ICFG linear_search_false-unreach-call.i [2018-10-24 12:23:54,064 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 12:23:54,079 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 12:23:54,100 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 12:23:54,141 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 12:23:54,141 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 12:23:54,142 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 12:23:54,142 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 12:23:54,142 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 12:23:54,142 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 12:23:54,142 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 12:23:54,143 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 12:23:54,169 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-10-24 12:23:54,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-24 12:23:54,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:23:54,177 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:23:54,179 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:23:54,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:23:54,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1855752643, now seen corresponding path program 1 times [2018-10-24 12:23:54,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:23:54,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:23:54,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:23:54,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:23:54,243 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:23:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:23:54,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:23:54,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:23:54,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 12:23:54,391 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:23:54,395 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-24 12:23:54,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-24 12:23:54,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 12:23:54,414 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-10-24 12:23:54,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:23:54,438 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-10-24 12:23:54,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-24 12:23:54,440 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-10-24 12:23:54,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:23:54,449 INFO L225 Difference]: With dead ends: 45 [2018-10-24 12:23:54,449 INFO L226 Difference]: Without dead ends: 22 [2018-10-24 12:23:54,453 INFO L605 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-10-24 12:23:54,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-24 12:23:54,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-24 12:23:54,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-24 12:23:54,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-10-24 12:23:54,495 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2018-10-24 12:23:54,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:23:54,495 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-10-24 12:23:54,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-24 12:23:54,496 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-10-24 12:23:54,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-24 12:23:54,497 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:23:54,497 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:23:54,497 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:23:54,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:23:54,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1049182020, now seen corresponding path program 1 times [2018-10-24 12:23:54,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:23:54,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:23:54,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:23:54,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:23:54,500 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:23:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:23:54,915 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 17 [2018-10-24 12:23:55,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:23:55,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:23:55,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 12:23:55,157 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:23:55,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 12:23:55,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 12:23:55,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-24 12:23:55,160 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 6 states. [2018-10-24 12:23:55,368 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-24 12:23:55,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:23:55,623 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2018-10-24 12:23:55,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 12:23:55,623 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-10-24 12:23:55,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:23:55,627 INFO L225 Difference]: With dead ends: 41 [2018-10-24 12:23:55,627 INFO L226 Difference]: Without dead ends: 33 [2018-10-24 12:23:55,628 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-10-24 12:23:55,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-24 12:23:55,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-10-24 12:23:55,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-24 12:23:55,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-10-24 12:23:55,636 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 20 [2018-10-24 12:23:55,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:23:55,636 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-10-24 12:23:55,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 12:23:55,637 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2018-10-24 12:23:55,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-24 12:23:55,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:23:55,638 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:23:55,638 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:23:55,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:23:55,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1502974941, now seen corresponding path program 1 times [2018-10-24 12:23:55,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:23:55,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:23:55,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:23:55,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:23:55,641 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:23:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:23:56,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:23:56,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:23:56,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 12:23:56,087 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:23:56,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 12:23:56,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 12:23:56,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-24 12:23:56,089 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 6 states. [2018-10-24 12:23:56,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:23:56,156 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-10-24 12:23:56,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 12:23:56,157 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-10-24 12:23:56,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:23:56,158 INFO L225 Difference]: With dead ends: 35 [2018-10-24 12:23:56,158 INFO L226 Difference]: Without dead ends: 26 [2018-10-24 12:23:56,159 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-24 12:23:56,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-24 12:23:56,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-24 12:23:56,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-24 12:23:56,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-10-24 12:23:56,166 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 20 [2018-10-24 12:23:56,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:23:56,166 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-10-24 12:23:56,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 12:23:56,166 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-10-24 12:23:56,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-24 12:23:56,167 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:23:56,167 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:23:56,168 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:23:56,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:23:56,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1442209030, now seen corresponding path program 1 times [2018-10-24 12:23:56,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:23:56,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:23:56,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:23:56,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:23:56,170 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:23:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:23:56,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:23:56,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:23:56,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 12:23:56,350 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:23:56,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 12:23:56,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 12:23:56,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 12:23:56,351 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 5 states. [2018-10-24 12:23:56,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:23:56,450 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-10-24 12:23:56,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 12:23:56,450 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-10-24 12:23:56,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:23:56,451 INFO L225 Difference]: With dead ends: 36 [2018-10-24 12:23:56,452 INFO L226 Difference]: Without dead ends: 27 [2018-10-24 12:23:56,453 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-24 12:23:56,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-24 12:23:56,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-10-24 12:23:56,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-24 12:23:56,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-10-24 12:23:56,460 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 20 [2018-10-24 12:23:56,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:23:56,460 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-10-24 12:23:56,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 12:23:56,462 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-10-24 12:23:56,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-24 12:23:56,463 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:23:56,463 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:23:56,463 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:23:56,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:23:56,463 INFO L82 PathProgramCache]: Analyzing trace with hash -469535236, now seen corresponding path program 1 times [2018-10-24 12:23:56,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:23:56,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:23:56,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:23:56,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:23:56,465 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:23:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:23:56,686 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:23:56,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:23:56,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 12:23:56,686 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:23:56,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 12:23:56,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 12:23:56,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-24 12:23:56,688 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 4 states. [2018-10-24 12:23:56,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:23:56,872 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-10-24 12:23:56,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 12:23:56,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-10-24 12:23:56,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:23:56,876 INFO L225 Difference]: With dead ends: 49 [2018-10-24 12:23:56,877 INFO L226 Difference]: Without dead ends: 34 [2018-10-24 12:23:56,877 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 12:23:56,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-24 12:23:56,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2018-10-24 12:23:56,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-24 12:23:56,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-10-24 12:23:56,892 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 25 [2018-10-24 12:23:56,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:23:56,893 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-10-24 12:23:56,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 12:23:56,893 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-10-24 12:23:56,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-24 12:23:56,896 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:23:56,897 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:23:56,897 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:23:56,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:23:56,898 INFO L82 PathProgramCache]: Analyzing trace with hash -862562246, now seen corresponding path program 1 times [2018-10-24 12:23:56,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:23:56,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:23:56,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:23:56,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:23:56,901 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:23:56,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:23:57,156 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:23:57,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:23:57,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 12:23:57,157 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:23:57,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 12:23:57,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 12:23:57,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-24 12:23:57,159 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 4 states. [2018-10-24 12:23:57,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:23:57,233 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-10-24 12:23:57,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 12:23:57,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-10-24 12:23:57,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:23:57,238 INFO L225 Difference]: With dead ends: 52 [2018-10-24 12:23:57,238 INFO L226 Difference]: Without dead ends: 39 [2018-10-24 12:23:57,238 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-24 12:23:57,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-24 12:23:57,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2018-10-24 12:23:57,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-24 12:23:57,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-10-24 12:23:57,245 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 25 [2018-10-24 12:23:57,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:23:57,246 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-10-24 12:23:57,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 12:23:57,246 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-10-24 12:23:57,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-24 12:23:57,247 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:23:57,247 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:23:57,247 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:23:57,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:23:57,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1056341250, now seen corresponding path program 1 times [2018-10-24 12:23:57,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:23:57,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:23:57,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:23:57,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:23:57,249 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:23:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:23:57,745 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 16 [2018-10-24 12:23:57,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:23:57,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:23:57,999 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:23:58,000 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-10-24 12:23:58,002 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [11], [17], [19], [24], [32], [33], [37], [39], [43], [46], [48], [54], [55], [56], [58], [59], [60] [2018-10-24 12:23:58,041 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:23:58,041 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:23:58,636 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:23:58,637 INFO L272 AbstractInterpreter]: Visited 22 different actions 45 times. Merged at 8 different actions 20 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 29 variables. [2018-10-24 12:23:58,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:23:58,670 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:23:58,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:23:58,671 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 12:23:58,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:23:58,680 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:23:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:23:58,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:23:58,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-24 12:23:58,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:23:59,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-24 12:23:59,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:23:59,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2018-10-24 12:23:59,563 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:23:59,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-24 12:23:59,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-24 12:23:59,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-10-24 12:23:59,566 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 12 states. [2018-10-24 12:23:59,838 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2018-10-24 12:23:59,971 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 11 [2018-10-24 12:24:00,190 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 25 [2018-10-24 12:24:00,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:00,589 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-10-24 12:24:00,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-24 12:24:00,589 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-10-24 12:24:00,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:00,591 INFO L225 Difference]: With dead ends: 51 [2018-10-24 12:24:00,591 INFO L226 Difference]: Without dead ends: 39 [2018-10-24 12:24:00,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2018-10-24 12:24:00,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-24 12:24:00,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2018-10-24 12:24:00,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-24 12:24:00,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-10-24 12:24:00,598 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 25 [2018-10-24 12:24:00,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:00,598 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-10-24 12:24:00,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-24 12:24:00,598 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-10-24 12:24:00,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-24 12:24:00,599 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:00,599 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:00,600 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:00,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:00,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1449368260, now seen corresponding path program 1 times [2018-10-24 12:24:00,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:00,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:00,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:00,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:00,602 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:00,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:01,533 WARN L179 SmtUtils]: Spent 763.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 27 [2018-10-24 12:24:01,724 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2018-10-24 12:24:01,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:01,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:01,998 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:01,998 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-10-24 12:24:01,998 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [11], [13], [17], [19], [24], [32], [33], [37], [39], [43], [46], [48], [54], [55], [56], [58], [59], [60] [2018-10-24 12:24:02,000 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:24:02,001 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:24:02,201 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:24:02,201 INFO L272 AbstractInterpreter]: Visited 23 different actions 68 times. Merged at 9 different actions 36 times. Never widened. Found 11 fixpoints after 4 different actions. Largest state had 29 variables. [2018-10-24 12:24:02,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:02,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:24:02,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:02,239 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 12:24:02,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:02,256 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:24:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:02,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:02,343 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-24 12:24:02,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:02,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-10-24 12:24:02,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-24 12:24:02,421 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:02,423 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:02,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:02,469 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:100, output treesize:21 [2018-10-24 12:24:02,955 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-10-24 12:24:03,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:03,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:03,796 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2018-10-24 12:24:04,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:04,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:04,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 24 [2018-10-24 12:24:04,545 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:04,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-24 12:24:04,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-24 12:24:04,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2018-10-24 12:24:04,547 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2018-10-24 12:24:04,852 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2018-10-24 12:24:05,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:05,415 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-10-24 12:24:05,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 12:24:05,422 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-10-24 12:24:05,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:05,423 INFO L225 Difference]: With dead ends: 45 [2018-10-24 12:24:05,423 INFO L226 Difference]: Without dead ends: 35 [2018-10-24 12:24:05,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2018-10-24 12:24:05,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-24 12:24:05,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-10-24 12:24:05,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-24 12:24:05,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-10-24 12:24:05,431 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 25 [2018-10-24 12:24:05,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:05,431 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-10-24 12:24:05,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-24 12:24:05,431 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-10-24 12:24:05,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-24 12:24:05,432 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:05,433 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:05,433 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:05,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:05,433 INFO L82 PathProgramCache]: Analyzing trace with hash 890023736, now seen corresponding path program 1 times [2018-10-24 12:24:05,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:05,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:05,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:05,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:05,435 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:05,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:05,754 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:05,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:05,755 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:05,755 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-10-24 12:24:05,755 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [11], [13], [17], [19], [22], [24], [32], [33], [37], [39], [43], [46], [48], [54], [55], [56], [58], [59], [60] [2018-10-24 12:24:05,757 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:24:05,757 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:24:06,091 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:24:06,092 INFO L272 AbstractInterpreter]: Visited 24 different actions 137 times. Merged at 10 different actions 86 times. Widened at 2 different actions 5 times. Found 29 fixpoints after 5 different actions. Largest state had 29 variables. [2018-10-24 12:24:06,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:06,139 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:24:06,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:06,140 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 12:24:06,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:06,153 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:24:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:06,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:06,357 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:06,357 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:06,463 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:06,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:06,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-10-24 12:24:06,485 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:06,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 12:24:06,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 12:24:06,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-10-24 12:24:06,486 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 7 states. [2018-10-24 12:24:06,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:06,540 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-10-24 12:24:06,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 12:24:06,540 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-10-24 12:24:06,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:06,541 INFO L225 Difference]: With dead ends: 57 [2018-10-24 12:24:06,541 INFO L226 Difference]: Without dead ends: 44 [2018-10-24 12:24:06,542 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-10-24 12:24:06,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-24 12:24:06,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-10-24 12:24:06,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-24 12:24:06,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-10-24 12:24:06,548 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 30 [2018-10-24 12:24:06,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:06,549 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-10-24 12:24:06,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 12:24:06,549 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-10-24 12:24:06,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-24 12:24:06,550 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:06,550 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:06,550 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:06,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:06,551 INFO L82 PathProgramCache]: Analyzing trace with hash 303217722, now seen corresponding path program 2 times [2018-10-24 12:24:06,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:06,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:06,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:06,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:06,552 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:06,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:10,896 WARN L179 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 102 DAG size of output: 30 [2018-10-24 12:24:11,189 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 31 [2018-10-24 12:24:11,391 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2018-10-24 12:24:12,294 WARN L179 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2018-10-24 12:24:13,094 WARN L179 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 46 [2018-10-24 12:24:13,104 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:13,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:13,105 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:13,105 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:13,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:24:13,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:13,105 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 12:24:13,120 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:24:13,120 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:24:13,217 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-24 12:24:13,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:24:13,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:13,241 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-24 12:24:13,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:13,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-10-24 12:24:13,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-24 12:24:13,355 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:13,359 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:13,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:13,364 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:100, output treesize:21 [2018-10-24 12:24:17,025 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:17,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:17,187 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2018-10-24 12:24:17,419 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2018-10-24 12:24:18,059 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-10-24 12:24:18,699 WARN L179 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2018-10-24 12:24:18,978 WARN L179 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2018-10-24 12:24:19,219 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-10-24 12:24:19,246 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:19,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:19,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 33 [2018-10-24 12:24:19,267 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:19,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-24 12:24:19,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-24 12:24:19,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=914, Unknown=1, NotChecked=0, Total=1056 [2018-10-24 12:24:19,269 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 23 states. [2018-10-24 12:24:19,654 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 45 [2018-10-24 12:24:25,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:25,178 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2018-10-24 12:24:25,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-24 12:24:25,178 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-10-24 12:24:25,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:25,180 INFO L225 Difference]: With dead ends: 50 [2018-10-24 12:24:25,180 INFO L226 Difference]: Without dead ends: 40 [2018-10-24 12:24:25,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=229, Invalid=1176, Unknown=1, NotChecked=0, Total=1406 [2018-10-24 12:24:25,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-24 12:24:25,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-10-24 12:24:25,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-24 12:24:25,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-10-24 12:24:25,189 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 30 [2018-10-24 12:24:25,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:25,190 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-10-24 12:24:25,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-24 12:24:25,190 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-10-24 12:24:25,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-24 12:24:25,191 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:25,191 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:25,191 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:25,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:25,192 INFO L82 PathProgramCache]: Analyzing trace with hash 411764474, now seen corresponding path program 2 times [2018-10-24 12:24:25,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:25,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:25,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:24:25,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:25,195 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:25,479 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:25,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:25,479 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:25,479 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:25,480 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:24:25,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:25,480 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 12:24:25,491 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:24:25,491 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:24:25,604 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-24 12:24:25,604 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:24:25,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:25,682 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:25,682 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:25,819 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:25,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:25,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2018-10-24 12:24:25,841 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:25,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 12:24:25,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 12:24:25,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-10-24 12:24:25,847 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 9 states. [2018-10-24 12:24:25,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:25,962 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-10-24 12:24:25,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 12:24:25,964 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-10-24 12:24:25,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:25,966 INFO L225 Difference]: With dead ends: 62 [2018-10-24 12:24:25,966 INFO L226 Difference]: Without dead ends: 49 [2018-10-24 12:24:25,966 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-10-24 12:24:25,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-24 12:24:25,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2018-10-24 12:24:25,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-24 12:24:25,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-10-24 12:24:25,974 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 35 [2018-10-24 12:24:25,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:25,974 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-10-24 12:24:25,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 12:24:25,975 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-10-24 12:24:25,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-24 12:24:25,976 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:25,976 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:25,976 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:25,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:25,976 INFO L82 PathProgramCache]: Analyzing trace with hash -175041540, now seen corresponding path program 3 times [2018-10-24 12:24:25,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:25,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:25,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:24:25,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:25,978 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:26,518 WARN L179 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 29 [2018-10-24 12:24:27,244 WARN L179 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 36 [2018-10-24 12:24:28,351 WARN L179 SmtUtils]: Spent 969.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 56 [2018-10-24 12:24:28,537 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 53 [2018-10-24 12:24:29,001 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 58 [2018-10-24 12:24:29,158 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 51 [2018-10-24 12:24:29,356 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 45 [2018-10-24 12:24:29,633 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2018-10-24 12:24:30,152 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 31 [2018-10-24 12:24:30,162 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:30,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:30,162 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:30,162 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:30,162 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:24:30,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:30,163 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 12:24:30,173 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:24:30,173 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:24:30,271 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:24:30,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:24:30,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:30,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-10-24 12:24:30,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-24 12:24:30,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:30,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:30,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-10-24 12:24:30,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-24 12:24:30,311 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:30,319 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:32,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:32,348 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:100, output treesize:21 [2018-10-24 12:24:33,033 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2018-10-24 12:24:33,604 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2018-10-24 12:24:34,094 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:34,095 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:34,566 WARN L179 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 71 [2018-10-24 12:24:35,348 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2018-10-24 12:24:36,189 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-10-24 12:24:36,536 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-10-24 12:24:36,954 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-10-24 12:24:37,770 WARN L179 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2018-10-24 12:24:38,150 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-10-24 12:24:38,447 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-10-24 12:24:39,128 WARN L179 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2018-10-24 12:24:39,150 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:39,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:39,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 47 [2018-10-24 12:24:39,172 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:39,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-24 12:24:39,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-24 12:24:39,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1923, Unknown=0, NotChecked=0, Total=2162 [2018-10-24 12:24:39,174 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 32 states. [2018-10-24 12:24:39,799 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 45 [2018-10-24 12:24:40,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:40,824 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-10-24 12:24:40,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-24 12:24:40,824 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 35 [2018-10-24 12:24:40,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:40,825 INFO L225 Difference]: With dead ends: 55 [2018-10-24 12:24:40,825 INFO L226 Difference]: Without dead ends: 45 [2018-10-24 12:24:40,827 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=364, Invalid=2498, Unknown=0, NotChecked=0, Total=2862 [2018-10-24 12:24:40,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-24 12:24:40,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-10-24 12:24:40,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-24 12:24:40,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-10-24 12:24:40,834 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 35 [2018-10-24 12:24:40,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:40,834 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-10-24 12:24:40,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-24 12:24:40,835 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-10-24 12:24:40,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-24 12:24:40,836 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:40,837 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:40,837 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:40,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:40,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1953970296, now seen corresponding path program 3 times [2018-10-24 12:24:40,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:40,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:40,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:24:40,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:40,839 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:41,193 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 16 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:41,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:41,193 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:41,193 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:41,194 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:24:41,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:41,194 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:24:41,202 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:24:41,203 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:24:41,236 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:24:41,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:24:41,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:41,274 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 16 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:41,275 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:41,400 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 16 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:41,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:41,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2018-10-24 12:24:41,421 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:41,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 12:24:41,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 12:24:41,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-10-24 12:24:41,423 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 11 states. [2018-10-24 12:24:41,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:41,558 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-10-24 12:24:41,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 12:24:41,559 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2018-10-24 12:24:41,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:41,560 INFO L225 Difference]: With dead ends: 67 [2018-10-24 12:24:41,560 INFO L226 Difference]: Without dead ends: 54 [2018-10-24 12:24:41,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-10-24 12:24:41,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-24 12:24:41,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2018-10-24 12:24:41,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-24 12:24:41,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-10-24 12:24:41,568 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 40 [2018-10-24 12:24:41,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:41,569 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-10-24 12:24:41,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-24 12:24:41,569 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-10-24 12:24:41,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-24 12:24:41,570 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:41,570 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:41,570 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:41,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:41,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1367164282, now seen corresponding path program 4 times [2018-10-24 12:24:41,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:41,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:41,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:24:41,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:41,572 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:43,920 WARN L179 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 111 DAG size of output: 24 [2018-10-24 12:24:44,276 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 31 [2018-10-24 12:24:44,449 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2018-10-24 12:24:44,719 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 55 [2018-10-24 12:24:44,905 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 63 [2018-10-24 12:24:45,075 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 54 [2018-10-24 12:24:45,322 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2018-10-24 12:24:47,567 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse13 (div c_~SIZE~0 4294967296))) (let ((.cse9 (* 4294967296 .cse13))) (and (let ((.cse11 (* 2 (div c_~SIZE~0 2)))) (let ((.cse4 (= .cse11 c_~SIZE~0)) (.cse6 (<= .cse9 c_~SIZE~0)) (.cse10 (div (+ c_~SIZE~0 (* (- 4294967296) .cse13)) 2))) (let ((.cse0 (div .cse10 4294967296)) (.cse1 (or .cse4 .cse6)) (.cse12 (not (= c_~SIZE~0 (+ |c_linear_search_#in~n| .cse9)))) (.cse5 (div (+ .cse10 1) 4294967296)) (.cse2 (not .cse4)) (.cse3 (< c_~SIZE~0 .cse9))) (or (and (<= (+ .cse0 1) 0) .cse1) (let ((.cse8 (* 8589934592 .cse13))) (and (or (and (or (and .cse2 .cse3) (< 0 .cse0)) (or .cse4 (< 0 .cse5) .cse6)) (and (let ((.cse7 (<= (+ c_~SIZE~0 1) .cse9))) (or .cse7 (and (or (not (= (select (select |c_#memory_int| |c_linear_search_#in~a.base|) (- (+ .cse8 (* (- 2) c_~SIZE~0)))) |c_linear_search_#in~q|)) (< (+ .cse9 (* 2 .cse10)) c_~SIZE~0)) (or (<= c_~SIZE~0 .cse11) (<= (+ .cse9 4294967300) c_~SIZE~0) (<= (+ .cse11 2) c_~SIZE~0) .cse7 .cse12)))) (not (= c_~SIZE~0 (+ |c_linear_search_#in~n| .cse9 4294967296))))) (or (<= (* 2 c_~SIZE~0) (+ .cse8 8)) (and (<= .cse0 0) .cse1) (and .cse2 (<= .cse5 0) .cse3)))) .cse12 (and (<= (+ .cse5 1) 0) .cse2 .cse3))))) (<= c_~SIZE~0 (+ .cse9 4))))) (not (= 0 |c_linear_search_#in~a.offset|))) is different from true [2018-10-24 12:24:47,581 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:47,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:47,582 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:47,582 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:47,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:24:47,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:47,582 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:24:47,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:47,590 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:24:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:47,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:47,680 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-24 12:24:47,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:47,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-10-24 12:24:47,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-24 12:24:47,712 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:24:47,718 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:47,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:24:47,726 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:100, output treesize:21 [2018-10-24 12:24:48,692 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2018-10-24 12:24:49,421 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2018-10-24 12:24:51,391 WARN L179 SmtUtils]: Spent 873.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 40 [2018-10-24 12:24:51,579 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:51,579 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:51,923 WARN L179 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 97 [2018-10-24 12:24:53,836 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-10-24 12:24:56,483 WARN L179 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-10-24 12:24:57,071 WARN L179 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2018-10-24 12:24:57,463 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-10-24 12:24:57,988 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-10-24 12:24:59,248 WARN L179 SmtUtils]: Spent 598.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-10-24 12:25:00,463 WARN L179 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2018-10-24 12:25:00,547 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:25:00,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:25:00,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 20] total 50 [2018-10-24 12:25:00,571 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:25:00,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-24 12:25:00,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-24 12:25:00,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2136, Unknown=3, NotChecked=94, Total=2450 [2018-10-24 12:25:00,573 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 32 states. [2018-10-24 12:25:01,482 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2018-10-24 12:25:01,723 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2018-10-24 12:25:02,560 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2018-10-24 12:25:03,453 WARN L179 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2018-10-24 12:25:03,956 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 73 [2018-10-24 12:25:05,573 WARN L179 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 71 [2018-10-24 12:25:06,369 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 68 [2018-10-24 12:25:06,715 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 75 [2018-10-24 12:25:06,978 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 67 [2018-10-24 12:25:09,254 WARN L179 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 174 DAG size of output: 69 [2018-10-24 12:25:09,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:25:09,725 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-10-24 12:25:09,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-24 12:25:09,726 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2018-10-24 12:25:09,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:25:09,727 INFO L225 Difference]: With dead ends: 60 [2018-10-24 12:25:09,728 INFO L226 Difference]: Without dead ends: 50 [2018-10-24 12:25:09,729 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 25.3s TimeCoverageRelationStatistics Valid=428, Invalid=3733, Unknown=3, NotChecked=126, Total=4290 [2018-10-24 12:25:09,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-24 12:25:09,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-10-24 12:25:09,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-24 12:25:09,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-10-24 12:25:09,737 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 40 [2018-10-24 12:25:09,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:25:09,737 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-10-24 12:25:09,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-24 12:25:09,738 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-10-24 12:25:09,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-24 12:25:09,738 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:25:09,738 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:25:09,739 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:25:09,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:25:09,739 INFO L82 PathProgramCache]: Analyzing trace with hash 545539514, now seen corresponding path program 4 times [2018-10-24 12:25:09,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:25:09,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:25:09,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:25:09,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:25:09,740 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:25:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:25:12,206 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 20 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:25:12,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:25:12,206 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:25:12,206 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:25:12,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:25:12,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:25:12,207 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:25:12,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:25:12,215 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:25:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:25:12,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:25:12,369 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 20 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:25:12,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:25:12,520 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 20 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:25:12,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:25:12,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2018-10-24 12:25:12,540 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:25:12,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-24 12:25:12,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-24 12:25:12,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2018-10-24 12:25:12,541 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 13 states. [2018-10-24 12:25:12,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:25:12,769 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-10-24 12:25:12,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 12:25:12,770 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2018-10-24 12:25:12,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:25:12,771 INFO L225 Difference]: With dead ends: 72 [2018-10-24 12:25:12,771 INFO L226 Difference]: Without dead ends: 59 [2018-10-24 12:25:12,771 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2018-10-24 12:25:12,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-24 12:25:12,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2018-10-24 12:25:12,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-24 12:25:12,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-10-24 12:25:12,780 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 45 [2018-10-24 12:25:12,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:25:12,781 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-10-24 12:25:12,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-24 12:25:12,781 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-10-24 12:25:12,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-24 12:25:12,782 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:25:12,782 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:25:12,782 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:25:12,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:25:12,783 INFO L82 PathProgramCache]: Analyzing trace with hash -41266500, now seen corresponding path program 5 times [2018-10-24 12:25:12,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:25:12,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:25:12,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:25:12,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:25:12,784 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:25:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:25:13,475 WARN L179 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 28 [2018-10-24 12:25:14,719 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:25:14,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:25:14,720 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:25:14,720 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:25:14,720 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:25:14,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:25:14,720 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:25:14,729 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:25:14,729 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:25:34,786 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-24 12:25:34,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:25:34,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:25:34,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2018-10-24 12:25:34,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-24 12:25:34,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:25:34,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:25:35,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2018-10-24 12:25:35,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-24 12:25:35,044 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:25:35,138 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:25:35,140 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-24 12:25:35,140 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-24 12:25:35,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2018-10-24 12:25:35,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-24 12:25:35,148 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-24 12:25:35,166 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:25:35,173 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-24 12:25:35,174 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-24 12:25:35,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-10-24 12:25:35,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-24 12:25:35,180 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-24 12:25:35,193 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:25:35,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-24 12:25:35,296 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:445, output treesize:66 [2018-10-24 12:25:37,726 WARN L179 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 49 [2018-10-24 12:25:38,518 WARN L179 SmtUtils]: Spent 618.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-10-24 12:25:40,894 WARN L179 SmtUtils]: Spent 2.23 s on a formula simplification that was a NOOP. DAG size: 58 [2018-10-24 12:25:41,518 WARN L179 SmtUtils]: Spent 564.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-10-24 12:25:42,398 WARN L179 SmtUtils]: Spent 673.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-10-24 12:25:43,109 WARN L179 SmtUtils]: Spent 614.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-10-24 12:25:46,363 WARN L179 SmtUtils]: Spent 2.93 s on a formula simplification. DAG size of input: 69 DAG size of output: 69 [2018-10-24 12:25:46,654 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-10-24 12:25:49,338 WARN L179 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2018-10-24 12:25:50,367 WARN L179 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2018-10-24 12:25:50,630 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:25:50,631 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:25:51,079 WARN L179 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 109 [2018-10-24 12:25:51,269 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2018-10-24 12:25:52,265 WARN L179 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2018-10-24 12:25:52,515 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-10-24 12:25:52,806 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-10-24 12:25:53,074 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-10-24 12:25:53,551 WARN L179 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2018-10-24 12:25:53,923 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-10-24 12:25:54,276 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-10-24 12:25:54,850 WARN L179 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2018-10-24 12:25:55,348 WARN L179 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-10-24 12:25:56,170 WARN L179 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-10-24 12:25:56,817 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2018-10-24 12:25:57,568 WARN L179 SmtUtils]: Spent 387.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-10-24 12:25:58,899 WARN L179 SmtUtils]: Spent 877.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 78 [2018-10-24 12:26:00,105 WARN L179 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2018-10-24 12:26:01,269 WARN L179 SmtUtils]: Spent 716.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2018-10-24 12:26:02,975 WARN L179 SmtUtils]: Spent 609.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2018-10-24 12:26:03,027 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:26:03,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:26:03,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21, 22] total 55 [2018-10-24 12:26:03,050 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:26:03,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-24 12:26:03,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-24 12:26:03,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=2684, Unknown=0, NotChecked=0, Total=2970 [2018-10-24 12:26:03,052 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 35 states. [2018-10-24 12:26:04,903 WARN L179 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2018-10-24 12:26:06,129 WARN L179 SmtUtils]: Spent 877.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 51 [2018-10-24 12:26:07,807 WARN L179 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2018-10-24 12:26:09,067 WARN L179 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2018-10-24 12:26:09,899 WARN L179 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2018-10-24 12:26:09,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:26:09,973 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2018-10-24 12:26:09,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-24 12:26:09,973 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 45 [2018-10-24 12:26:09,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:26:09,975 INFO L225 Difference]: With dead ends: 65 [2018-10-24 12:26:09,975 INFO L226 Difference]: Without dead ends: 55 [2018-10-24 12:26:09,976 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 976 ImplicationChecksByTransitivity, 34.4s TimeCoverageRelationStatistics Valid=413, Invalid=3247, Unknown=0, NotChecked=0, Total=3660 [2018-10-24 12:26:09,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-24 12:26:09,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-10-24 12:26:09,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-24 12:26:09,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-10-24 12:26:09,983 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 45 [2018-10-24 12:26:09,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:26:09,984 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-10-24 12:26:09,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-24 12:26:09,984 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-10-24 12:26:09,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-24 12:26:09,985 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:26:09,985 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:26:09,985 INFO L424 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:26:09,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:26:09,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1808322120, now seen corresponding path program 5 times [2018-10-24 12:26:09,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:26:09,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:26:09,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:26:09,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:26:09,987 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:26:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:26:13,170 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 24 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:26:13,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:26:13,170 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:26:13,170 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:26:13,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:26:13,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:26:13,170 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:26:13,179 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:26:13,179 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:26:14,018 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-24 12:26:14,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:26:14,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:26:14,102 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 24 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:26:14,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:26:14,339 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 24 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:26:14,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:26:14,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2018-10-24 12:26:14,361 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:26:14,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-24 12:26:14,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-24 12:26:14,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2018-10-24 12:26:14,362 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 15 states. [2018-10-24 12:26:14,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:26:14,615 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-10-24 12:26:14,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 12:26:14,615 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2018-10-24 12:26:14,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:26:14,617 INFO L225 Difference]: With dead ends: 77 [2018-10-24 12:26:14,617 INFO L226 Difference]: Without dead ends: 64 [2018-10-24 12:26:14,618 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2018-10-24 12:26:14,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-24 12:26:14,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2018-10-24 12:26:14,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-24 12:26:14,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-10-24 12:26:14,627 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 50 [2018-10-24 12:26:14,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:26:14,628 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-10-24 12:26:14,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-24 12:26:14,628 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-10-24 12:26:14,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-24 12:26:14,629 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:26:14,629 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:26:14,629 INFO L424 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:26:14,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:26:14,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1899839162, now seen corresponding path program 6 times [2018-10-24 12:26:14,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:26:14,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:26:14,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:26:14,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:26:14,631 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:26:14,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:26:17,008 WARN L179 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 120 DAG size of output: 26 [2018-10-24 12:26:17,937 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 44 [2018-10-24 12:26:18,168 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 52 [2018-10-24 12:26:18,377 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 43 [2018-10-24 12:26:18,656 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 38 [2018-10-24 12:26:19,060 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 35 [2018-10-24 12:26:19,079 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:26:19,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:26:19,079 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:26:19,079 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:26:19,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:26:19,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:26:19,079 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:26:19,087 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:26:19,087 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:26:19,230 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:26:19,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:26:19,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:26:19,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-10-24 12:26:19,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-24 12:26:19,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:26:19,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:19,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-10-24 12:26:19,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-24 12:26:19,417 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:26:19,513 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:21,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:21,659 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:100, output treesize:21 [2018-10-24 12:26:23,032 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2018-10-24 12:26:24,693 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:26:24,694 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:26:25,312 WARN L179 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 115 [2018-10-24 12:26:26,417 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-10-24 12:26:28,007 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-10-24 12:26:28,342 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-10-24 12:26:28,787 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-10-24 12:26:29,407 WARN L179 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 87 [2018-10-24 12:26:30,106 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-10-24 12:26:30,925 WARN L179 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2018-10-24 12:26:31,671 WARN L179 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2018-10-24 12:26:33,778 WARN L179 SmtUtils]: Spent 832.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-10-24 12:26:35,842 WARN L179 SmtUtils]: Spent 839.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2018-10-24 12:26:35,900 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:26:35,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:26:35,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 21] total 56 [2018-10-24 12:26:35,922 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:26:35,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-24 12:26:35,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-24 12:26:35,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=2848, Unknown=0, NotChecked=0, Total=3080 [2018-10-24 12:26:35,924 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 37 states. [2018-10-24 12:26:36,398 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2018-10-24 12:26:37,044 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2018-10-24 12:26:38,204 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2018-10-24 12:26:38,976 WARN L179 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2018-10-24 12:26:40,754 WARN L179 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2018-10-24 12:26:41,385 WARN L179 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 81 [2018-10-24 12:26:42,217 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2018-10-24 12:26:42,881 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2018-10-24 12:26:43,180 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 81 [2018-10-24 12:26:43,606 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2018-10-24 12:26:43,962 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 67 [2018-10-24 12:26:44,228 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2018-10-24 12:26:44,449 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 60 [2018-10-24 12:26:44,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:26:44,550 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2018-10-24 12:26:44,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-24 12:26:44,555 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 50 [2018-10-24 12:26:44,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:26:44,556 INFO L225 Difference]: With dead ends: 70 [2018-10-24 12:26:44,556 INFO L226 Difference]: Without dead ends: 60 [2018-10-24 12:26:44,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=465, Invalid=5085, Unknown=0, NotChecked=0, Total=5550 [2018-10-24 12:26:44,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-24 12:26:44,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2018-10-24 12:26:44,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-24 12:26:44,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-10-24 12:26:44,565 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 50 [2018-10-24 12:26:44,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:26:44,566 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-10-24 12:26:44,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-24 12:26:44,566 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-10-24 12:26:44,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-24 12:26:44,567 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:26:44,567 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:26:44,567 INFO L424 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:26:44,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:26:44,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1410208890, now seen corresponding path program 6 times [2018-10-24 12:26:44,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:26:44,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:26:44,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:26:44,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:26:44,568 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:26:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:26:51,708 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 28 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:26:51,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:26:51,709 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:26:51,709 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:26:51,709 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:26:51,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:26:51,709 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:26:51,717 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:26:51,717 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:26:51,754 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:26:51,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:26:51,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:26:51,832 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 28 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:26:51,832 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:26:52,101 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 28 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:26:52,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:26:52,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2018-10-24 12:26:52,122 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:26:52,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-24 12:26:52,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-24 12:26:52,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=425, Unknown=1, NotChecked=0, Total=600 [2018-10-24 12:26:52,123 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 17 states. [2018-10-24 12:26:52,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:26:52,390 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2018-10-24 12:26:52,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 12:26:52,391 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2018-10-24 12:26:52,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:26:52,391 INFO L225 Difference]: With dead ends: 82 [2018-10-24 12:26:52,391 INFO L226 Difference]: Without dead ends: 69 [2018-10-24 12:26:52,392 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=174, Invalid=425, Unknown=1, NotChecked=0, Total=600 [2018-10-24 12:26:52,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-24 12:26:52,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61. [2018-10-24 12:26:52,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-24 12:26:52,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-10-24 12:26:52,401 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 55 [2018-10-24 12:26:52,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:26:52,401 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-10-24 12:26:52,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-24 12:26:52,401 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-10-24 12:26:52,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-24 12:26:52,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:26:52,403 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:26:52,403 INFO L424 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:26:52,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:26:52,403 INFO L82 PathProgramCache]: Analyzing trace with hash 823402876, now seen corresponding path program 7 times [2018-10-24 12:26:52,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:26:52,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:26:52,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:26:52,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:26:52,404 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:26:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:26:53,361 WARN L179 SmtUtils]: Spent 823.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 28 [2018-10-24 12:26:53,582 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-10-24 12:26:54,960 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:26:54,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:26:54,961 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:26:54,961 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:26:54,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:26:54,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:26:54,961 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:26:54,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:26:54,968 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:26:55,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:26:55,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:26:55,129 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-24 12:26:55,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 12:26:55,130 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-24 12:26:55,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:26:55,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2018-10-24 12:26:55,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-24 12:26:55,146 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:26:55,171 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:55,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2018-10-24 12:26:55,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-24 12:26:55,182 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-24 12:26:55,197 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:55,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-10-24 12:26:55,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-24 12:26:55,205 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-24 12:26:55,218 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:55,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2018-10-24 12:26:55,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-24 12:26:55,224 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-24 12:26:55,237 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:26:55,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-24 12:26:55,322 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:445, output treesize:66 [2018-10-24 12:26:56,274 WARN L179 SmtUtils]: Spent 618.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-10-24 12:26:56,878 WARN L179 SmtUtils]: Spent 556.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-10-24 12:26:57,200 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2018-10-24 12:26:57,823 WARN L179 SmtUtils]: Spent 569.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-10-24 12:26:59,339 WARN L179 SmtUtils]: Spent 999.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2018-10-24 12:27:00,379 WARN L179 SmtUtils]: Spent 778.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-10-24 12:27:00,960 WARN L179 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2018-10-24 12:27:01,265 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:27:01,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:27:01,843 WARN L179 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 82 [2018-10-24 12:27:02,617 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-10-24 12:27:03,942 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2018-10-24 12:27:04,321 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-10-24 12:27:04,675 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-10-24 12:27:05,149 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-10-24 12:27:05,498 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-10-24 12:27:06,075 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-10-24 12:27:06,457 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-10-24 12:27:07,145 WARN L179 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2018-10-24 12:27:09,005 WARN L179 SmtUtils]: Spent 1.28 s on a formula simplification that was a NOOP. DAG size: 64 [2018-10-24 12:27:09,496 WARN L179 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-10-24 12:27:10,308 WARN L179 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2018-10-24 12:27:11,082 WARN L179 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-10-24 12:27:11,129 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:27:11,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:27:11,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 23] total 59 [2018-10-24 12:27:11,150 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:27:11,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-24 12:27:11,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-24 12:27:11,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=3136, Unknown=0, NotChecked=0, Total=3422 [2018-10-24 12:27:11,152 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 38 states. [2018-10-24 12:27:13,061 WARN L179 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2018-10-24 12:27:14,192 WARN L179 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2018-10-24 12:27:15,488 WARN L179 SmtUtils]: Spent 834.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2018-10-24 12:27:17,176 WARN L179 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2018-10-24 12:27:18,644 WARN L179 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2018-10-24 12:27:18,953 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 76 [2018-10-24 12:27:21,433 WARN L179 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2018-10-24 12:27:24,357 WARN L179 SmtUtils]: Spent 2.81 s on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2018-10-24 12:27:26,643 WARN L179 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2018-10-24 12:27:26,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:27:26,947 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2018-10-24 12:27:26,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-24 12:27:26,948 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 55 [2018-10-24 12:27:26,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:27:26,949 INFO L225 Difference]: With dead ends: 75 [2018-10-24 12:27:26,949 INFO L226 Difference]: Without dead ends: 65 [2018-10-24 12:27:26,952 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 67 SyntacticMatches, 6 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1119 ImplicationChecksByTransitivity, 31.7s TimeCoverageRelationStatistics Valid=490, Invalid=4622, Unknown=0, NotChecked=0, Total=5112 [2018-10-24 12:27:26,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-24 12:27:26,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-10-24 12:27:26,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-24 12:27:26,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-10-24 12:27:26,963 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 55 [2018-10-24 12:27:26,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:27:26,963 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-10-24 12:27:26,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-24 12:27:26,963 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-10-24 12:27:26,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-24 12:27:26,964 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:27:26,964 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:27:26,964 INFO L424 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:27:26,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:27:26,965 INFO L82 PathProgramCache]: Analyzing trace with hash -62874888, now seen corresponding path program 7 times [2018-10-24 12:27:26,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:27:26,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:27:26,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:27:26,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:27:26,966 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:27:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:27:36,460 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 32 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:27:36,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:27:36,461 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:27:36,461 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:27:36,461 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:27:36,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:27:36,461 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:27:36,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:27:36,470 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:27:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:27:36,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:27:36,654 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 32 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:27:36,654 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:27:37,029 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 32 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:27:37,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:27:37,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2018-10-24 12:27:37,050 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:27:37,050 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-24 12:27:37,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-24 12:27:37,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=540, Unknown=2, NotChecked=0, Total=756 [2018-10-24 12:27:37,051 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 19 states. [2018-10-24 12:27:37,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:27:37,489 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2018-10-24 12:27:37,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 12:27:37,490 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-10-24 12:27:37,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:27:37,491 INFO L225 Difference]: With dead ends: 87 [2018-10-24 12:27:37,491 INFO L226 Difference]: Without dead ends: 74 [2018-10-24 12:27:37,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=214, Invalid=540, Unknown=2, NotChecked=0, Total=756 [2018-10-24 12:27:37,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-24 12:27:37,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 66. [2018-10-24 12:27:37,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-24 12:27:37,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2018-10-24 12:27:37,501 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 60 [2018-10-24 12:27:37,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:27:37,501 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2018-10-24 12:27:37,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-24 12:27:37,502 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-10-24 12:27:37,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-24 12:27:37,502 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:27:37,502 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:27:37,502 INFO L424 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:27:37,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:27:37,503 INFO L82 PathProgramCache]: Analyzing trace with hash -649680902, now seen corresponding path program 8 times [2018-10-24 12:27:37,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:27:37,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:27:37,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:27:37,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:27:37,504 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:27:37,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:27:39,847 WARN L179 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 126 DAG size of output: 24 [2018-10-24 12:27:41,059 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 45 [2018-10-24 12:27:41,277 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 53 [2018-10-24 12:27:41,450 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 44 [2018-10-24 12:27:41,734 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 44 [2018-10-24 12:27:50,177 WARN L179 SmtUtils]: Spent 8.12 s on a formula simplification. DAG size of input: 87 DAG size of output: 36 [2018-10-24 12:27:50,205 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:27:50,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:27:50,205 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:27:50,205 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:27:50,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:27:50,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:27:50,206 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:27:50,213 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:27:50,213 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown