java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loop-invgen/seq_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 20:39:56,294 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 20:39:56,296 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 20:39:56,308 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 20:39:56,308 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 20:39:56,309 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 20:39:56,311 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 20:39:56,313 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 20:39:56,315 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 20:39:56,316 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 20:39:56,317 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 20:39:56,317 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 20:39:56,318 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 20:39:56,319 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 20:39:56,320 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 20:39:56,324 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 20:39:56,325 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 20:39:56,328 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 20:39:56,332 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 20:39:56,342 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 20:39:56,343 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 20:39:56,344 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 20:39:56,349 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 20:39:56,349 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 20:39:56,349 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 20:39:56,350 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 20:39:56,353 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 20:39:56,358 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 20:39:56,360 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 20:39:56,362 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 20:39:56,362 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 20:39:56,362 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 20:39:56,363 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 20:39:56,363 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 20:39:56,365 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 20:39:56,366 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 20:39:56,367 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 20:39:56,397 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 20:39:56,398 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 20:39:56,398 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 20:39:56,399 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 20:39:56,399 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 20:39:56,399 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 20:39:56,399 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 20:39:56,400 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 20:39:56,400 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 20:39:56,400 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 20:39:56,400 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 20:39:56,400 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 20:39:56,400 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 20:39:56,401 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 20:39:56,401 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 20:39:56,402 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 20:39:56,402 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 20:39:56,402 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 20:39:56,402 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 20:39:56,402 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 20:39:56,403 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 20:39:56,403 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 20:39:56,403 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 20:39:56,403 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 20:39:56,403 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 20:39:56,403 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:39:56,404 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 20:39:56,404 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 20:39:56,404 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 20:39:56,404 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 20:39:56,404 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 20:39:56,407 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 20:39:56,407 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 20:39:56,407 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 20:39:56,408 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 20:39:56,473 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 20:39:56,492 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 20:39:56,496 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 20:39:56,498 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 20:39:56,499 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 20:39:56,500 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/seq_true-unreach-call_true-termination.i [2018-11-12 20:39:56,566 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97492238a/7f79322d09ab4c1f911f68933ecc3621/FLAGcfe4c0296 [2018-11-12 20:39:56,984 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 20:39:56,985 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/seq_true-unreach-call_true-termination.i [2018-11-12 20:39:56,991 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97492238a/7f79322d09ab4c1f911f68933ecc3621/FLAGcfe4c0296 [2018-11-12 20:39:57,008 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97492238a/7f79322d09ab4c1f911f68933ecc3621 [2018-11-12 20:39:57,021 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 20:39:57,022 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 20:39:57,023 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 20:39:57,023 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 20:39:57,027 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 20:39:57,028 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:39:57" (1/1) ... [2018-11-12 20:39:57,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@392503e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:39:57, skipping insertion in model container [2018-11-12 20:39:57,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:39:57" (1/1) ... [2018-11-12 20:39:57,042 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 20:39:57,065 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 20:39:57,304 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:39:57,307 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 20:39:57,327 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:39:57,345 INFO L193 MainTranslator]: Completed translation [2018-11-12 20:39:57,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:39:57 WrapperNode [2018-11-12 20:39:57,346 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 20:39:57,346 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 20:39:57,347 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 20:39:57,347 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 20:39:57,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:39:57" (1/1) ... [2018-11-12 20:39:57,360 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:39:57" (1/1) ... [2018-11-12 20:39:57,365 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 20:39:57,365 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 20:39:57,366 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 20:39:57,366 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 20:39:57,374 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:39:57" (1/1) ... [2018-11-12 20:39:57,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:39:57" (1/1) ... [2018-11-12 20:39:57,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:39:57" (1/1) ... [2018-11-12 20:39:57,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:39:57" (1/1) ... [2018-11-12 20:39:57,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:39:57" (1/1) ... [2018-11-12 20:39:57,386 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:39:57" (1/1) ... [2018-11-12 20:39:57,387 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:39:57" (1/1) ... [2018-11-12 20:39:57,389 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 20:39:57,396 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 20:39:57,396 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 20:39:57,396 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 20:39:57,397 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:39:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:39:57,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 20:39:57,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 20:39:57,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 20:39:57,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 20:39:57,526 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 20:39:57,526 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 20:39:57,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-12 20:39:57,526 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-12 20:39:57,908 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 20:39:57,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:39:57 BoogieIcfgContainer [2018-11-12 20:39:57,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 20:39:57,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 20:39:57,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 20:39:57,914 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 20:39:57,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:39:57" (1/3) ... [2018-11-12 20:39:57,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ff373b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:39:57, skipping insertion in model container [2018-11-12 20:39:57,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:39:57" (2/3) ... [2018-11-12 20:39:57,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ff373b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:39:57, skipping insertion in model container [2018-11-12 20:39:57,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:39:57" (3/3) ... [2018-11-12 20:39:57,921 INFO L112 eAbstractionObserver]: Analyzing ICFG seq_true-unreach-call_true-termination.i [2018-11-12 20:39:57,930 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 20:39:57,936 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 20:39:57,950 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 20:39:57,983 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 20:39:57,983 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 20:39:57,983 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 20:39:57,983 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 20:39:57,983 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 20:39:57,984 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 20:39:57,984 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 20:39:57,984 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 20:39:58,003 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-12 20:39:58,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-12 20:39:58,010 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:39:58,012 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:39:58,014 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:39:58,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:39:58,019 INFO L82 PathProgramCache]: Analyzing trace with hash 301890663, now seen corresponding path program 1 times [2018-11-12 20:39:58,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:39:58,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:58,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:39:58,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:58,069 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:39:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:39:58,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:39:58,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:39:58,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-12 20:39:58,137 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:39:58,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-12 20:39:58,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-12 20:39:58,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:39:58,160 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-12 20:39:58,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:39:58,181 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2018-11-12 20:39:58,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-12 20:39:58,183 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-12 20:39:58,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:39:58,190 INFO L225 Difference]: With dead ends: 45 [2018-11-12 20:39:58,190 INFO L226 Difference]: Without dead ends: 23 [2018-11-12 20:39:58,193 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:39:58,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-12 20:39:58,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-12 20:39:58,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-12 20:39:58,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-12 20:39:58,227 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 17 [2018-11-12 20:39:58,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:39:58,228 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-12 20:39:58,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-12 20:39:58,228 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-12 20:39:58,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-12 20:39:58,231 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:39:58,233 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:39:58,233 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:39:58,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:39:58,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1130037681, now seen corresponding path program 1 times [2018-11-12 20:39:58,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:39:58,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:58,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:39:58,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:58,237 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:39:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:39:58,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:39:58,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:39:58,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-12 20:39:58,478 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:39:58,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 20:39:58,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 20:39:58,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-12 20:39:58,481 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 7 states. [2018-11-12 20:39:58,911 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-12 20:39:58,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:39:58,955 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-12 20:39:58,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:39:58,956 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-12 20:39:58,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:39:58,959 INFO L225 Difference]: With dead ends: 48 [2018-11-12 20:39:58,959 INFO L226 Difference]: Without dead ends: 35 [2018-11-12 20:39:58,960 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-11-12 20:39:58,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-12 20:39:58,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2018-11-12 20:39:58,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-12 20:39:58,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-12 20:39:58,971 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 19 [2018-11-12 20:39:58,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:39:58,972 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-12 20:39:58,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 20:39:58,972 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-12 20:39:58,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-12 20:39:58,973 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:39:58,973 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:39:58,974 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:39:58,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:39:58,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1499928661, now seen corresponding path program 1 times [2018-11-12 20:39:58,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:39:58,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:58,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:39:58,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:58,976 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:39:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:39:59,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:39:59,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:39:59,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 20:39:59,084 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:39:59,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:39:59,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:39:59,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:39:59,085 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 6 states. [2018-11-12 20:39:59,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:39:59,173 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-12 20:39:59,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-12 20:39:59,174 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-12 20:39:59,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:39:59,175 INFO L225 Difference]: With dead ends: 42 [2018-11-12 20:39:59,176 INFO L226 Difference]: Without dead ends: 40 [2018-11-12 20:39:59,176 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-12 20:39:59,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-12 20:39:59,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2018-11-12 20:39:59,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-12 20:39:59,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-11-12 20:39:59,184 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 21 [2018-11-12 20:39:59,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:39:59,185 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-12 20:39:59,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:39:59,185 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-12 20:39:59,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-12 20:39:59,186 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:39:59,186 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:39:59,186 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:39:59,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:39:59,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1355895601, now seen corresponding path program 1 times [2018-11-12 20:39:59,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:39:59,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:59,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:39:59,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:59,188 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:39:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:39:59,439 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:39:59,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:59,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:39:59,440 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-11-12 20:39:59,442 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [20], [26], [30], [34], [36], [40], [44], [50], [52], [57], [60], [62], [65], [67], [68], [69], [70], [72], [73] [2018-11-12 20:39:59,480 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:39:59,480 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:40:00,039 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:40:00,040 INFO L272 AbstractInterpreter]: Visited 24 different actions 134 times. Merged at 8 different actions 55 times. Widened at 3 different actions 8 times. Performed 349 root evaluator evaluations with a maximum evaluation depth of 6. Performed 349 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 8 fixpoints after 3 different actions. Largest state had 12 variables. [2018-11-12 20:40:00,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:00,071 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:40:00,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:00,071 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:00,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:00,082 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:00,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:00,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:00,571 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:00,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:00,823 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:00,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:00,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2018-11-12 20:40:00,853 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:00,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-12 20:40:00,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-12 20:40:00,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-11-12 20:40:00,855 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 14 states. [2018-11-12 20:40:01,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:01,179 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2018-11-12 20:40:01,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 20:40:01,180 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2018-11-12 20:40:01,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:01,183 INFO L225 Difference]: With dead ends: 64 [2018-11-12 20:40:01,183 INFO L226 Difference]: Without dead ends: 47 [2018-11-12 20:40:01,184 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 48 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-11-12 20:40:01,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-12 20:40:01,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2018-11-12 20:40:01,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-12 20:40:01,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-11-12 20:40:01,192 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 29 [2018-11-12 20:40:01,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:01,192 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-11-12 20:40:01,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-12 20:40:01,193 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-12 20:40:01,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-12 20:40:01,194 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:01,194 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:01,194 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:01,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:01,195 INFO L82 PathProgramCache]: Analyzing trace with hash 95654235, now seen corresponding path program 1 times [2018-11-12 20:40:01,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:01,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:01,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:01,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:01,197 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:01,376 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:01,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:01,376 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:01,377 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-11-12 20:40:01,377 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [20], [22], [26], [30], [34], [40], [44], [50], [52], [57], [60], [62], [65], [67], [68], [69], [70], [72], [73] [2018-11-12 20:40:01,379 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:40:01,379 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:40:01,516 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:40:01,517 INFO L272 AbstractInterpreter]: Visited 24 different actions 142 times. Merged at 11 different actions 69 times. Widened at 4 different actions 9 times. Performed 361 root evaluator evaluations with a maximum evaluation depth of 6. Performed 361 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 8 fixpoints after 4 different actions. Largest state had 12 variables. [2018-11-12 20:40:01,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:01,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:40:01,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:01,531 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:01,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:01,543 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:01,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:01,705 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:01,706 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:01,822 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:01,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:01,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2018-11-12 20:40:01,850 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:01,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-12 20:40:01,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-12 20:40:01,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-11-12 20:40:01,852 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 13 states. [2018-11-12 20:40:02,329 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 20:40:02,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:02,388 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2018-11-12 20:40:02,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-12 20:40:02,389 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-11-12 20:40:02,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:02,390 INFO L225 Difference]: With dead ends: 79 [2018-11-12 20:40:02,391 INFO L226 Difference]: Without dead ends: 62 [2018-11-12 20:40:02,391 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-11-12 20:40:02,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-12 20:40:02,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 40. [2018-11-12 20:40:02,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-12 20:40:02,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-11-12 20:40:02,402 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 29 [2018-11-12 20:40:02,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:02,402 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-12 20:40:02,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-12 20:40:02,402 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-12 20:40:02,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-12 20:40:02,403 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:02,404 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:02,404 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:02,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:02,404 INFO L82 PathProgramCache]: Analyzing trace with hash -446111159, now seen corresponding path program 2 times [2018-11-12 20:40:02,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:02,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:02,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:02,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:02,406 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:02,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:02,509 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:02,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:02,509 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:02,510 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:02,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:02,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:02,510 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:02,519 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:40:02,519 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:40:02,548 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-12 20:40:02,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:02,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:02,608 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:02,609 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:02,647 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:02,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:02,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2018-11-12 20:40:02,667 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:02,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 20:40:02,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 20:40:02,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:40:02,669 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 10 states. [2018-11-12 20:40:02,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:02,790 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-12 20:40:02,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 20:40:02,790 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-11-12 20:40:02,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:02,792 INFO L225 Difference]: With dead ends: 50 [2018-11-12 20:40:02,792 INFO L226 Difference]: Without dead ends: 48 [2018-11-12 20:40:02,793 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-12 20:40:02,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-12 20:40:02,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-12 20:40:02,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-12 20:40:02,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-11-12 20:40:02,800 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 31 [2018-11-12 20:40:02,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:02,801 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-11-12 20:40:02,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 20:40:02,801 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-11-12 20:40:02,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-12 20:40:02,802 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:02,802 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:02,802 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:02,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:02,803 INFO L82 PathProgramCache]: Analyzing trace with hash 94447981, now seen corresponding path program 3 times [2018-11-12 20:40:02,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:02,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:02,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:02,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:02,804 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:03,056 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 20:40:03,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:03,056 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:03,057 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:03,057 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:03,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:03,057 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:03,065 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:40:03,066 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:40:03,082 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:40:03,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:03,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:03,342 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 20:40:03,342 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:03,396 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 20:40:03,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:03,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2018-11-12 20:40:03,418 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:03,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 20:40:03,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 20:40:03,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2018-11-12 20:40:03,420 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 18 states. [2018-11-12 20:40:03,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:03,829 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2018-11-12 20:40:03,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-12 20:40:03,829 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2018-11-12 20:40:03,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:03,831 INFO L225 Difference]: With dead ends: 87 [2018-11-12 20:40:03,831 INFO L226 Difference]: Without dead ends: 66 [2018-11-12 20:40:03,832 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 64 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2018-11-12 20:40:03,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-12 20:40:03,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2018-11-12 20:40:03,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-12 20:40:03,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-12 20:40:03,841 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 39 [2018-11-12 20:40:03,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:03,841 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-12 20:40:03,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 20:40:03,842 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-12 20:40:03,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-12 20:40:03,843 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:03,843 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:03,843 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:03,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:03,844 INFO L82 PathProgramCache]: Analyzing trace with hash 594202361, now seen corresponding path program 1 times [2018-11-12 20:40:03,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:03,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:03,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:03,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:03,845 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:03,970 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 20:40:03,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:03,970 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:03,970 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-11-12 20:40:03,971 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [20], [22], [26], [30], [34], [36], [40], [44], [50], [52], [57], [60], [62], [65], [67], [68], [69], [70], [72], [73] [2018-11-12 20:40:03,973 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:40:03,973 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:40:04,176 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:40:04,177 INFO L272 AbstractInterpreter]: Visited 25 different actions 205 times. Merged at 12 different actions 97 times. Widened at 5 different actions 15 times. Performed 586 root evaluator evaluations with a maximum evaluation depth of 6. Performed 586 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 19 fixpoints after 5 different actions. Largest state had 14 variables. [2018-11-12 20:40:04,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:04,215 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:40:04,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:04,215 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:04,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:04,227 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:04,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:04,988 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 20:40:04,989 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:05,077 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 20:40:05,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:05,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2018-11-12 20:40:05,098 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:05,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-12 20:40:05,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-12 20:40:05,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-11-12 20:40:05,100 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 17 states. [2018-11-12 20:40:05,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:05,382 INFO L93 Difference]: Finished difference Result 103 states and 118 transitions. [2018-11-12 20:40:05,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-12 20:40:05,382 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2018-11-12 20:40:05,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:05,383 INFO L225 Difference]: With dead ends: 103 [2018-11-12 20:40:05,384 INFO L226 Difference]: Without dead ends: 82 [2018-11-12 20:40:05,385 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 65 SyntacticMatches, 8 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2018-11-12 20:40:05,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-12 20:40:05,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 50. [2018-11-12 20:40:05,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-12 20:40:05,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-12 20:40:05,398 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 39 [2018-11-12 20:40:05,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:05,399 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-12 20:40:05,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-12 20:40:05,399 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-12 20:40:05,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-12 20:40:05,400 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:05,400 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:05,400 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:05,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:05,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1103599739, now seen corresponding path program 2 times [2018-11-12 20:40:05,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:05,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:05,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:05,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:05,402 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:05,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:05,524 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 20:40:05,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:05,525 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:05,525 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:05,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:05,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:05,525 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:05,534 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:40:05,534 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:40:05,555 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-12 20:40:05,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:05,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:06,019 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 20:40:06,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:06,167 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 20:40:06,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:06,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2018-11-12 20:40:06,188 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:06,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-12 20:40:06,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-12 20:40:06,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-11-12 20:40:06,189 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 16 states. [2018-11-12 20:40:06,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:06,499 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2018-11-12 20:40:06,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-12 20:40:06,505 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-11-12 20:40:06,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:06,507 INFO L225 Difference]: With dead ends: 122 [2018-11-12 20:40:06,507 INFO L226 Difference]: Without dead ends: 101 [2018-11-12 20:40:06,508 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 66 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2018-11-12 20:40:06,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-12 20:40:06,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 53. [2018-11-12 20:40:06,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-12 20:40:06,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-11-12 20:40:06,520 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 39 [2018-11-12 20:40:06,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:06,521 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-11-12 20:40:06,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-12 20:40:06,536 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-11-12 20:40:06,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-12 20:40:06,537 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:06,537 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:06,537 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:06,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:06,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1990570393, now seen corresponding path program 4 times [2018-11-12 20:40:06,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:06,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:06,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:06,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:06,543 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:06,665 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-12 20:40:06,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:06,665 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:06,665 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:06,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:06,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:06,665 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:06,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:06,675 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:06,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:06,731 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 20:40:06,731 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:06,848 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 20:40:06,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:06,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 11 [2018-11-12 20:40:06,870 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:06,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 20:40:06,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 20:40:06,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-12 20:40:06,871 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 11 states. [2018-11-12 20:40:07,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:07,242 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-11-12 20:40:07,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-12 20:40:07,242 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-11-12 20:40:07,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:07,244 INFO L225 Difference]: With dead ends: 63 [2018-11-12 20:40:07,244 INFO L226 Difference]: Without dead ends: 61 [2018-11-12 20:40:07,245 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 78 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-11-12 20:40:07,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-12 20:40:07,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-12 20:40:07,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-12 20:40:07,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-11-12 20:40:07,254 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 41 [2018-11-12 20:40:07,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:07,255 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-11-12 20:40:07,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 20:40:07,255 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-11-12 20:40:07,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-12 20:40:07,256 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:07,256 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:07,256 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:07,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:07,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1735104395, now seen corresponding path program 5 times [2018-11-12 20:40:07,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:07,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:07,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:07,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:07,258 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:07,609 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-12 20:40:07,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:07,609 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:07,609 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:07,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:07,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:07,610 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11-12 20:40:07,622 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:40:07,622 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:40:07,647 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-12 20:40:07,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:07,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:07,850 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-12 20:40:07,850 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:07,959 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-12 20:40:07,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:07,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 22 [2018-11-12 20:40:07,980 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:07,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-12 20:40:07,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-12 20:40:07,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2018-11-12 20:40:07,982 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 22 states. [2018-11-12 20:40:08,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:08,455 INFO L93 Difference]: Finished difference Result 110 states and 124 transitions. [2018-11-12 20:40:08,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 20:40:08,458 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2018-11-12 20:40:08,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:08,459 INFO L225 Difference]: With dead ends: 110 [2018-11-12 20:40:08,459 INFO L226 Difference]: Without dead ends: 85 [2018-11-12 20:40:08,460 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 80 SyntacticMatches, 10 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=233, Invalid=759, Unknown=0, NotChecked=0, Total=992 [2018-11-12 20:40:08,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-12 20:40:08,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 63. [2018-11-12 20:40:08,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-12 20:40:08,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-11-12 20:40:08,480 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 49 [2018-11-12 20:40:08,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:08,480 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-11-12 20:40:08,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-12 20:40:08,480 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-11-12 20:40:08,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-12 20:40:08,481 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:08,481 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:08,482 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:08,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:08,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1916583447, now seen corresponding path program 2 times [2018-11-12 20:40:08,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:08,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:08,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:08,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:08,487 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:08,657 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-12 20:40:08,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:08,657 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:08,658 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:08,658 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:08,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:08,658 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11-12 20:40:08,666 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:40:08,667 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:40:08,730 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-12 20:40:08,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:08,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:09,051 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-12 20:40:09,052 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:09,417 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-12 20:40:09,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:09,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2018-11-12 20:40:09,437 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:09,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 20:40:09,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 20:40:09,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2018-11-12 20:40:09,438 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 21 states. [2018-11-12 20:40:09,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:09,971 INFO L93 Difference]: Finished difference Result 132 states and 151 transitions. [2018-11-12 20:40:09,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 20:40:09,971 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 49 [2018-11-12 20:40:09,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:09,972 INFO L225 Difference]: With dead ends: 132 [2018-11-12 20:40:09,972 INFO L226 Difference]: Without dead ends: 107 [2018-11-12 20:40:09,973 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 81 SyntacticMatches, 10 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=253, Invalid=869, Unknown=0, NotChecked=0, Total=1122 [2018-11-12 20:40:09,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-12 20:40:09,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 63. [2018-11-12 20:40:09,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-12 20:40:09,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-11-12 20:40:09,986 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 49 [2018-11-12 20:40:09,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:09,986 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-11-12 20:40:09,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 20:40:09,986 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-11-12 20:40:09,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-12 20:40:09,987 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:09,987 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:09,988 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:09,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:09,988 INFO L82 PathProgramCache]: Analyzing trace with hash -402778205, now seen corresponding path program 3 times [2018-11-12 20:40:09,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:09,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:09,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:09,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:09,989 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:10,110 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-12 20:40:10,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:10,111 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:10,111 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:10,111 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:10,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:10,111 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11-12 20:40:10,120 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:40:10,120 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:40:10,136 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:40:10,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:10,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:10,299 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-12 20:40:10,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:10,359 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-12 20:40:10,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:10,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2018-11-12 20:40:10,381 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:10,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-12 20:40:10,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-12 20:40:10,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2018-11-12 20:40:10,382 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 20 states. [2018-11-12 20:40:10,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:10,722 INFO L93 Difference]: Finished difference Result 152 states and 176 transitions. [2018-11-12 20:40:10,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-12 20:40:10,727 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 49 [2018-11-12 20:40:10,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:10,730 INFO L225 Difference]: With dead ends: 152 [2018-11-12 20:40:10,730 INFO L226 Difference]: Without dead ends: 127 [2018-11-12 20:40:10,731 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 82 SyntacticMatches, 10 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=869, Unknown=0, NotChecked=0, Total=1122 [2018-11-12 20:40:10,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-12 20:40:10,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 63. [2018-11-12 20:40:10,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-12 20:40:10,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-11-12 20:40:10,752 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 49 [2018-11-12 20:40:10,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:10,753 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-11-12 20:40:10,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-12 20:40:10,753 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-11-12 20:40:10,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-12 20:40:10,754 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:10,754 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:10,754 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:10,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:10,755 INFO L82 PathProgramCache]: Analyzing trace with hash 488662063, now seen corresponding path program 3 times [2018-11-12 20:40:10,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:10,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:10,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:10,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:10,756 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:10,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:10,957 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-12 20:40:10,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:10,958 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:10,958 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:10,958 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:10,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:10,958 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11-12 20:40:10,966 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:40:10,967 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:40:10,979 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:40:10,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:10,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:11,138 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-12 20:40:11,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:11,364 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-12 20:40:11,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:11,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 19 [2018-11-12 20:40:11,385 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:11,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-12 20:40:11,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-12 20:40:11,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-11-12 20:40:11,387 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 19 states. [2018-11-12 20:40:12,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:12,061 INFO L93 Difference]: Finished difference Result 175 states and 205 transitions. [2018-11-12 20:40:12,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-12 20:40:12,061 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-11-12 20:40:12,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:12,063 INFO L225 Difference]: With dead ends: 175 [2018-11-12 20:40:12,063 INFO L226 Difference]: Without dead ends: 150 [2018-11-12 20:40:12,064 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 83 SyntacticMatches, 10 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=233, Invalid=759, Unknown=0, NotChecked=0, Total=992 [2018-11-12 20:40:12,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-12 20:40:12,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 66. [2018-11-12 20:40:12,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-12 20:40:12,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-11-12 20:40:12,077 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 49 [2018-11-12 20:40:12,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:12,077 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-11-12 20:40:12,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-12 20:40:12,077 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-11-12 20:40:12,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-12 20:40:12,078 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:12,078 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:12,078 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:12,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:12,079 INFO L82 PathProgramCache]: Analyzing trace with hash -396473339, now seen corresponding path program 6 times [2018-11-12 20:40:12,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:12,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:12,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:12,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:12,080 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:12,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:12,223 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 25 proven. 28 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-12 20:40:12,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:12,223 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:12,223 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:12,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:12,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:12,224 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11-12 20:40:12,232 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:40:12,233 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:40:12,247 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:40:12,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:12,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:12,274 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 26 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-12 20:40:12,274 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:12,330 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 26 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-12 20:40:12,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:12,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 12 [2018-11-12 20:40:12,350 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:12,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-12 20:40:12,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-12 20:40:12,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-12 20:40:12,351 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 12 states. [2018-11-12 20:40:12,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:12,506 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-11-12 20:40:12,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-12 20:40:12,507 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-11-12 20:40:12,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:12,508 INFO L225 Difference]: With dead ends: 76 [2018-11-12 20:40:12,509 INFO L226 Difference]: Without dead ends: 74 [2018-11-12 20:40:12,509 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 97 SyntacticMatches, 9 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-11-12 20:40:12,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-12 20:40:12,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-11-12 20:40:12,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-12 20:40:12,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-11-12 20:40:12,525 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 51 [2018-11-12 20:40:12,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:12,526 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-11-12 20:40:12,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-12 20:40:12,526 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-11-12 20:40:12,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-12 20:40:12,527 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:12,527 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:12,528 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:12,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:12,528 INFO L82 PathProgramCache]: Analyzing trace with hash 928978729, now seen corresponding path program 7 times [2018-11-12 20:40:12,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:12,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:12,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:12,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:12,529 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:12,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:12,732 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 20:40:12,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:12,732 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:12,733 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:12,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:12,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:12,733 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11-12 20:40:12,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:12,742 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:12,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:12,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:13,039 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 20:40:13,039 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:13,132 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 20:40:13,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:13,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 26 [2018-11-12 20:40:13,151 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:13,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-12 20:40:13,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-12 20:40:13,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2018-11-12 20:40:13,152 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 26 states. [2018-11-12 20:40:13,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:13,456 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2018-11-12 20:40:13,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-12 20:40:13,456 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 59 [2018-11-12 20:40:13,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:13,457 INFO L225 Difference]: With dead ends: 133 [2018-11-12 20:40:13,457 INFO L226 Difference]: Without dead ends: 104 [2018-11-12 20:40:13,458 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 96 SyntacticMatches, 12 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=315, Invalid=1091, Unknown=0, NotChecked=0, Total=1406 [2018-11-12 20:40:13,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-12 20:40:13,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 76. [2018-11-12 20:40:13,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-12 20:40:13,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-11-12 20:40:13,473 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 59 [2018-11-12 20:40:13,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:13,473 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-11-12 20:40:13,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-12 20:40:13,474 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-11-12 20:40:13,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-12 20:40:13,474 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:13,475 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:13,475 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:13,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:13,475 INFO L82 PathProgramCache]: Analyzing trace with hash 277511861, now seen corresponding path program 4 times [2018-11-12 20:40:13,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:13,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:13,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:13,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:13,476 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:13,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:13,597 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 44 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 20:40:13,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:13,598 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:13,598 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:13,598 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:13,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:13,598 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11-12 20:40:13,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:13,608 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:13,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:13,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:13,815 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 44 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 20:40:13,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:13,889 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 44 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 20:40:13,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:13,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 25 [2018-11-12 20:40:13,910 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:13,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-12 20:40:13,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-12 20:40:13,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2018-11-12 20:40:13,912 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 25 states. [2018-11-12 20:40:14,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:14,619 INFO L93 Difference]: Finished difference Result 161 states and 184 transitions. [2018-11-12 20:40:14,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-12 20:40:14,620 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 59 [2018-11-12 20:40:14,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:14,621 INFO L225 Difference]: With dead ends: 161 [2018-11-12 20:40:14,621 INFO L226 Difference]: Without dead ends: 132 [2018-11-12 20:40:14,622 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 97 SyntacticMatches, 12 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=351, Invalid=1289, Unknown=0, NotChecked=0, Total=1640 [2018-11-12 20:40:14,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-12 20:40:14,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 76. [2018-11-12 20:40:14,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-12 20:40:14,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-11-12 20:40:14,638 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 59 [2018-11-12 20:40:14,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:14,639 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-11-12 20:40:14,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-12 20:40:14,639 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-11-12 20:40:14,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-12 20:40:14,639 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:14,639 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:14,640 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:14,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:14,640 INFO L82 PathProgramCache]: Analyzing trace with hash -129869503, now seen corresponding path program 5 times [2018-11-12 20:40:14,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:14,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:14,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:14,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:14,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:14,992 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 44 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 20:40:14,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:14,993 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:14,993 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:14,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:14,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:14,994 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11-12 20:40:15,003 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:40:15,003 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:40:15,022 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-12 20:40:15,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:15,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:15,208 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 44 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 20:40:15,208 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:15,278 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 44 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 20:40:15,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:15,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 24 [2018-11-12 20:40:15,298 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:15,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-12 20:40:15,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-12 20:40:15,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2018-11-12 20:40:15,299 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 24 states. [2018-11-12 20:40:15,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:15,732 INFO L93 Difference]: Finished difference Result 187 states and 216 transitions. [2018-11-12 20:40:15,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 20:40:15,733 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 59 [2018-11-12 20:40:15,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:15,734 INFO L225 Difference]: With dead ends: 187 [2018-11-12 20:40:15,734 INFO L226 Difference]: Without dead ends: 158 [2018-11-12 20:40:15,735 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 98 SyntacticMatches, 12 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=364, Invalid=1358, Unknown=0, NotChecked=0, Total=1722 [2018-11-12 20:40:15,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-12 20:40:15,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 76. [2018-11-12 20:40:15,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-12 20:40:15,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-11-12 20:40:15,760 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 59 [2018-11-12 20:40:15,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:15,760 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-11-12 20:40:15,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-12 20:40:15,760 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-11-12 20:40:15,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-12 20:40:15,761 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:15,761 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:15,761 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:15,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:15,762 INFO L82 PathProgramCache]: Analyzing trace with hash -49846579, now seen corresponding path program 6 times [2018-11-12 20:40:15,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:15,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:15,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:15,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:15,764 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:15,937 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 44 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 20:40:15,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:15,937 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:15,937 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:15,937 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:15,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:15,937 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11-12 20:40:15,949 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:40:15,949 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:40:15,985 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:40:15,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:15,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:16,145 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 44 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 20:40:16,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:16,222 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 44 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 20:40:16,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:16,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2018-11-12 20:40:16,243 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:16,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-12 20:40:16,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-12 20:40:16,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2018-11-12 20:40:16,245 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 23 states. [2018-11-12 20:40:16,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:16,720 INFO L93 Difference]: Finished difference Result 211 states and 246 transitions. [2018-11-12 20:40:16,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-12 20:40:16,721 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 59 [2018-11-12 20:40:16,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:16,722 INFO L225 Difference]: With dead ends: 211 [2018-11-12 20:40:16,722 INFO L226 Difference]: Without dead ends: 182 [2018-11-12 20:40:16,723 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 99 SyntacticMatches, 12 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=351, Invalid=1289, Unknown=0, NotChecked=0, Total=1640 [2018-11-12 20:40:16,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-12 20:40:16,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 76. [2018-11-12 20:40:16,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-12 20:40:16,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-11-12 20:40:16,743 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 59 [2018-11-12 20:40:16,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:16,743 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-11-12 20:40:16,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-12 20:40:16,743 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-11-12 20:40:16,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-12 20:40:16,744 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:16,744 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:16,745 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:16,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:16,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1451911001, now seen corresponding path program 4 times [2018-11-12 20:40:16,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:16,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:16,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:16,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:16,746 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:16,901 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 20:40:16,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:16,901 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:16,901 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:16,901 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:16,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:16,902 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:16,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:16,914 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:16,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:17,080 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 20:40:17,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:17,152 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 20:40:17,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:17,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 22 [2018-11-12 20:40:17,172 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:17,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-12 20:40:17,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-12 20:40:17,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2018-11-12 20:40:17,173 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 22 states. [2018-11-12 20:40:17,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:17,579 INFO L93 Difference]: Finished difference Result 238 states and 280 transitions. [2018-11-12 20:40:17,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 20:40:17,580 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 59 [2018-11-12 20:40:17,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:17,581 INFO L225 Difference]: With dead ends: 238 [2018-11-12 20:40:17,581 INFO L226 Difference]: Without dead ends: 209 [2018-11-12 20:40:17,582 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 100 SyntacticMatches, 12 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=1091, Unknown=0, NotChecked=0, Total=1406 [2018-11-12 20:40:17,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-11-12 20:40:17,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 79. [2018-11-12 20:40:17,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-12 20:40:17,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2018-11-12 20:40:17,610 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 59 [2018-11-12 20:40:17,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:17,610 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2018-11-12 20:40:17,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-12 20:40:17,611 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2018-11-12 20:40:17,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-12 20:40:17,611 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:17,612 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:17,612 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:17,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:17,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1954413347, now seen corresponding path program 8 times [2018-11-12 20:40:17,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:17,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:17,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:17,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:17,613 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:18,361 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 37 proven. 46 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-12 20:40:18,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:18,362 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:18,362 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:18,362 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:18,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:18,362 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:18,373 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:40:18,373 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:40:18,396 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-12 20:40:18,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:18,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:18,423 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 38 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 20:40:18,423 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:18,490 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 38 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 20:40:18,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:18,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 13 [2018-11-12 20:40:18,510 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:18,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-12 20:40:18,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-12 20:40:18,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-11-12 20:40:18,511 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand 13 states. [2018-11-12 20:40:18,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:18,649 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-11-12 20:40:18,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-12 20:40:18,650 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2018-11-12 20:40:18,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:18,651 INFO L225 Difference]: With dead ends: 89 [2018-11-12 20:40:18,651 INFO L226 Difference]: Without dead ends: 87 [2018-11-12 20:40:18,652 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 116 SyntacticMatches, 11 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-11-12 20:40:18,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-12 20:40:18,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-11-12 20:40:18,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-12 20:40:18,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2018-11-12 20:40:18,678 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 61 [2018-11-12 20:40:18,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:18,678 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2018-11-12 20:40:18,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-12 20:40:18,678 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2018-11-12 20:40:18,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-12 20:40:18,679 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:18,679 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:18,679 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:18,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:18,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1550108743, now seen corresponding path program 9 times [2018-11-12 20:40:18,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:18,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:18,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:18,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:18,681 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:19,015 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 65 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:40:19,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:19,016 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:19,016 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:19,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:19,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:19,016 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:19,033 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:40:19,033 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:40:19,066 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:40:19,066 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:19,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:19,681 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 65 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:40:19,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:19,775 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 65 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:40:19,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:19,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 30 [2018-11-12 20:40:19,795 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:19,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-12 20:40:19,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-12 20:40:19,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2018-11-12 20:40:19,796 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand 30 states. [2018-11-12 20:40:20,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:20,470 INFO L93 Difference]: Finished difference Result 156 states and 176 transitions. [2018-11-12 20:40:20,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 20:40:20,471 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 69 [2018-11-12 20:40:20,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:20,472 INFO L225 Difference]: With dead ends: 156 [2018-11-12 20:40:20,472 INFO L226 Difference]: Without dead ends: 123 [2018-11-12 20:40:20,474 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 112 SyntacticMatches, 14 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=409, Invalid=1483, Unknown=0, NotChecked=0, Total=1892 [2018-11-12 20:40:20,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-12 20:40:20,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 89. [2018-11-12 20:40:20,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-12 20:40:20,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-11-12 20:40:20,494 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 69 [2018-11-12 20:40:20,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:20,495 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-11-12 20:40:20,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-12 20:40:20,495 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-11-12 20:40:20,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-12 20:40:20,495 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:20,495 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:20,496 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:20,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:20,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1825386707, now seen corresponding path program 7 times [2018-11-12 20:40:20,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:20,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:20,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:20,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:20,497 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:20,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:20,737 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:40:20,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:20,738 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:20,738 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:20,738 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:20,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:20,738 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:20,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:20,747 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:20,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:20,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:20,990 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:40:20,990 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:21,505 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:40:21,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:21,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 29 [2018-11-12 20:40:21,525 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:21,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-12 20:40:21,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-12 20:40:21,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2018-11-12 20:40:21,526 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 29 states. [2018-11-12 20:40:22,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:22,042 INFO L93 Difference]: Finished difference Result 190 states and 217 transitions. [2018-11-12 20:40:22,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 20:40:22,043 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 69 [2018-11-12 20:40:22,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:22,044 INFO L225 Difference]: With dead ends: 190 [2018-11-12 20:40:22,044 INFO L226 Difference]: Without dead ends: 157 [2018-11-12 20:40:22,045 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 113 SyntacticMatches, 14 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=465, Invalid=1791, Unknown=0, NotChecked=0, Total=2256 [2018-11-12 20:40:22,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-12 20:40:22,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 89. [2018-11-12 20:40:22,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-12 20:40:22,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-11-12 20:40:22,076 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 69 [2018-11-12 20:40:22,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:22,076 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-11-12 20:40:22,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-12 20:40:22,076 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-11-12 20:40:22,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-12 20:40:22,077 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:22,077 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:22,078 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:22,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:22,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1995551649, now seen corresponding path program 8 times [2018-11-12 20:40:22,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:22,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:22,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:22,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:22,079 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:22,259 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 65 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:40:22,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:22,260 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:22,260 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:22,260 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:22,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:22,260 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:22,268 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:40:22,268 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:40:22,290 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-12 20:40:22,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:22,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:22,469 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 65 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:40:22,469 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:22,631 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 65 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:40:22,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:22,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 28 [2018-11-12 20:40:22,651 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:22,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-12 20:40:22,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-12 20:40:22,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2018-11-12 20:40:22,652 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 28 states. [2018-11-12 20:40:22,987 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-12 20:40:23,317 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-12 20:40:23,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:23,757 INFO L93 Difference]: Finished difference Result 222 states and 256 transitions. [2018-11-12 20:40:23,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-12 20:40:23,758 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 69 [2018-11-12 20:40:23,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:23,759 INFO L225 Difference]: With dead ends: 222 [2018-11-12 20:40:23,759 INFO L226 Difference]: Without dead ends: 189 [2018-11-12 20:40:23,760 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 114 SyntacticMatches, 14 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 873 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=496, Invalid=1954, Unknown=0, NotChecked=0, Total=2450 [2018-11-12 20:40:23,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-11-12 20:40:23,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 89. [2018-11-12 20:40:23,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-12 20:40:23,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-11-12 20:40:23,787 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 69 [2018-11-12 20:40:23,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:23,787 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-11-12 20:40:23,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-12 20:40:23,787 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-11-12 20:40:23,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-12 20:40:23,787 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:23,788 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:23,788 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:23,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:23,788 INFO L82 PathProgramCache]: Analyzing trace with hash 632871659, now seen corresponding path program 9 times [2018-11-12 20:40:23,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:23,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:23,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:23,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:23,789 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:23,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:23,999 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 65 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:40:24,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:24,000 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:24,000 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:24,000 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:24,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:24,000 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:24,011 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:40:24,011 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:40:24,029 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:40:24,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:24,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:24,260 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 65 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:40:24,260 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:24,349 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 65 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:40:24,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:24,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2018-11-12 20:40:24,368 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:24,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-12 20:40:24,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-12 20:40:24,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2018-11-12 20:40:24,369 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 27 states. [2018-11-12 20:40:25,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:25,409 INFO L93 Difference]: Finished difference Result 252 states and 293 transitions. [2018-11-12 20:40:25,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-12 20:40:25,409 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 69 [2018-11-12 20:40:25,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:25,410 INFO L225 Difference]: With dead ends: 252 [2018-11-12 20:40:25,411 INFO L226 Difference]: Without dead ends: 219 [2018-11-12 20:40:25,411 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 115 SyntacticMatches, 14 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 849 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=496, Invalid=1954, Unknown=0, NotChecked=0, Total=2450 [2018-11-12 20:40:25,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-11-12 20:40:25,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 89. [2018-11-12 20:40:25,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-12 20:40:25,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-11-12 20:40:25,441 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 69 [2018-11-12 20:40:25,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:25,441 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-11-12 20:40:25,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-12 20:40:25,441 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-11-12 20:40:25,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-12 20:40:25,442 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:25,442 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:25,442 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:25,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:25,442 INFO L82 PathProgramCache]: Analyzing trace with hash 613260407, now seen corresponding path program 10 times [2018-11-12 20:40:25,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:25,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:25,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:25,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:25,443 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:25,649 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:40:25,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:25,650 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:25,650 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:25,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:25,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:25,650 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:25,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:25,659 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:25,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:25,862 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:40:25,863 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:25,989 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:40:26,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:26,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 26 [2018-11-12 20:40:26,009 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:26,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-12 20:40:26,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-12 20:40:26,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2018-11-12 20:40:26,010 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 26 states. [2018-11-12 20:40:26,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:26,568 INFO L93 Difference]: Finished difference Result 280 states and 328 transitions. [2018-11-12 20:40:26,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-12 20:40:26,569 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 69 [2018-11-12 20:40:26,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:26,570 INFO L225 Difference]: With dead ends: 280 [2018-11-12 20:40:26,570 INFO L226 Difference]: Without dead ends: 247 [2018-11-12 20:40:26,571 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 116 SyntacticMatches, 14 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=465, Invalid=1791, Unknown=0, NotChecked=0, Total=2256 [2018-11-12 20:40:26,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-11-12 20:40:26,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 89. [2018-11-12 20:40:26,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-12 20:40:26,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-11-12 20:40:26,608 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 69 [2018-11-12 20:40:26,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:26,609 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-11-12 20:40:26,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-12 20:40:26,609 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-11-12 20:40:26,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-12 20:40:26,609 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:26,610 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:26,610 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:26,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:26,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1618825475, now seen corresponding path program 5 times [2018-11-12 20:40:26,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:26,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:26,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:26,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:26,611 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:26,842 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 65 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:40:26,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:26,842 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:26,842 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:26,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:26,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:26,842 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:26,858 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:40:26,858 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:40:26,882 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-12 20:40:26,882 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:26,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:27,079 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 65 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:40:27,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:27,184 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 65 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:40:27,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:27,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 25 [2018-11-12 20:40:27,203 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:27,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-12 20:40:27,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-12 20:40:27,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2018-11-12 20:40:27,204 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 25 states. [2018-11-12 20:40:27,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:27,890 INFO L93 Difference]: Finished difference Result 311 states and 367 transitions. [2018-11-12 20:40:27,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-12 20:40:27,891 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 69 [2018-11-12 20:40:27,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:27,893 INFO L225 Difference]: With dead ends: 311 [2018-11-12 20:40:27,893 INFO L226 Difference]: Without dead ends: 278 [2018-11-12 20:40:27,894 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 117 SyntacticMatches, 14 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=409, Invalid=1483, Unknown=0, NotChecked=0, Total=1892 [2018-11-12 20:40:27,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-11-12 20:40:27,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 92. [2018-11-12 20:40:27,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-12 20:40:27,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2018-11-12 20:40:27,942 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 69 [2018-11-12 20:40:27,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:27,942 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2018-11-12 20:40:27,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-12 20:40:27,942 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2018-11-12 20:40:27,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-12 20:40:27,943 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:27,943 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:27,943 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:27,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:27,944 INFO L82 PathProgramCache]: Analyzing trace with hash 2111470529, now seen corresponding path program 10 times [2018-11-12 20:40:27,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:27,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:27,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:27,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:27,945 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:29,180 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 51 proven. 68 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-12 20:40:29,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:29,181 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:29,181 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:29,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:29,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:29,182 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:29,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:29,198 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:29,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:29,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:29,604 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 52 proven. 55 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:40:29,604 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:29,975 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 52 proven. 55 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:40:30,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:30,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 14 [2018-11-12 20:40:30,004 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:30,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-12 20:40:30,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-12 20:40:30,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-11-12 20:40:30,005 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand 14 states. [2018-11-12 20:40:30,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:30,302 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2018-11-12 20:40:30,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 20:40:30,302 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-11-12 20:40:30,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:30,303 INFO L225 Difference]: With dead ends: 102 [2018-11-12 20:40:30,304 INFO L226 Difference]: Without dead ends: 100 [2018-11-12 20:40:30,304 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 135 SyntacticMatches, 13 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-12 20:40:30,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-12 20:40:30,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-11-12 20:40:30,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-12 20:40:30,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2018-11-12 20:40:30,346 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 71 [2018-11-12 20:40:30,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:30,346 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2018-11-12 20:40:30,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-12 20:40:30,346 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2018-11-12 20:40:30,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-12 20:40:30,347 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:30,347 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:30,347 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:30,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:30,347 INFO L82 PathProgramCache]: Analyzing trace with hash 58575589, now seen corresponding path program 11 times [2018-11-12 20:40:30,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:30,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:30,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:30,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:30,348 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:30,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:30,596 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 90 proven. 42 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-12 20:40:30,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:30,597 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:30,597 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:30,597 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:30,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:30,597 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:30,605 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:40:30,605 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:40:30,632 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-12 20:40:30,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:30,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:30,928 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 90 proven. 42 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-12 20:40:30,929 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:31,058 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 90 proven. 42 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-12 20:40:31,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:31,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 34 [2018-11-12 20:40:31,078 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:31,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-12 20:40:31,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-12 20:40:31,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2018-11-12 20:40:31,079 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 34 states. [2018-11-12 20:40:31,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:31,834 INFO L93 Difference]: Finished difference Result 179 states and 202 transitions. [2018-11-12 20:40:31,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-12 20:40:31,834 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 79 [2018-11-12 20:40:31,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:31,835 INFO L225 Difference]: With dead ends: 179 [2018-11-12 20:40:31,836 INFO L226 Difference]: Without dead ends: 142 [2018-11-12 20:40:31,837 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 128 SyntacticMatches, 16 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=515, Invalid=1935, Unknown=0, NotChecked=0, Total=2450 [2018-11-12 20:40:31,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-12 20:40:31,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 102. [2018-11-12 20:40:31,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-12 20:40:31,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2018-11-12 20:40:31,877 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 79 [2018-11-12 20:40:31,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:31,877 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2018-11-12 20:40:31,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-12 20:40:31,877 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2018-11-12 20:40:31,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-12 20:40:31,878 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:31,878 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:31,878 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:31,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:31,878 INFO L82 PathProgramCache]: Analyzing trace with hash 127267953, now seen corresponding path program 11 times [2018-11-12 20:40:31,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:31,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:31,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:31,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:31,879 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:31,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:32,123 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 90 proven. 32 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-12 20:40:32,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:32,123 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:32,123 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:32,124 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:32,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:32,124 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:32,148 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:40:32,149 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:40:32,174 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-12 20:40:32,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:32,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:32,456 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 90 proven. 32 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-12 20:40:32,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:32,572 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 90 proven. 32 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-12 20:40:32,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:32,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 33 [2018-11-12 20:40:32,592 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:32,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-12 20:40:32,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-12 20:40:32,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=842, Unknown=0, NotChecked=0, Total=1056 [2018-11-12 20:40:32,593 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 33 states. [2018-11-12 20:40:33,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:33,333 INFO L93 Difference]: Finished difference Result 219 states and 250 transitions. [2018-11-12 20:40:33,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-12 20:40:33,334 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 79 [2018-11-12 20:40:33,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:33,335 INFO L225 Difference]: With dead ends: 219 [2018-11-12 20:40:33,335 INFO L226 Difference]: Without dead ends: 182 [2018-11-12 20:40:33,336 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 129 SyntacticMatches, 16 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=595, Invalid=2375, Unknown=0, NotChecked=0, Total=2970 [2018-11-12 20:40:33,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-12 20:40:33,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 102. [2018-11-12 20:40:33,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-12 20:40:33,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2018-11-12 20:40:33,392 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 79 [2018-11-12 20:40:33,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:33,392 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2018-11-12 20:40:33,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-12 20:40:33,392 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2018-11-12 20:40:33,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-12 20:40:33,393 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:33,393 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:33,393 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:33,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:33,394 INFO L82 PathProgramCache]: Analyzing trace with hash 310579453, now seen corresponding path program 12 times [2018-11-12 20:40:33,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:33,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:33,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:33,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:33,395 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:34,046 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 90 proven. 26 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-12 20:40:34,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:34,047 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:34,047 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:34,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:34,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:34,047 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:34,055 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:40:34,055 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:40:34,076 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:40:34,076 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:34,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:34,337 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 90 proven. 26 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-12 20:40:34,338 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:34,450 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 90 proven. 26 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-12 20:40:34,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:34,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 32 [2018-11-12 20:40:34,470 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:34,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-12 20:40:34,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-12 20:40:34,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2018-11-12 20:40:34,471 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 32 states. [2018-11-12 20:40:35,562 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-12 20:40:35,961 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-12 20:40:36,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:36,831 INFO L93 Difference]: Finished difference Result 257 states and 296 transitions. [2018-11-12 20:40:36,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-12 20:40:36,831 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 79 [2018-11-12 20:40:36,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:36,833 INFO L225 Difference]: With dead ends: 257 [2018-11-12 20:40:36,833 INFO L226 Difference]: Without dead ends: 220 [2018-11-12 20:40:36,835 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 130 SyntacticMatches, 16 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1236 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=649, Invalid=2657, Unknown=0, NotChecked=0, Total=3306 [2018-11-12 20:40:36,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-11-12 20:40:36,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 102. [2018-11-12 20:40:36,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-12 20:40:36,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2018-11-12 20:40:36,895 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 79 [2018-11-12 20:40:36,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:36,896 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2018-11-12 20:40:36,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-12 20:40:36,896 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2018-11-12 20:40:36,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-12 20:40:36,897 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:36,897 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:36,897 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:36,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:36,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1427775351, now seen corresponding path program 13 times [2018-11-12 20:40:36,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:36,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:36,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:36,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:36,899 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:37,131 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 90 proven. 24 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-12 20:40:37,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:37,131 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:37,131 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:37,131 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:37,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:37,131 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:37,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:37,141 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:37,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:37,428 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 90 proven. 24 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-12 20:40:37,428 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:37,538 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 90 proven. 24 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-12 20:40:37,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:37,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 31 [2018-11-12 20:40:37,557 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:37,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-12 20:40:37,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-12 20:40:37,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=746, Unknown=0, NotChecked=0, Total=930 [2018-11-12 20:40:37,558 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 31 states. [2018-11-12 20:40:38,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:38,308 INFO L93 Difference]: Finished difference Result 293 states and 340 transitions. [2018-11-12 20:40:38,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-12 20:40:38,308 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 79 [2018-11-12 20:40:38,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:38,309 INFO L225 Difference]: With dead ends: 293 [2018-11-12 20:40:38,310 INFO L226 Difference]: Without dead ends: 256 [2018-11-12 20:40:38,311 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 131 SyntacticMatches, 16 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1248 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=668, Invalid=2754, Unknown=0, NotChecked=0, Total=3422 [2018-11-12 20:40:38,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-11-12 20:40:38,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 102. [2018-11-12 20:40:38,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-12 20:40:38,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2018-11-12 20:40:38,355 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 79 [2018-11-12 20:40:38,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:38,355 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2018-11-12 20:40:38,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-12 20:40:38,355 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2018-11-12 20:40:38,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-12 20:40:38,356 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:38,356 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:38,356 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:38,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:38,356 INFO L82 PathProgramCache]: Analyzing trace with hash 143598357, now seen corresponding path program 14 times [2018-11-12 20:40:38,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:38,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:38,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:38,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:38,357 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:38,788 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 90 proven. 26 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-12 20:40:38,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:38,788 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:38,789 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:38,789 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:38,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:38,789 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:38,798 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:40:38,798 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:40:38,821 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-12 20:40:38,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:38,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:39,053 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 90 proven. 26 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-12 20:40:39,054 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:39,168 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 90 proven. 26 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-12 20:40:39,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:39,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 30 [2018-11-12 20:40:39,187 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:39,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-12 20:40:39,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-12 20:40:39,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2018-11-12 20:40:39,188 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 30 states. [2018-11-12 20:40:39,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:39,992 INFO L93 Difference]: Finished difference Result 327 states and 382 transitions. [2018-11-12 20:40:39,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-12 20:40:39,992 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 79 [2018-11-12 20:40:39,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:39,993 INFO L225 Difference]: With dead ends: 327 [2018-11-12 20:40:39,994 INFO L226 Difference]: Without dead ends: 290 [2018-11-12 20:40:39,995 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 132 SyntacticMatches, 16 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1182 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=649, Invalid=2657, Unknown=0, NotChecked=0, Total=3306 [2018-11-12 20:40:39,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-11-12 20:40:40,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 102. [2018-11-12 20:40:40,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-12 20:40:40,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2018-11-12 20:40:40,044 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 79 [2018-11-12 20:40:40,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:40,044 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2018-11-12 20:40:40,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-12 20:40:40,044 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2018-11-12 20:40:40,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-12 20:40:40,045 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:40,045 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:40,045 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:40,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:40,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1602250591, now seen corresponding path program 15 times [2018-11-12 20:40:40,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:40,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:40,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:40,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:40,046 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:40,564 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 90 proven. 32 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-12 20:40:40,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:40,564 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:40,564 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:40,564 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:40,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:40,564 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:40,574 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:40:40,574 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:40:40,596 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:40:40,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:40,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:40,856 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 90 proven. 32 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-12 20:40:40,856 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:40,974 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 90 proven. 32 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-12 20:40:40,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:40,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 29 [2018-11-12 20:40:40,993 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:40,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-12 20:40:40,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-12 20:40:40,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2018-11-12 20:40:40,995 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 29 states. [2018-11-12 20:40:41,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:41,817 INFO L93 Difference]: Finished difference Result 359 states and 422 transitions. [2018-11-12 20:40:41,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-12 20:40:41,821 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 79 [2018-11-12 20:40:41,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:41,823 INFO L225 Difference]: With dead ends: 359 [2018-11-12 20:40:41,823 INFO L226 Difference]: Without dead ends: 322 [2018-11-12 20:40:41,824 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 133 SyntacticMatches, 16 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=595, Invalid=2375, Unknown=0, NotChecked=0, Total=2970 [2018-11-12 20:40:41,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-11-12 20:40:41,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 102. [2018-11-12 20:40:41,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-12 20:40:41,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2018-11-12 20:40:41,892 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 79 [2018-11-12 20:40:41,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:41,892 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2018-11-12 20:40:41,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-12 20:40:41,892 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2018-11-12 20:40:41,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-12 20:40:41,893 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:41,893 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:41,893 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:41,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:41,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1326972627, now seen corresponding path program 6 times [2018-11-12 20:40:41,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:41,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:41,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:41,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:41,895 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:42,416 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 90 proven. 42 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-12 20:40:42,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:42,416 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:42,416 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:42,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:42,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:42,417 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:42,425 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:40:42,425 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:40:42,446 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:40:42,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:42,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:42,628 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 90 proven. 42 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-12 20:40:42,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:42,733 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 90 proven. 42 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-12 20:40:42,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:42,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 28 [2018-11-12 20:40:42,752 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:42,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-12 20:40:42,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-12 20:40:42,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2018-11-12 20:40:42,753 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 28 states. [2018-11-12 20:40:43,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:43,566 INFO L93 Difference]: Finished difference Result 394 states and 466 transitions. [2018-11-12 20:40:43,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-12 20:40:43,566 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 79 [2018-11-12 20:40:43,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:43,568 INFO L225 Difference]: With dead ends: 394 [2018-11-12 20:40:43,568 INFO L226 Difference]: Without dead ends: 357 [2018-11-12 20:40:43,569 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 134 SyntacticMatches, 16 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=515, Invalid=1935, Unknown=0, NotChecked=0, Total=2450 [2018-11-12 20:40:43,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-11-12 20:40:43,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 105. [2018-11-12 20:40:43,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-12 20:40:43,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2018-11-12 20:40:43,627 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 79 [2018-11-12 20:40:43,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:43,627 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2018-11-12 20:40:43,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-12 20:40:43,628 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2018-11-12 20:40:43,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-12 20:40:43,628 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:43,628 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:43,629 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:43,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:43,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1957490143, now seen corresponding path program 12 times [2018-11-12 20:40:43,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:43,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:43,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:43,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:43,630 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:43,750 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 67 proven. 94 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-12 20:40:43,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:43,751 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:43,751 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:43,751 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:43,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:43,751 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:43,759 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:40:43,759 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:40:43,781 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:40:43,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:43,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:43,823 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 68 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-12 20:40:43,824 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:43,964 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 68 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-12 20:40:43,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:43,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 15 [2018-11-12 20:40:43,985 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:43,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-12 20:40:43,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-12 20:40:43,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-11-12 20:40:43,986 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand 15 states. [2018-11-12 20:40:44,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:44,262 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2018-11-12 20:40:44,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-12 20:40:44,262 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 81 [2018-11-12 20:40:44,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:44,264 INFO L225 Difference]: With dead ends: 115 [2018-11-12 20:40:44,264 INFO L226 Difference]: Without dead ends: 113 [2018-11-12 20:40:44,265 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 154 SyntacticMatches, 15 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2018-11-12 20:40:44,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-12 20:40:44,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-11-12 20:40:44,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-12 20:40:44,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2018-11-12 20:40:44,335 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 81 [2018-11-12 20:40:44,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:44,336 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2018-11-12 20:40:44,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-12 20:40:44,336 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2018-11-12 20:40:44,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-12 20:40:44,337 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:44,337 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:44,337 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:44,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:44,338 INFO L82 PathProgramCache]: Analyzing trace with hash -507298045, now seen corresponding path program 13 times [2018-11-12 20:40:44,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:44,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:44,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:44,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:44,339 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:44,754 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 119 proven. 56 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 20:40:44,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:44,754 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:44,755 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:44,755 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:44,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:44,755 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:44,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:44,763 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:44,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:45,112 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 119 proven. 56 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 20:40:45,112 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:45,277 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 119 proven. 56 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 20:40:45,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:45,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 38 [2018-11-12 20:40:45,297 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:45,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-12 20:40:45,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-12 20:40:45,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1115, Unknown=0, NotChecked=0, Total=1406 [2018-11-12 20:40:45,298 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 38 states. [2018-11-12 20:40:46,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:46,081 INFO L93 Difference]: Finished difference Result 202 states and 228 transitions. [2018-11-12 20:40:46,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-12 20:40:46,081 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 89 [2018-11-12 20:40:46,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:46,082 INFO L225 Difference]: With dead ends: 202 [2018-11-12 20:40:46,083 INFO L226 Difference]: Without dead ends: 161 [2018-11-12 20:40:46,083 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 144 SyntacticMatches, 18 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1336 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=633, Invalid=2447, Unknown=0, NotChecked=0, Total=3080 [2018-11-12 20:40:46,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-12 20:40:46,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 115. [2018-11-12 20:40:46,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-12 20:40:46,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-11-12 20:40:46,167 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 89 [2018-11-12 20:40:46,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:46,168 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-11-12 20:40:46,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-12 20:40:46,168 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-11-12 20:40:46,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-12 20:40:46,168 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:46,169 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:46,169 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:46,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:46,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1248990833, now seen corresponding path program 16 times [2018-11-12 20:40:46,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:46,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:46,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:46,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:46,170 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:47,080 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 119 proven. 44 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 20:40:47,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:47,080 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:47,080 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:47,080 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:47,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:47,080 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:47,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:47,089 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:47,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:47,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:47,460 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 119 proven. 44 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 20:40:47,460 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:47,598 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 119 proven. 44 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 20:40:47,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:47,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 37 [2018-11-12 20:40:47,618 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:47,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-12 20:40:47,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-12 20:40:47,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=1065, Unknown=0, NotChecked=0, Total=1332 [2018-11-12 20:40:47,619 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 37 states. [2018-11-12 20:40:48,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:48,469 INFO L93 Difference]: Finished difference Result 248 states and 283 transitions. [2018-11-12 20:40:48,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-12 20:40:48,469 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 89 [2018-11-12 20:40:48,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:48,470 INFO L225 Difference]: With dead ends: 248 [2018-11-12 20:40:48,470 INFO L226 Difference]: Without dead ends: 207 [2018-11-12 20:40:48,471 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 145 SyntacticMatches, 18 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1524 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=741, Invalid=3041, Unknown=0, NotChecked=0, Total=3782 [2018-11-12 20:40:48,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-11-12 20:40:48,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 115. [2018-11-12 20:40:48,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-12 20:40:48,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-11-12 20:40:48,556 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 89 [2018-11-12 20:40:48,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:48,557 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-11-12 20:40:48,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-12 20:40:48,557 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-11-12 20:40:48,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-12 20:40:48,558 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:48,558 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 6, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:48,558 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:48,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:48,558 INFO L82 PathProgramCache]: Analyzing trace with hash 752469787, now seen corresponding path program 17 times [2018-11-12 20:40:48,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:48,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:48,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:48,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:48,559 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:48,948 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 119 proven. 36 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 20:40:48,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:48,948 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:48,948 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:48,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:48,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:48,949 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:48,958 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:40:48,958 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:40:48,992 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-12 20:40:48,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:48,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:49,279 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 119 proven. 36 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 20:40:49,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:49,508 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 119 proven. 36 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 20:40:49,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:49,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 36 [2018-11-12 20:40:49,528 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:49,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-12 20:40:49,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-12 20:40:49,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1013, Unknown=0, NotChecked=0, Total=1260 [2018-11-12 20:40:49,529 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 36 states. [2018-11-12 20:40:50,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:50,491 INFO L93 Difference]: Finished difference Result 292 states and 336 transitions. [2018-11-12 20:40:50,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-12 20:40:50,492 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 89 [2018-11-12 20:40:50,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:50,493 INFO L225 Difference]: With dead ends: 292 [2018-11-12 20:40:50,493 INFO L226 Difference]: Without dead ends: 251 [2018-11-12 20:40:50,494 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 146 SyntacticMatches, 18 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1662 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=823, Invalid=3467, Unknown=0, NotChecked=0, Total=4290 [2018-11-12 20:40:50,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-11-12 20:40:50,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 115. [2018-11-12 20:40:50,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-12 20:40:50,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-11-12 20:40:50,568 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 89 [2018-11-12 20:40:50,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:50,569 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-11-12 20:40:50,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-12 20:40:50,569 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-11-12 20:40:50,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-12 20:40:50,569 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:50,569 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:50,570 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:50,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:50,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1940416601, now seen corresponding path program 18 times [2018-11-12 20:40:50,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:50,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:50,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:50,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:50,571 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:51,159 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 119 proven. 32 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 20:40:51,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:51,160 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:51,160 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:51,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:51,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:51,160 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:51,177 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:40:51,177 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:40:51,202 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:40:51,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:51,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:51,672 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 119 proven. 32 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 20:40:51,672 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:51,801 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 119 proven. 32 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 20:40:51,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:51,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 35 [2018-11-12 20:40:51,820 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:51,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-12 20:40:51,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-12 20:40:51,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=959, Unknown=0, NotChecked=0, Total=1190 [2018-11-12 20:40:51,821 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 35 states. [2018-11-12 20:40:52,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:52,990 INFO L93 Difference]: Finished difference Result 334 states and 387 transitions. [2018-11-12 20:40:52,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-12 20:40:52,991 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 89 [2018-11-12 20:40:52,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:52,992 INFO L225 Difference]: With dead ends: 334 [2018-11-12 20:40:52,992 INFO L226 Difference]: Without dead ends: 293 [2018-11-12 20:40:52,993 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 147 SyntacticMatches, 18 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1724 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=867, Invalid=3689, Unknown=0, NotChecked=0, Total=4556 [2018-11-12 20:40:52,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-11-12 20:40:53,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 115. [2018-11-12 20:40:53,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-12 20:40:53,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-11-12 20:40:53,078 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 89 [2018-11-12 20:40:53,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:53,078 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-11-12 20:40:53,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-12 20:40:53,078 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-11-12 20:40:53,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-12 20:40:53,079 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:53,079 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:53,079 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:53,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:53,079 INFO L82 PathProgramCache]: Analyzing trace with hash 233315123, now seen corresponding path program 19 times [2018-11-12 20:40:53,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:53,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:53,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:53,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:53,080 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:53,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:53,861 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 119 proven. 32 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 20:40:53,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:53,861 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:53,861 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:53,861 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:53,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:53,861 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:53,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:53,870 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:53,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:54,157 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 119 proven. 32 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 20:40:54,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:54,498 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 119 proven. 32 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 20:40:54,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:54,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 34 [2018-11-12 20:40:54,518 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:54,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-12 20:40:54,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-12 20:40:54,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=903, Unknown=0, NotChecked=0, Total=1122 [2018-11-12 20:40:54,519 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 34 states. [2018-11-12 20:40:55,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:55,601 INFO L93 Difference]: Finished difference Result 374 states and 436 transitions. [2018-11-12 20:40:55,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-12 20:40:55,602 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 89 [2018-11-12 20:40:55,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:55,603 INFO L225 Difference]: With dead ends: 374 [2018-11-12 20:40:55,603 INFO L226 Difference]: Without dead ends: 333 [2018-11-12 20:40:55,604 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 148 SyntacticMatches, 18 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1696 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=867, Invalid=3689, Unknown=0, NotChecked=0, Total=4556 [2018-11-12 20:40:55,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-11-12 20:40:55,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 115. [2018-11-12 20:40:55,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-12 20:40:55,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-11-12 20:40:55,677 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 89 [2018-11-12 20:40:55,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:55,677 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-11-12 20:40:55,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-12 20:40:55,677 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-11-12 20:40:55,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-12 20:40:55,678 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:55,678 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 6, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:55,678 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:55,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:55,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1822167487, now seen corresponding path program 20 times [2018-11-12 20:40:55,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:55,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:55,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:55,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:55,679 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:56,142 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 119 proven. 36 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 20:40:56,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:56,143 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:56,143 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:56,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:56,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:56,143 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:56,152 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:40:56,152 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:40:56,185 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-12 20:40:56,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:56,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:56,572 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 119 proven. 36 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 20:40:56,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:56,721 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 119 proven. 36 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 20:40:56,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:56,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 33 [2018-11-12 20:40:56,742 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:56,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-12 20:40:56,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-12 20:40:56,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=845, Unknown=0, NotChecked=0, Total=1056 [2018-11-12 20:40:56,743 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 33 states. [2018-11-12 20:40:57,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:57,901 INFO L93 Difference]: Finished difference Result 412 states and 483 transitions. [2018-11-12 20:40:57,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-12 20:40:57,901 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 89 [2018-11-12 20:40:57,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:57,903 INFO L225 Difference]: With dead ends: 412 [2018-11-12 20:40:57,903 INFO L226 Difference]: Without dead ends: 371 [2018-11-12 20:40:57,904 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 149 SyntacticMatches, 18 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1572 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=823, Invalid=3467, Unknown=0, NotChecked=0, Total=4290 [2018-11-12 20:40:57,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-11-12 20:40:58,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 115. [2018-11-12 20:40:58,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-12 20:40:58,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-11-12 20:40:58,003 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 89 [2018-11-12 20:40:58,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:58,003 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-11-12 20:40:58,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-12 20:40:58,004 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-11-12 20:40:58,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-12 20:40:58,004 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:58,005 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:58,005 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:58,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:58,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1890859851, now seen corresponding path program 21 times [2018-11-12 20:40:58,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:58,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:58,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:58,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:58,007 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:58,799 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 119 proven. 44 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 20:40:58,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:58,800 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:58,800 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:58,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:58,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:58,800 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:58,809 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:40:58,810 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:40:58,834 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:40:58,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:58,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:59,120 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 119 proven. 44 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 20:40:59,120 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:59,256 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 119 proven. 44 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 20:40:59,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:59,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 32 [2018-11-12 20:40:59,276 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:59,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-12 20:40:59,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-12 20:40:59,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=785, Unknown=0, NotChecked=0, Total=992 [2018-11-12 20:40:59,277 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 32 states. [2018-11-12 20:41:00,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:00,691 INFO L93 Difference]: Finished difference Result 448 states and 528 transitions. [2018-11-12 20:41:00,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-12 20:41:00,691 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 89 [2018-11-12 20:41:00,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:00,693 INFO L225 Difference]: With dead ends: 448 [2018-11-12 20:41:00,693 INFO L226 Difference]: Without dead ends: 407 [2018-11-12 20:41:00,694 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 150 SyntacticMatches, 18 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1354 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=741, Invalid=3041, Unknown=0, NotChecked=0, Total=3782 [2018-11-12 20:41:00,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-11-12 20:41:00,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 115. [2018-11-12 20:41:00,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-12 20:41:00,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-11-12 20:41:00,788 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 89 [2018-11-12 20:41:00,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:00,789 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-11-12 20:41:00,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-12 20:41:00,789 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-11-12 20:41:00,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-12 20:41:00,789 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:00,790 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:00,790 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:00,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:00,790 INFO L82 PathProgramCache]: Analyzing trace with hash 2074171351, now seen corresponding path program 7 times [2018-11-12 20:41:00,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:00,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:00,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:41:00,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:00,791 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:00,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:01,224 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 119 proven. 56 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 20:41:01,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:01,224 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:01,224 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:01,224 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:01,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:01,224 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:01,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:01,234 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:41:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:01,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:01,785 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 119 proven. 56 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 20:41:01,786 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:01,915 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 119 proven. 56 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 20:41:01,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:01,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 31 [2018-11-12 20:41:01,934 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:01,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-12 20:41:01,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-12 20:41:01,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2018-11-12 20:41:01,936 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 31 states. [2018-11-12 20:41:03,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:03,336 INFO L93 Difference]: Finished difference Result 487 states and 577 transitions. [2018-11-12 20:41:03,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-12 20:41:03,337 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 89 [2018-11-12 20:41:03,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:03,338 INFO L225 Difference]: With dead ends: 487 [2018-11-12 20:41:03,338 INFO L226 Difference]: Without dead ends: 446 [2018-11-12 20:41:03,339 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 151 SyntacticMatches, 18 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1056 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=633, Invalid=2447, Unknown=0, NotChecked=0, Total=3080 [2018-11-12 20:41:03,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-11-12 20:41:03,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 118. [2018-11-12 20:41:03,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-12 20:41:03,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2018-11-12 20:41:03,462 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 89 [2018-11-12 20:41:03,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:03,462 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2018-11-12 20:41:03,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-12 20:41:03,462 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2018-11-12 20:41:03,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-12 20:41:03,463 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:03,463 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:03,463 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:03,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:03,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1421446787, now seen corresponding path program 14 times [2018-11-12 20:41:03,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:03,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:03,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:03,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:03,465 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:03,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:03,629 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 85 proven. 124 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-12 20:41:03,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:03,629 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:03,630 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:03,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:03,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:03,630 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:03,640 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:41:03,640 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:41:03,671 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-12 20:41:03,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:41:03,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:03,726 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 86 proven. 105 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 20:41:03,726 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:03,810 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 86 proven. 105 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 20:41:03,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:03,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 16 [2018-11-12 20:41:03,830 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:03,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-12 20:41:03,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-12 20:41:03,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-11-12 20:41:03,831 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand 16 states. [2018-11-12 20:41:04,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:04,146 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2018-11-12 20:41:04,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-12 20:41:04,147 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 91 [2018-11-12 20:41:04,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:04,148 INFO L225 Difference]: With dead ends: 128 [2018-11-12 20:41:04,148 INFO L226 Difference]: Without dead ends: 126 [2018-11-12 20:41:04,148 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 173 SyntacticMatches, 17 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2018-11-12 20:41:04,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-12 20:41:04,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-11-12 20:41:04,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-12 20:41:04,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2018-11-12 20:41:04,225 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 91 [2018-11-12 20:41:04,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:04,226 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2018-11-12 20:41:04,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-12 20:41:04,226 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2018-11-12 20:41:04,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-12 20:41:04,226 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:04,226 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:04,227 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:04,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:04,227 INFO L82 PathProgramCache]: Analyzing trace with hash -161069919, now seen corresponding path program 15 times [2018-11-12 20:41:04,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:04,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:04,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:41:04,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:04,228 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:04,551 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 152 proven. 72 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 20:41:04,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:04,552 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:04,552 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:04,552 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:04,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:04,552 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:04,563 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:41:04,563 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:41:04,593 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:41:04,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:41:04,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:05,724 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 152 proven. 72 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 20:41:05,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:05,898 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 152 proven. 72 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 20:41:05,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:05,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 42 [2018-11-12 20:41:05,919 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:05,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-12 20:41:05,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-12 20:41:05,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=1369, Unknown=0, NotChecked=0, Total=1722 [2018-11-12 20:41:05,920 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand 42 states. [2018-11-12 20:41:06,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:06,777 INFO L93 Difference]: Finished difference Result 225 states and 254 transitions. [2018-11-12 20:41:06,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 20:41:06,777 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 99 [2018-11-12 20:41:06,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:06,778 INFO L225 Difference]: With dead ends: 225 [2018-11-12 20:41:06,778 INFO L226 Difference]: Without dead ends: 180 [2018-11-12 20:41:06,779 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 160 SyntacticMatches, 20 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1688 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=763, Invalid=3019, Unknown=0, NotChecked=0, Total=3782 [2018-11-12 20:41:06,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-11-12 20:41:06,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 128. [2018-11-12 20:41:06,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-12 20:41:06,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-11-12 20:41:06,903 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 99 [2018-11-12 20:41:06,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:06,903 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-11-12 20:41:06,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-12 20:41:06,903 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-11-12 20:41:06,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-12 20:41:06,904 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:06,904 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:06,904 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:06,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:06,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1635135533, now seen corresponding path program 22 times [2018-11-12 20:41:06,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:06,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:06,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:41:06,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:06,906 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:07,528 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 152 proven. 58 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 20:41:07,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:07,528 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:07,528 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:07,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:07,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:07,529 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:07,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:07,537 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:41:07,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:07,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:07,896 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 152 proven. 58 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 20:41:07,896 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:08,072 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 152 proven. 58 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 20:41:08,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:08,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 41 [2018-11-12 20:41:08,092 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:08,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-12 20:41:08,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-12 20:41:08,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1314, Unknown=0, NotChecked=0, Total=1640 [2018-11-12 20:41:08,093 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 41 states. [2018-11-12 20:41:09,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:09,171 INFO L93 Difference]: Finished difference Result 277 states and 316 transitions. [2018-11-12 20:41:09,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-12 20:41:09,171 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 99 [2018-11-12 20:41:09,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:09,172 INFO L225 Difference]: With dead ends: 277 [2018-11-12 20:41:09,172 INFO L226 Difference]: Without dead ends: 232 [2018-11-12 20:41:09,173 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 161 SyntacticMatches, 20 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1944 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=903, Invalid=3789, Unknown=0, NotChecked=0, Total=4692 [2018-11-12 20:41:09,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-11-12 20:41:09,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 128. [2018-11-12 20:41:09,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-12 20:41:09,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-11-12 20:41:09,340 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 99 [2018-11-12 20:41:09,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:09,340 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-11-12 20:41:09,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-12 20:41:09,340 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-11-12 20:41:09,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-12 20:41:09,341 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:09,341 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 7, 6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:09,342 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:09,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:09,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1382256313, now seen corresponding path program 23 times [2018-11-12 20:41:09,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:09,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:09,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:09,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:09,343 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:09,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:10,003 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 152 proven. 48 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 20:41:10,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:10,003 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:10,003 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:10,003 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:10,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:10,003 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:10,014 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:41:10,014 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:41:10,050 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-12 20:41:10,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:41:10,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:11,803 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 152 proven. 48 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 20:41:11,804 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:12,062 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 152 proven. 48 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 20:41:12,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:12,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 40 [2018-11-12 20:41:12,082 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:12,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-12 20:41:12,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-12 20:41:12,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=1257, Unknown=0, NotChecked=0, Total=1560 [2018-11-12 20:41:12,082 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 40 states. [2018-11-12 20:41:13,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:13,336 INFO L93 Difference]: Finished difference Result 327 states and 376 transitions. [2018-11-12 20:41:13,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-12 20:41:13,337 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 99 [2018-11-12 20:41:13,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:13,338 INFO L225 Difference]: With dead ends: 327 [2018-11-12 20:41:13,338 INFO L226 Difference]: Without dead ends: 282 [2018-11-12 20:41:13,339 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 162 SyntacticMatches, 20 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2151 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1018, Invalid=4384, Unknown=0, NotChecked=0, Total=5402 [2018-11-12 20:41:13,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-11-12 20:41:13,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 128. [2018-11-12 20:41:13,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-12 20:41:13,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-11-12 20:41:13,443 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 99 [2018-11-12 20:41:13,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:13,443 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-11-12 20:41:13,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-12 20:41:13,444 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-11-12 20:41:13,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-12 20:41:13,444 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:13,444 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 6, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:13,444 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:13,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:13,445 INFO L82 PathProgramCache]: Analyzing trace with hash 2012160069, now seen corresponding path program 24 times [2018-11-12 20:41:13,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:13,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:13,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:41:13,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:13,446 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:14,284 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 152 proven. 42 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 20:41:14,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:14,285 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:14,285 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:14,285 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:14,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:14,285 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:14,293 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:41:14,293 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:41:14,317 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:41:14,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:41:14,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:14,636 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 152 proven. 42 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 20:41:14,636 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:14,834 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 152 proven. 42 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 20:41:14,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:14,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 39 [2018-11-12 20:41:14,853 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:14,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-12 20:41:14,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-12 20:41:14,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=1198, Unknown=0, NotChecked=0, Total=1482 [2018-11-12 20:41:14,855 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 39 states. [2018-11-12 20:41:16,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:16,394 INFO L93 Difference]: Finished difference Result 375 states and 434 transitions. [2018-11-12 20:41:16,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-12 20:41:16,395 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 99 [2018-11-12 20:41:16,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:16,396 INFO L225 Difference]: With dead ends: 375 [2018-11-12 20:41:16,396 INFO L226 Difference]: Without dead ends: 330 [2018-11-12 20:41:16,397 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 163 SyntacticMatches, 20 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2277 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1093, Invalid=4759, Unknown=0, NotChecked=0, Total=5852 [2018-11-12 20:41:16,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-11-12 20:41:16,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 128. [2018-11-12 20:41:16,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-12 20:41:16,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-11-12 20:41:16,542 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 99 [2018-11-12 20:41:16,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:16,543 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-11-12 20:41:16,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-12 20:41:16,543 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-11-12 20:41:16,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-12 20:41:16,543 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:16,544 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:16,544 INFO L423 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:16,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:16,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1173773103, now seen corresponding path program 25 times [2018-11-12 20:41:16,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:16,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:16,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:41:16,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:16,545 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:16,809 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 152 proven. 40 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 20:41:16,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:16,809 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:16,809 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:16,810 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:16,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:16,810 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:16,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:16,819 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:41:16,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:16,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:17,306 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 152 proven. 40 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 20:41:17,306 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:17,494 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 152 proven. 40 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 20:41:17,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:17,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 38 [2018-11-12 20:41:17,515 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:17,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-12 20:41:17,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-12 20:41:17,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=1137, Unknown=0, NotChecked=0, Total=1406 [2018-11-12 20:41:17,516 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 38 states. [2018-11-12 20:41:18,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:18,998 INFO L93 Difference]: Finished difference Result 421 states and 490 transitions. [2018-11-12 20:41:18,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-12 20:41:18,998 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 99 [2018-11-12 20:41:18,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:19,000 INFO L225 Difference]: With dead ends: 421 [2018-11-12 20:41:19,000 INFO L226 Difference]: Without dead ends: 376 [2018-11-12 20:41:19,001 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 164 SyntacticMatches, 20 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2302 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1119, Invalid=4887, Unknown=0, NotChecked=0, Total=6006 [2018-11-12 20:41:19,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-11-12 20:41:19,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 128. [2018-11-12 20:41:19,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-12 20:41:19,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-11-12 20:41:19,119 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 99 [2018-11-12 20:41:19,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:19,120 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-11-12 20:41:19,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-12 20:41:19,120 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-11-12 20:41:19,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-12 20:41:19,120 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:19,121 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 6, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:19,121 INFO L423 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:19,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:19,121 INFO L82 PathProgramCache]: Analyzing trace with hash -975971235, now seen corresponding path program 26 times [2018-11-12 20:41:19,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:19,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:19,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:19,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:19,123 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:19,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:19,370 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 152 proven. 42 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 20:41:19,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:19,370 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:19,370 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:19,371 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:19,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:19,371 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:19,381 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:41:19,382 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:41:19,411 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-12 20:41:19,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:41:19,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:19,767 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 152 proven. 42 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 20:41:19,767 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:19,933 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 152 proven. 42 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 20:41:19,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:19,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 37 [2018-11-12 20:41:19,953 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:19,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-12 20:41:19,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-12 20:41:19,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=1074, Unknown=0, NotChecked=0, Total=1332 [2018-11-12 20:41:19,954 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 37 states. [2018-11-12 20:41:21,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:21,501 INFO L93 Difference]: Finished difference Result 465 states and 544 transitions. [2018-11-12 20:41:21,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-12 20:41:21,502 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 99 [2018-11-12 20:41:21,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:21,504 INFO L225 Difference]: With dead ends: 465 [2018-11-12 20:41:21,504 INFO L226 Difference]: Without dead ends: 420 [2018-11-12 20:41:21,505 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 165 SyntacticMatches, 20 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2217 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1093, Invalid=4759, Unknown=0, NotChecked=0, Total=5852 [2018-11-12 20:41:21,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2018-11-12 20:41:21,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 128. [2018-11-12 20:41:21,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-12 20:41:21,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-11-12 20:41:21,631 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 99 [2018-11-12 20:41:21,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:21,631 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-11-12 20:41:21,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-12 20:41:21,631 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-11-12 20:41:21,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-12 20:41:21,632 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:21,632 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 7, 6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:21,633 INFO L423 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:21,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:21,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1717664023, now seen corresponding path program 27 times [2018-11-12 20:41:21,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:21,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:21,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:41:21,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:21,634 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:21,894 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 152 proven. 48 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 20:41:21,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:21,895 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:21,895 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:21,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:21,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:21,895 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:21,903 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:41:21,904 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:41:21,933 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:41:21,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:41:21,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:22,274 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 152 proven. 48 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 20:41:22,274 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:22,428 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 152 proven. 48 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 20:41:22,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:22,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 36 [2018-11-12 20:41:22,448 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:22,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-12 20:41:22,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-12 20:41:22,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1009, Unknown=0, NotChecked=0, Total=1260 [2018-11-12 20:41:22,449 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 36 states. [2018-11-12 20:41:24,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:24,116 INFO L93 Difference]: Finished difference Result 507 states and 596 transitions. [2018-11-12 20:41:24,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-12 20:41:24,116 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 99 [2018-11-12 20:41:24,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:24,118 INFO L225 Difference]: With dead ends: 507 [2018-11-12 20:41:24,118 INFO L226 Difference]: Without dead ends: 462 [2018-11-12 20:41:24,119 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 166 SyntacticMatches, 20 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2019 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1018, Invalid=4384, Unknown=0, NotChecked=0, Total=5402 [2018-11-12 20:41:24,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-11-12 20:41:24,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 128. [2018-11-12 20:41:24,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-12 20:41:24,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-11-12 20:41:24,243 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 99 [2018-11-12 20:41:24,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:24,243 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-11-12 20:41:24,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-12 20:41:24,243 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-11-12 20:41:24,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-12 20:41:24,244 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:24,244 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:24,244 INFO L423 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:24,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:24,244 INFO L82 PathProgramCache]: Analyzing trace with hash 283796597, now seen corresponding path program 28 times [2018-11-12 20:41:24,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:24,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:24,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:41:24,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:24,245 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:24,497 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 152 proven. 58 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 20:41:24,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:24,497 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:24,497 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:24,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:24,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:24,498 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:24,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:24,508 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:41:24,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:24,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:24,797 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 152 proven. 58 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 20:41:24,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:24,952 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 152 proven. 58 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 20:41:24,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:24,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 35 [2018-11-12 20:41:24,972 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:24,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-12 20:41:24,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-12 20:41:24,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=942, Unknown=0, NotChecked=0, Total=1190 [2018-11-12 20:41:24,973 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 35 states. [2018-11-12 20:41:26,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:26,676 INFO L93 Difference]: Finished difference Result 547 states and 646 transitions. [2018-11-12 20:41:26,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-12 20:41:26,676 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 99 [2018-11-12 20:41:26,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:26,678 INFO L225 Difference]: With dead ends: 547 [2018-11-12 20:41:26,679 INFO L226 Difference]: Without dead ends: 502 [2018-11-12 20:41:26,680 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 167 SyntacticMatches, 20 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1716 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=903, Invalid=3789, Unknown=0, NotChecked=0, Total=4692 [2018-11-12 20:41:26,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2018-11-12 20:41:26,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 128. [2018-11-12 20:41:26,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-12 20:41:26,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-11-12 20:41:26,834 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 99 [2018-11-12 20:41:26,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:26,834 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-11-12 20:41:26,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-12 20:41:26,834 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-11-12 20:41:26,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-12 20:41:26,835 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:26,835 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:26,835 INFO L423 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:26,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:26,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1885877505, now seen corresponding path program 8 times [2018-11-12 20:41:26,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:26,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:26,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:26,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:26,836 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:27,067 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 152 proven. 72 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 20:41:27,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:27,067 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:27,067 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:27,067 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:27,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:27,068 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:27,095 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:41:27,096 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:41:27,127 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-12 20:41:27,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:41:27,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:27,424 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 152 proven. 72 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 20:41:27,425 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:27,580 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 152 proven. 72 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 20:41:27,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:27,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 34 [2018-11-12 20:41:27,599 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:27,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-12 20:41:27,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-12 20:41:27,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=873, Unknown=0, NotChecked=0, Total=1122 [2018-11-12 20:41:27,600 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 34 states. [2018-11-12 20:41:29,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:29,309 INFO L93 Difference]: Finished difference Result 590 states and 700 transitions. [2018-11-12 20:41:29,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-12 20:41:29,309 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 99 [2018-11-12 20:41:29,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:29,312 INFO L225 Difference]: With dead ends: 590 [2018-11-12 20:41:29,312 INFO L226 Difference]: Without dead ends: 545 [2018-11-12 20:41:29,312 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 168 SyntacticMatches, 20 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1328 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=763, Invalid=3019, Unknown=0, NotChecked=0, Total=3782 [2018-11-12 20:41:29,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2018-11-12 20:41:29,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 131. [2018-11-12 20:41:29,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-12 20:41:29,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2018-11-12 20:41:29,453 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 99 [2018-11-12 20:41:29,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:29,454 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2018-11-12 20:41:29,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-12 20:41:29,454 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2018-11-12 20:41:29,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-12 20:41:29,455 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:29,455 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:29,455 INFO L423 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:29,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:29,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1743772005, now seen corresponding path program 16 times [2018-11-12 20:41:29,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:29,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:29,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:41:29,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:29,457 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:29,663 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 105 proven. 158 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-12 20:41:29,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:29,663 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:29,663 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:29,663 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:29,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:29,664 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:29,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:29,672 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:41:29,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:29,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:29,941 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 106 proven. 136 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 20:41:29,941 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:30,075 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 106 proven. 136 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 20:41:30,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:30,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 17 [2018-11-12 20:41:30,095 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:30,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-12 20:41:30,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-12 20:41:30,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2018-11-12 20:41:30,095 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand 17 states. [2018-11-12 20:41:30,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:30,406 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2018-11-12 20:41:30,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-12 20:41:30,407 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 101 [2018-11-12 20:41:30,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:30,408 INFO L225 Difference]: With dead ends: 141 [2018-11-12 20:41:30,408 INFO L226 Difference]: Without dead ends: 139 [2018-11-12 20:41:30,408 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 192 SyntacticMatches, 19 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-11-12 20:41:30,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-12 20:41:30,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-11-12 20:41:30,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-12 20:41:30,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 150 transitions. [2018-11-12 20:41:30,534 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 150 transitions. Word has length 101 [2018-11-12 20:41:30,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:30,534 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 150 transitions. [2018-11-12 20:41:30,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-12 20:41:30,534 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 150 transitions. [2018-11-12 20:41:30,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-12 20:41:30,534 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:30,535 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:30,535 INFO L423 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:30,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:30,535 INFO L82 PathProgramCache]: Analyzing trace with hash -860881985, now seen corresponding path program 17 times [2018-11-12 20:41:30,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:30,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:30,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:30,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:30,536 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:31,386 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 189 proven. 90 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:41:31,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:31,387 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:31,387 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:31,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:31,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:31,387 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:31,396 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:41:31,396 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:41:31,428 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-12 20:41:31,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:41:31,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:32,138 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 189 proven. 90 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:41:32,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:32,355 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 189 proven. 90 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:41:32,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:32,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 46 [2018-11-12 20:41:32,374 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:32,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-12 20:41:32,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-12 20:41:32,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=1649, Unknown=0, NotChecked=0, Total=2070 [2018-11-12 20:41:32,375 INFO L87 Difference]: Start difference. First operand 139 states and 150 transitions. Second operand 46 states. [2018-11-12 20:41:33,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:33,268 INFO L93 Difference]: Finished difference Result 248 states and 280 transitions. [2018-11-12 20:41:33,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-12 20:41:33,269 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 109 [2018-11-12 20:41:33,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:33,269 INFO L225 Difference]: With dead ends: 248 [2018-11-12 20:41:33,270 INFO L226 Difference]: Without dead ends: 199 [2018-11-12 20:41:33,270 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 176 SyntacticMatches, 22 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2081 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=905, Invalid=3651, Unknown=0, NotChecked=0, Total=4556 [2018-11-12 20:41:33,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-12 20:41:33,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 141. [2018-11-12 20:41:33,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-12 20:41:33,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2018-11-12 20:41:33,415 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 109 [2018-11-12 20:41:33,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:33,415 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2018-11-12 20:41:33,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-12 20:41:33,416 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2018-11-12 20:41:33,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-12 20:41:33,416 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:33,416 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:33,416 INFO L423 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:33,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:33,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1311238219, now seen corresponding path program 29 times [2018-11-12 20:41:33,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:33,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:33,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:41:33,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:33,418 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:33,982 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 189 proven. 74 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:41:33,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:33,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:33,983 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:33,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:33,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:33,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:33,993 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:41:33,993 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:41:34,028 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-12 20:41:34,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:41:34,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:34,463 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 189 proven. 74 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:41:34,463 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:34,657 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 189 proven. 74 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:41:34,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:34,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 45 [2018-11-12 20:41:34,677 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:34,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-12 20:41:34,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-12 20:41:34,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=1589, Unknown=0, NotChecked=0, Total=1980 [2018-11-12 20:41:34,678 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand 45 states. [2018-11-12 20:41:35,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:35,997 INFO L93 Difference]: Finished difference Result 306 states and 349 transitions. [2018-11-12 20:41:35,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-12 20:41:35,997 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 109 [2018-11-12 20:41:35,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:35,998 INFO L225 Difference]: With dead ends: 306 [2018-11-12 20:41:35,999 INFO L226 Difference]: Without dead ends: 257 [2018-11-12 20:41:35,999 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 177 SyntacticMatches, 22 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1081, Invalid=4619, Unknown=0, NotChecked=0, Total=5700 [2018-11-12 20:41:36,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-11-12 20:41:36,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 141. [2018-11-12 20:41:36,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-12 20:41:36,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2018-11-12 20:41:36,241 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 109 [2018-11-12 20:41:36,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:36,241 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2018-11-12 20:41:36,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-12 20:41:36,241 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2018-11-12 20:41:36,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-12 20:41:36,242 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:36,242 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 8, 7, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:36,242 INFO L423 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:36,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:36,243 INFO L82 PathProgramCache]: Analyzing trace with hash 562661335, now seen corresponding path program 30 times [2018-11-12 20:41:36,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:36,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:36,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:41:36,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:36,244 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:38,656 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 189 proven. 62 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:41:38,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:38,657 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:38,657 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:38,657 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:38,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:38,657 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:38,667 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:41:38,667 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:41:38,693 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:41:38,693 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:41:38,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:39,097 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 189 proven. 62 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:41:39,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:39,324 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 189 proven. 62 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:41:39,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:39,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 44 [2018-11-12 20:41:39,345 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:39,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-12 20:41:39,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-12 20:41:39,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=365, Invalid=1527, Unknown=0, NotChecked=0, Total=1892 [2018-11-12 20:41:39,346 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand 44 states. [2018-11-12 20:41:41,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:41,007 INFO L93 Difference]: Finished difference Result 362 states and 416 transitions. [2018-11-12 20:41:41,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-12 20:41:41,008 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 109 [2018-11-12 20:41:41,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:41,009 INFO L225 Difference]: With dead ends: 362 [2018-11-12 20:41:41,009 INFO L226 Difference]: Without dead ends: 313 [2018-11-12 20:41:41,009 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 178 SyntacticMatches, 22 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2703 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1234, Invalid=5408, Unknown=0, NotChecked=0, Total=6642 [2018-11-12 20:41:41,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-11-12 20:41:41,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 141. [2018-11-12 20:41:41,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-12 20:41:41,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2018-11-12 20:41:41,199 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 109 [2018-11-12 20:41:41,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:41,199 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2018-11-12 20:41:41,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-12 20:41:41,199 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2018-11-12 20:41:41,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-12 20:41:41,200 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:41,200 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 7, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:41,201 INFO L423 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:41,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:41,201 INFO L82 PathProgramCache]: Analyzing trace with hash 195402339, now seen corresponding path program 31 times [2018-11-12 20:41:41,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:41,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:41,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:41:41,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:41,202 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:41,541 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 189 proven. 54 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:41:41,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:41,541 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:41,542 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:41,542 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:41,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:41,542 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:41,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:41,550 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:41:41,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:41,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:42,331 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 189 proven. 54 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:41:42,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:42,514 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 189 proven. 54 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:41:42,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:42,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 43 [2018-11-12 20:41:42,535 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:42,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-12 20:41:42,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-12 20:41:42,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=1463, Unknown=0, NotChecked=0, Total=1806 [2018-11-12 20:41:42,536 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand 43 states. [2018-11-12 20:41:44,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:44,398 INFO L93 Difference]: Finished difference Result 416 states and 481 transitions. [2018-11-12 20:41:44,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-12 20:41:44,398 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 109 [2018-11-12 20:41:44,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:44,400 INFO L225 Difference]: With dead ends: 416 [2018-11-12 20:41:44,400 INFO L226 Difference]: Without dead ends: 367 [2018-11-12 20:41:44,401 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 179 SyntacticMatches, 22 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2907 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1346, Invalid=5964, Unknown=0, NotChecked=0, Total=7310 [2018-11-12 20:41:44,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-11-12 20:41:44,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 141. [2018-11-12 20:41:44,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-12 20:41:44,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2018-11-12 20:41:44,638 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 109 [2018-11-12 20:41:44,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:44,639 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2018-11-12 20:41:44,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-12 20:41:44,639 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2018-11-12 20:41:44,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-12 20:41:44,640 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:44,640 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 6, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:44,640 INFO L423 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:44,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:44,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1316806639, now seen corresponding path program 32 times [2018-11-12 20:41:44,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:44,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:44,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:44,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:44,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:44,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:45,930 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 189 proven. 50 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:41:45,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:45,931 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:45,931 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:45,931 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:45,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:45,931 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:45,940 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:41:45,940 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:41:45,975 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-12 20:41:45,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:41:45,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:46,352 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 189 proven. 50 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:41:46,352 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:46,539 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 189 proven. 50 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:41:46,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:46,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 42 [2018-11-12 20:41:46,559 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:46,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-12 20:41:46,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-12 20:41:46,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=1397, Unknown=0, NotChecked=0, Total=1722 [2018-11-12 20:41:46,560 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand 42 states. [2018-11-12 20:41:48,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:48,620 INFO L93 Difference]: Finished difference Result 468 states and 544 transitions. [2018-11-12 20:41:48,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-12 20:41:48,620 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 109 [2018-11-12 20:41:48,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:48,622 INFO L225 Difference]: With dead ends: 468 [2018-11-12 20:41:48,622 INFO L226 Difference]: Without dead ends: 419 [2018-11-12 20:41:48,623 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 180 SyntacticMatches, 22 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3001 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1405, Invalid=6251, Unknown=0, NotChecked=0, Total=7656 [2018-11-12 20:41:48,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-11-12 20:41:48,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 141. [2018-11-12 20:41:48,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-12 20:41:48,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2018-11-12 20:41:48,768 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 109 [2018-11-12 20:41:48,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:48,768 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2018-11-12 20:41:48,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-12 20:41:48,768 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2018-11-12 20:41:48,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-12 20:41:48,769 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:48,769 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 6, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:48,769 INFO L423 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:48,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:48,770 INFO L82 PathProgramCache]: Analyzing trace with hash 893393019, now seen corresponding path program 33 times [2018-11-12 20:41:48,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:48,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:48,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:41:48,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:48,771 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:48,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:49,061 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 189 proven. 50 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:41:49,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:49,061 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:49,061 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:49,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:49,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:49,062 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:49,070 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:41:49,070 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:41:49,121 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:41:49,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:41:49,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:49,870 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 189 proven. 50 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:41:49,870 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:50,075 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 189 proven. 50 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:41:50,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:50,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 41 [2018-11-12 20:41:50,096 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:50,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-12 20:41:50,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-12 20:41:50,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=1329, Unknown=0, NotChecked=0, Total=1640 [2018-11-12 20:41:50,097 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand 41 states. [2018-11-12 20:41:52,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:52,240 INFO L93 Difference]: Finished difference Result 518 states and 605 transitions. [2018-11-12 20:41:52,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-12 20:41:52,241 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 109 [2018-11-12 20:41:52,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:52,243 INFO L225 Difference]: With dead ends: 518 [2018-11-12 20:41:52,243 INFO L226 Difference]: Without dead ends: 469 [2018-11-12 20:41:52,244 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 181 SyntacticMatches, 22 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2971 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1405, Invalid=6251, Unknown=0, NotChecked=0, Total=7656 [2018-11-12 20:41:52,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-11-12 20:41:52,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 141. [2018-11-12 20:41:52,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-12 20:41:52,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2018-11-12 20:41:52,407 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 109 [2018-11-12 20:41:52,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:52,407 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2018-11-12 20:41:52,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-12 20:41:52,407 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2018-11-12 20:41:52,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-12 20:41:52,408 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:52,408 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 7, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:52,408 INFO L423 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:52,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:52,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1605368825, now seen corresponding path program 34 times [2018-11-12 20:41:52,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:52,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:52,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:41:52,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:52,410 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:52,809 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 189 proven. 54 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:41:52,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:52,809 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:52,809 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:52,809 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:52,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:52,810 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:52,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:52,818 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:41:52,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:52,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:53,107 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-12 20:41:53,624 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 189 proven. 54 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:41:53,624 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:53,802 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 189 proven. 54 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:41:53,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:53,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 40 [2018-11-12 20:41:53,822 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:53,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-12 20:41:53,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-12 20:41:53,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1259, Unknown=0, NotChecked=0, Total=1560 [2018-11-12 20:41:53,823 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand 40 states. [2018-11-12 20:41:56,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:56,127 INFO L93 Difference]: Finished difference Result 566 states and 664 transitions. [2018-11-12 20:41:56,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-12 20:41:56,127 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 109 [2018-11-12 20:41:56,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:56,130 INFO L225 Difference]: With dead ends: 566 [2018-11-12 20:41:56,130 INFO L226 Difference]: Without dead ends: 517 [2018-11-12 20:41:56,131 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 182 SyntacticMatches, 22 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2811 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1346, Invalid=5964, Unknown=0, NotChecked=0, Total=7310 [2018-11-12 20:41:56,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-11-12 20:41:56,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 141. [2018-11-12 20:41:56,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-12 20:41:56,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2018-11-12 20:41:56,310 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 109 [2018-11-12 20:41:56,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:56,310 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2018-11-12 20:41:56,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-12 20:41:56,310 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2018-11-12 20:41:56,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-12 20:41:56,311 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:56,311 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 8, 7, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:56,311 INFO L423 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:56,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:56,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1858248045, now seen corresponding path program 35 times [2018-11-12 20:41:56,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:56,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:56,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:56,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:56,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:56,554 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 189 proven. 62 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:41:56,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:56,554 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:56,554 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:56,554 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:56,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:56,554 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:56,564 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:41:56,564 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:41:56,603 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-12 20:41:56,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:41:56,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:57,609 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 189 proven. 62 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:41:57,609 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:57,798 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 189 proven. 62 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:41:57,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:57,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 39 [2018-11-12 20:41:57,818 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:57,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-12 20:41:57,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-12 20:41:57,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1187, Unknown=0, NotChecked=0, Total=1482 [2018-11-12 20:41:57,819 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand 39 states. [2018-11-12 20:42:00,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:00,150 INFO L93 Difference]: Finished difference Result 612 states and 721 transitions. [2018-11-12 20:42:00,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-12 20:42:00,151 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 109 [2018-11-12 20:42:00,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:00,154 INFO L225 Difference]: With dead ends: 612 [2018-11-12 20:42:00,154 INFO L226 Difference]: Without dead ends: 563 [2018-11-12 20:42:00,155 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 183 SyntacticMatches, 22 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2523 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1234, Invalid=5408, Unknown=0, NotChecked=0, Total=6642 [2018-11-12 20:42:00,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2018-11-12 20:42:00,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 141. [2018-11-12 20:42:00,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-12 20:42:00,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2018-11-12 20:42:00,322 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 109 [2018-11-12 20:42:00,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:00,322 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2018-11-12 20:42:00,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-12 20:42:00,322 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2018-11-12 20:42:00,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-12 20:42:00,323 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:00,323 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:00,324 INFO L423 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:00,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:00,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1228344289, now seen corresponding path program 36 times [2018-11-12 20:42:00,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:00,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:00,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:00,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:00,325 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:00,558 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 189 proven. 74 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:42:00,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:00,559 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:00,559 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:00,559 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:00,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:00,559 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:00,572 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:42:00,572 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:42:00,622 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:42:00,622 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:00,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:00,956 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 189 proven. 74 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:42:00,956 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:01,133 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 189 proven. 74 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:42:01,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:01,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 38 [2018-11-12 20:42:01,154 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:01,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-12 20:42:01,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-12 20:42:01,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1113, Unknown=0, NotChecked=0, Total=1406 [2018-11-12 20:42:01,155 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand 38 states. [2018-11-12 20:42:03,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:03,637 INFO L93 Difference]: Finished difference Result 656 states and 776 transitions. [2018-11-12 20:42:03,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-12 20:42:03,637 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 109 [2018-11-12 20:42:03,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:03,640 INFO L225 Difference]: With dead ends: 656 [2018-11-12 20:42:03,640 INFO L226 Difference]: Without dead ends: 607 [2018-11-12 20:42:03,641 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 184 SyntacticMatches, 22 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2121 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1081, Invalid=4619, Unknown=0, NotChecked=0, Total=5700 [2018-11-12 20:42:03,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2018-11-12 20:42:03,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 141. [2018-11-12 20:42:03,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-12 20:42:03,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2018-11-12 20:42:03,809 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 109 [2018-11-12 20:42:03,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:03,810 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2018-11-12 20:42:03,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-12 20:42:03,810 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2018-11-12 20:42:03,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-12 20:42:03,811 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:03,811 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:03,811 INFO L423 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:03,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:03,811 INFO L82 PathProgramCache]: Analyzing trace with hash -119310165, now seen corresponding path program 9 times [2018-11-12 20:42:03,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:03,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:03,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:03,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:03,812 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:04,064 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 189 proven. 90 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:42:04,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:04,064 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:04,064 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:04,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:04,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:04,065 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:04,076 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:42:04,076 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:42:04,108 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:42:04,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:04,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:04,495 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 189 proven. 90 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:42:04,495 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:04,696 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 189 proven. 90 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:42:04,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:04,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 37 [2018-11-12 20:42:04,717 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:04,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-12 20:42:04,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-12 20:42:04,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1037, Unknown=0, NotChecked=0, Total=1332 [2018-11-12 20:42:04,718 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand 37 states. [2018-11-12 20:42:07,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:07,047 INFO L93 Difference]: Finished difference Result 703 states and 835 transitions. [2018-11-12 20:42:07,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-12 20:42:07,047 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 109 [2018-11-12 20:42:07,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:07,050 INFO L225 Difference]: With dead ends: 703 [2018-11-12 20:42:07,050 INFO L226 Difference]: Without dead ends: 654 [2018-11-12 20:42:07,051 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 185 SyntacticMatches, 22 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1631 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=905, Invalid=3651, Unknown=0, NotChecked=0, Total=4556 [2018-11-12 20:42:07,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2018-11-12 20:42:07,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 144. [2018-11-12 20:42:07,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-12 20:42:07,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2018-11-12 20:42:07,235 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 109 [2018-11-12 20:42:07,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:07,235 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2018-11-12 20:42:07,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-12 20:42:07,236 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2018-11-12 20:42:07,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-12 20:42:07,236 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:07,236 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:07,236 INFO L423 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:07,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:07,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1752486599, now seen corresponding path program 18 times [2018-11-12 20:42:07,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:07,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:07,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:07,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:07,238 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:07,430 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 127 proven. 196 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-12 20:42:07,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:07,431 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:07,431 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:07,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:07,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:07,431 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:07,441 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:42:07,441 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:42:07,474 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:42:07,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:07,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:07,553 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 128 proven. 171 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:42:07,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:07,852 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 128 proven. 171 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:42:07,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:07,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 18 [2018-11-12 20:42:07,872 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:07,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 20:42:07,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 20:42:07,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2018-11-12 20:42:07,873 INFO L87 Difference]: Start difference. First operand 144 states and 156 transitions. Second operand 18 states. [2018-11-12 20:42:08,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:08,348 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2018-11-12 20:42:08,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 20:42:08,349 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 111 [2018-11-12 20:42:08,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:08,350 INFO L225 Difference]: With dead ends: 154 [2018-11-12 20:42:08,350 INFO L226 Difference]: Without dead ends: 152 [2018-11-12 20:42:08,350 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 211 SyntacticMatches, 21 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2018-11-12 20:42:08,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-12 20:42:08,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-11-12 20:42:08,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-12 20:42:08,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 164 transitions. [2018-11-12 20:42:08,539 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 164 transitions. Word has length 111 [2018-11-12 20:42:08,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:08,539 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 164 transitions. [2018-11-12 20:42:08,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 20:42:08,539 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 164 transitions. [2018-11-12 20:42:08,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-12 20:42:08,540 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:08,540 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:08,540 INFO L423 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:08,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:08,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1040286813, now seen corresponding path program 19 times [2018-11-12 20:42:08,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:08,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:08,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:08,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:08,542 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:08,841 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 230 proven. 110 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:42:08,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:08,842 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:08,842 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:08,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:08,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:08,842 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:08,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:08,851 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:42:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:08,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:09,376 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 230 proven. 110 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:42:09,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:09,608 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 230 proven. 110 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:42:09,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:09,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 50 [2018-11-12 20:42:09,627 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:09,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-12 20:42:09,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-12 20:42:09,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=495, Invalid=1955, Unknown=0, NotChecked=0, Total=2450 [2018-11-12 20:42:09,628 INFO L87 Difference]: Start difference. First operand 152 states and 164 transitions. Second operand 50 states. [2018-11-12 20:42:10,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:10,892 INFO L93 Difference]: Finished difference Result 271 states and 306 transitions. [2018-11-12 20:42:10,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-12 20:42:10,892 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 119 [2018-11-12 20:42:10,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:10,894 INFO L225 Difference]: With dead ends: 271 [2018-11-12 20:42:10,894 INFO L226 Difference]: Without dead ends: 218 [2018-11-12 20:42:10,894 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 192 SyntacticMatches, 24 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2515 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1059, Invalid=4343, Unknown=0, NotChecked=0, Total=5402 [2018-11-12 20:42:10,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-11-12 20:42:11,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 154. [2018-11-12 20:42:11,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-12 20:42:11,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-11-12 20:42:11,102 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 119 [2018-11-12 20:42:11,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:11,102 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-11-12 20:42:11,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-12 20:42:11,102 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-11-12 20:42:11,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-12 20:42:11,103 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:11,103 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:11,103 INFO L423 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:11,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:11,103 INFO L82 PathProgramCache]: Analyzing trace with hash -661376535, now seen corresponding path program 37 times [2018-11-12 20:42:11,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:11,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:11,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:11,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:11,105 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:11,492 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 230 proven. 92 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:42:11,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:11,492 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:11,492 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:11,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:11,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:11,492 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:11,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:11,501 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:42:11,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:11,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:12,048 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 230 proven. 92 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:42:12,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:12,382 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 230 proven. 92 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:42:12,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:12,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 49 [2018-11-12 20:42:12,404 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:12,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-12 20:42:12,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-12 20:42:12,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=462, Invalid=1890, Unknown=0, NotChecked=0, Total=2352 [2018-11-12 20:42:12,405 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 49 states. [2018-11-12 20:42:14,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:14,297 INFO L93 Difference]: Finished difference Result 335 states and 382 transitions. [2018-11-12 20:42:14,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-12 20:42:14,298 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 119 [2018-11-12 20:42:14,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:14,299 INFO L225 Difference]: With dead ends: 335 [2018-11-12 20:42:14,299 INFO L226 Difference]: Without dead ends: 282 [2018-11-12 20:42:14,300 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 193 SyntacticMatches, 24 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2937 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1275, Invalid=5531, Unknown=0, NotChecked=0, Total=6806 [2018-11-12 20:42:14,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-11-12 20:42:14,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 154. [2018-11-12 20:42:14,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-12 20:42:14,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-11-12 20:42:14,528 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 119 [2018-11-12 20:42:14,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:14,528 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-11-12 20:42:14,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-12 20:42:14,528 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-11-12 20:42:14,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-12 20:42:14,529 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:14,529 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 9, 8, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:14,529 INFO L423 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:14,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:14,529 INFO L82 PathProgramCache]: Analyzing trace with hash 516739701, now seen corresponding path program 38 times [2018-11-12 20:42:14,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:14,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:14,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:14,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:14,530 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:14,823 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 230 proven. 78 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:42:14,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:14,823 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:14,824 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:14,824 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:14,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:14,824 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:14,832 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:42:14,832 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:42:14,871 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-12 20:42:14,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:14,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:15,386 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 230 proven. 78 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:42:15,386 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:15,611 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 230 proven. 78 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:42:15,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:15,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 48 [2018-11-12 20:42:15,631 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:15,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-12 20:42:15,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-12 20:42:15,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=433, Invalid=1823, Unknown=0, NotChecked=0, Total=2256 [2018-11-12 20:42:15,632 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 48 states. [2018-11-12 20:42:17,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:17,733 INFO L93 Difference]: Finished difference Result 397 states and 456 transitions. [2018-11-12 20:42:17,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-12 20:42:17,733 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 119 [2018-11-12 20:42:17,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:17,735 INFO L225 Difference]: With dead ends: 397 [2018-11-12 20:42:17,735 INFO L226 Difference]: Without dead ends: 344 [2018-11-12 20:42:17,736 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 194 SyntacticMatches, 24 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3318 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1471, Invalid=6539, Unknown=0, NotChecked=0, Total=8010 [2018-11-12 20:42:17,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-11-12 20:42:17,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 154. [2018-11-12 20:42:17,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-12 20:42:17,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-11-12 20:42:17,943 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 119 [2018-11-12 20:42:17,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:17,943 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-11-12 20:42:17,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-12 20:42:17,944 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-11-12 20:42:17,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-12 20:42:17,944 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:17,944 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 8, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:17,944 INFO L423 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:17,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:17,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1752422911, now seen corresponding path program 39 times [2018-11-12 20:42:17,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:17,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:17,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:17,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:17,945 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:18,255 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 230 proven. 68 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:42:18,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:18,256 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:18,256 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:18,256 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:18,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:18,256 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:18,265 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:42:18,265 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:42:18,302 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:42:18,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:18,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:19,020 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 230 proven. 68 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:42:19,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:19,268 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 230 proven. 68 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:42:19,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:19,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 47 [2018-11-12 20:42:19,287 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:19,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-12 20:42:19,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-12 20:42:19,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=1754, Unknown=0, NotChecked=0, Total=2162 [2018-11-12 20:42:19,289 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 47 states. [2018-11-12 20:42:21,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:21,828 INFO L93 Difference]: Finished difference Result 457 states and 528 transitions. [2018-11-12 20:42:21,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-12 20:42:21,828 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 119 [2018-11-12 20:42:21,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:21,830 INFO L225 Difference]: With dead ends: 457 [2018-11-12 20:42:21,830 INFO L226 Difference]: Without dead ends: 404 [2018-11-12 20:42:21,831 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 195 SyntacticMatches, 24 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3614 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1626, Invalid=7304, Unknown=0, NotChecked=0, Total=8930 [2018-11-12 20:42:21,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-11-12 20:42:22,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 154. [2018-11-12 20:42:22,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-12 20:42:22,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-11-12 20:42:22,056 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 119 [2018-11-12 20:42:22,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:22,056 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-11-12 20:42:22,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-12 20:42:22,056 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-11-12 20:42:22,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-12 20:42:22,057 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:22,057 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 7, 6, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:22,057 INFO L423 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:22,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:22,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1964839795, now seen corresponding path program 40 times [2018-11-12 20:42:22,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:22,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:22,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:22,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:22,058 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:22,509 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 230 proven. 62 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:42:22,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:22,510 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:22,510 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:22,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:22,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:22,510 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:22,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:22,518 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:42:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:22,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:23,971 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 230 proven. 62 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:42:23,971 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:24,189 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 230 proven. 62 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:42:24,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:24,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 46 [2018-11-12 20:42:24,208 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:24,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-12 20:42:24,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-12 20:42:24,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=1683, Unknown=0, NotChecked=0, Total=2070 [2018-11-12 20:42:24,209 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 46 states. [2018-11-12 20:42:27,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:27,038 INFO L93 Difference]: Finished difference Result 515 states and 598 transitions. [2018-11-12 20:42:27,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-12 20:42:27,038 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 119 [2018-11-12 20:42:27,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:27,041 INFO L225 Difference]: With dead ends: 515 [2018-11-12 20:42:27,041 INFO L226 Difference]: Without dead ends: 462 [2018-11-12 20:42:27,042 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 196 SyntacticMatches, 24 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3793 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1725, Invalid=7781, Unknown=0, NotChecked=0, Total=9506 [2018-11-12 20:42:27,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-11-12 20:42:27,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 154. [2018-11-12 20:42:27,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-12 20:42:27,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-11-12 20:42:27,263 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 119 [2018-11-12 20:42:27,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:27,264 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-11-12 20:42:27,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-12 20:42:27,264 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-11-12 20:42:27,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-12 20:42:27,264 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:27,264 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:27,265 INFO L423 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:27,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:27,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1911429607, now seen corresponding path program 41 times [2018-11-12 20:42:27,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:27,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:27,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:27,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:27,266 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:27,791 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 230 proven. 60 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:42:27,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:27,791 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:27,791 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:27,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:27,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:27,791 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:27,799 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:42:27,799 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:42:27,837 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-12 20:42:27,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:27,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:28,690 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 230 proven. 60 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:42:28,691 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:28,941 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 230 proven. 60 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:42:28,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:28,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 45 [2018-11-12 20:42:28,962 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:28,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-12 20:42:28,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-12 20:42:28,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=1610, Unknown=0, NotChecked=0, Total=1980 [2018-11-12 20:42:28,963 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 45 states. [2018-11-12 20:42:31,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:31,913 INFO L93 Difference]: Finished difference Result 571 states and 666 transitions. [2018-11-12 20:42:31,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-11-12 20:42:31,913 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 119 [2018-11-12 20:42:31,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:31,916 INFO L225 Difference]: With dead ends: 571 [2018-11-12 20:42:31,916 INFO L226 Difference]: Without dead ends: 518 [2018-11-12 20:42:31,917 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 197 SyntacticMatches, 24 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3835 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1759, Invalid=7943, Unknown=0, NotChecked=0, Total=9702 [2018-11-12 20:42:31,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2018-11-12 20:42:32,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 154. [2018-11-12 20:42:32,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-12 20:42:32,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-11-12 20:42:32,167 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 119 [2018-11-12 20:42:32,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:32,167 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-11-12 20:42:32,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-12 20:42:32,167 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-11-12 20:42:32,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-12 20:42:32,168 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:32,168 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 7, 6, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:32,168 INFO L423 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:32,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:32,168 INFO L82 PathProgramCache]: Analyzing trace with hash 260690597, now seen corresponding path program 42 times [2018-11-12 20:42:32,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:32,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:32,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:32,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:32,169 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:32,569 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 230 proven. 62 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:42:32,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:32,569 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:32,569 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:32,569 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:32,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:32,569 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:32,577 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:42:32,577 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:42:32,610 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:42:32,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:32,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:33,217 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 230 proven. 62 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:42:33,218 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:33,473 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 230 proven. 62 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:42:33,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:33,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 44 [2018-11-12 20:42:33,493 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:33,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-12 20:42:33,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-12 20:42:33,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=1535, Unknown=0, NotChecked=0, Total=1892 [2018-11-12 20:42:33,494 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 44 states. [2018-11-12 20:42:36,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:36,614 INFO L93 Difference]: Finished difference Result 625 states and 732 transitions. [2018-11-12 20:42:36,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-11-12 20:42:36,615 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 119 [2018-11-12 20:42:36,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:36,617 INFO L225 Difference]: With dead ends: 625 [2018-11-12 20:42:36,617 INFO L226 Difference]: Without dead ends: 572 [2018-11-12 20:42:36,618 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 198 SyntacticMatches, 24 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3731 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1725, Invalid=7781, Unknown=0, NotChecked=0, Total=9506 [2018-11-12 20:42:36,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2018-11-12 20:42:36,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 154. [2018-11-12 20:42:36,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-12 20:42:36,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-11-12 20:42:36,864 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 119 [2018-11-12 20:42:36,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:36,864 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-11-12 20:42:36,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-12 20:42:36,864 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-11-12 20:42:36,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-12 20:42:36,865 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:36,865 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 8, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:36,865 INFO L423 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:36,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:36,866 INFO L82 PathProgramCache]: Analyzing trace with hash -487886287, now seen corresponding path program 43 times [2018-11-12 20:42:36,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:36,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:36,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:36,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:36,867 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:37,144 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 230 proven. 68 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:42:37,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:37,145 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:37,145 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:37,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:37,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:37,145 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:37,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:37,153 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:42:37,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:37,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:37,584 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 230 proven. 68 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:42:37,584 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:37,798 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 230 proven. 68 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:42:37,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:37,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 43 [2018-11-12 20:42:37,818 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:37,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-12 20:42:37,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-12 20:42:37,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=1458, Unknown=0, NotChecked=0, Total=1806 [2018-11-12 20:42:37,819 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 43 states. [2018-11-12 20:42:41,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:41,116 INFO L93 Difference]: Finished difference Result 677 states and 796 transitions. [2018-11-12 20:42:41,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-11-12 20:42:41,117 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 119 [2018-11-12 20:42:41,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:41,119 INFO L225 Difference]: With dead ends: 677 [2018-11-12 20:42:41,119 INFO L226 Difference]: Without dead ends: 624 [2018-11-12 20:42:41,120 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 199 SyntacticMatches, 24 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3478 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1626, Invalid=7304, Unknown=0, NotChecked=0, Total=8930 [2018-11-12 20:42:41,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-11-12 20:42:41,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 154. [2018-11-12 20:42:41,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-12 20:42:41,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-11-12 20:42:41,386 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 119 [2018-11-12 20:42:41,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:41,386 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-11-12 20:42:41,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-12 20:42:41,386 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-11-12 20:42:41,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-12 20:42:41,387 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:41,387 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 9, 8, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:41,387 INFO L423 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:41,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:41,388 INFO L82 PathProgramCache]: Analyzing trace with hash -855145283, now seen corresponding path program 44 times [2018-11-12 20:42:41,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:41,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:41,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:41,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:41,389 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:41,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:41,673 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 230 proven. 78 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:42:41,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:41,674 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:41,674 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:41,674 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:41,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:41,674 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:41,682 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:42:41,682 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:42:41,719 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-12 20:42:41,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:41,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:42,099 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 230 proven. 78 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:42:42,099 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:42,326 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 230 proven. 78 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:42:42,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:42,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 42 [2018-11-12 20:42:42,347 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:42,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-12 20:42:42,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-12 20:42:42,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=1379, Unknown=0, NotChecked=0, Total=1722 [2018-11-12 20:42:42,347 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 42 states. [2018-11-12 20:42:45,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:45,864 INFO L93 Difference]: Finished difference Result 727 states and 858 transitions. [2018-11-12 20:42:45,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-12 20:42:45,865 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 119 [2018-11-12 20:42:45,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:45,882 INFO L225 Difference]: With dead ends: 727 [2018-11-12 20:42:45,882 INFO L226 Difference]: Without dead ends: 674 [2018-11-12 20:42:45,883 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 200 SyntacticMatches, 24 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3084 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1471, Invalid=6539, Unknown=0, NotChecked=0, Total=8010 [2018-11-12 20:42:45,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2018-11-12 20:42:46,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 154. [2018-11-12 20:42:46,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-12 20:42:46,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-11-12 20:42:46,165 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 119 [2018-11-12 20:42:46,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:46,166 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-11-12 20:42:46,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-12 20:42:46,166 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-11-12 20:42:46,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-12 20:42:46,167 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:46,167 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:46,167 INFO L423 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:46,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:46,167 INFO L82 PathProgramCache]: Analyzing trace with hash 266259017, now seen corresponding path program 45 times [2018-11-12 20:42:46,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:46,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:46,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:46,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:46,168 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:46,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:46,461 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 230 proven. 92 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:42:46,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:46,461 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:46,461 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:46,461 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:46,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:46,462 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:46,470 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:42:46,470 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:42:46,502 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:42:46,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:46,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:46,866 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 230 proven. 92 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:42:46,866 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:47,658 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 230 proven. 92 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:42:47,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:47,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 41 [2018-11-12 20:42:47,678 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:47,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-12 20:42:47,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-12 20:42:47,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=1298, Unknown=0, NotChecked=0, Total=1640 [2018-11-12 20:42:47,679 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 41 states. [2018-11-12 20:42:51,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:51,009 INFO L93 Difference]: Finished difference Result 775 states and 918 transitions. [2018-11-12 20:42:51,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-12 20:42:51,010 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 119 [2018-11-12 20:42:51,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:51,012 INFO L225 Difference]: With dead ends: 775 [2018-11-12 20:42:51,012 INFO L226 Difference]: Without dead ends: 722 [2018-11-12 20:42:51,013 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 201 SyntacticMatches, 24 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2569 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1275, Invalid=5531, Unknown=0, NotChecked=0, Total=6806 [2018-11-12 20:42:51,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2018-11-12 20:42:51,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 154. [2018-11-12 20:42:51,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-12 20:42:51,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-11-12 20:42:51,282 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 119 [2018-11-12 20:42:51,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:51,282 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-11-12 20:42:51,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-12 20:42:51,283 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-11-12 20:42:51,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-12 20:42:51,283 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:51,283 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:51,283 INFO L423 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:51,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:51,284 INFO L82 PathProgramCache]: Analyzing trace with hash -157154603, now seen corresponding path program 10 times [2018-11-12 20:42:51,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:51,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:51,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:51,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:51,284 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:51,867 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 230 proven. 110 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:42:51,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:51,867 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:51,867 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:51,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:51,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:51,868 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:51,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:51,875 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:42:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:51,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:52,239 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 230 proven. 110 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:42:52,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:52,482 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 230 proven. 110 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:42:52,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:52,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 40 [2018-11-12 20:42:52,503 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:52,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-12 20:42:52,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-12 20:42:52,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=1215, Unknown=0, NotChecked=0, Total=1560 [2018-11-12 20:42:52,504 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 40 states. [2018-11-12 20:42:55,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:55,736 INFO L93 Difference]: Finished difference Result 826 states and 982 transitions. [2018-11-12 20:42:55,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-12 20:42:55,737 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 119 [2018-11-12 20:42:55,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:55,739 INFO L225 Difference]: With dead ends: 826 [2018-11-12 20:42:55,740 INFO L226 Difference]: Without dead ends: 773 [2018-11-12 20:42:55,740 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 202 SyntacticMatches, 24 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1965 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1059, Invalid=4343, Unknown=0, NotChecked=0, Total=5402 [2018-11-12 20:42:55,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2018-11-12 20:42:55,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 157. [2018-11-12 20:42:55,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-12 20:42:55,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 170 transitions. [2018-11-12 20:42:55,987 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 170 transitions. Word has length 119 [2018-11-12 20:42:55,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:55,987 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 170 transitions. [2018-11-12 20:42:55,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-12 20:42:55,987 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 170 transitions. [2018-11-12 20:42:55,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-12 20:42:55,988 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:55,988 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:55,988 INFO L423 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:55,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:55,988 INFO L82 PathProgramCache]: Analyzing trace with hash 777037143, now seen corresponding path program 20 times [2018-11-12 20:42:55,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:55,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:55,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:55,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:55,989 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:56,314 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 151 proven. 238 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-12 20:42:56,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:56,314 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:56,314 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:56,315 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:56,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:56,315 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:56,323 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:42:56,324 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:42:56,361 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-12 20:42:56,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:56,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:56,403 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 152 proven. 210 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:42:56,403 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:56,568 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 152 proven. 210 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:42:56,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:56,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 19 [2018-11-12 20:42:56,587 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:56,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-12 20:42:56,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-12 20:42:56,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2018-11-12 20:42:56,588 INFO L87 Difference]: Start difference. First operand 157 states and 170 transitions. Second operand 19 states. [2018-11-12 20:42:57,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:57,181 INFO L93 Difference]: Finished difference Result 167 states and 180 transitions. [2018-11-12 20:42:57,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-12 20:42:57,181 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 121 [2018-11-12 20:42:57,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:57,182 INFO L225 Difference]: With dead ends: 167 [2018-11-12 20:42:57,182 INFO L226 Difference]: Without dead ends: 165 [2018-11-12 20:42:57,183 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 230 SyntacticMatches, 23 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2018-11-12 20:42:57,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-12 20:42:57,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-11-12 20:42:57,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-12 20:42:57,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 178 transitions. [2018-11-12 20:42:57,431 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 178 transitions. Word has length 121 [2018-11-12 20:42:57,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:57,432 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 178 transitions. [2018-11-12 20:42:57,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-12 20:42:57,432 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 178 transitions. [2018-11-12 20:42:57,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-12 20:42:57,432 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:57,432 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:57,432 INFO L423 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:57,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:57,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1277952389, now seen corresponding path program 21 times [2018-11-12 20:42:57,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:57,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:57,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:57,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:57,433 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:58,068 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 275 proven. 132 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:42:58,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:58,069 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:58,069 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:58,069 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:58,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:58,069 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:58,076 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:42:58,077 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:42:58,114 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:42:58,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:58,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:59,017 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 275 proven. 132 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:42:59,017 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:59,320 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 275 proven. 132 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:42:59,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:59,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 54 [2018-11-12 20:42:59,340 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:59,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-12 20:42:59,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-12 20:42:59,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=2287, Unknown=0, NotChecked=0, Total=2862 [2018-11-12 20:42:59,341 INFO L87 Difference]: Start difference. First operand 165 states and 178 transitions. Second operand 54 states. [2018-11-12 20:43:01,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:01,200 INFO L93 Difference]: Finished difference Result 294 states and 332 transitions. [2018-11-12 20:43:01,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-12 20:43:01,200 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 129 [2018-11-12 20:43:01,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:01,201 INFO L225 Difference]: With dead ends: 294 [2018-11-12 20:43:01,201 INFO L226 Difference]: Without dead ends: 237 [2018-11-12 20:43:01,202 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 208 SyntacticMatches, 26 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2990 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1225, Invalid=5095, Unknown=0, NotChecked=0, Total=6320 [2018-11-12 20:43:01,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-11-12 20:43:01,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 167. [2018-11-12 20:43:01,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-12 20:43:01,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2018-11-12 20:43:01,489 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 129 [2018-11-12 20:43:01,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:01,489 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2018-11-12 20:43:01,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-12 20:43:01,489 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2018-11-12 20:43:01,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-12 20:43:01,490 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:01,490 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:01,490 INFO L423 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:01,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:01,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1178325753, now seen corresponding path program 46 times [2018-11-12 20:43:01,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:01,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:01,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:01,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:01,492 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:01,833 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 275 proven. 112 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:43:01,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:01,834 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:01,834 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:01,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:01,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:01,834 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:43:01,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:01,843 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:43:01,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:01,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:02,458 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 275 proven. 112 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:43:02,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:02,716 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 275 proven. 112 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:43:02,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:02,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 53 [2018-11-12 20:43:02,737 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:02,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-11-12 20:43:02,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-12 20:43:02,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=539, Invalid=2217, Unknown=0, NotChecked=0, Total=2756 [2018-11-12 20:43:02,738 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand 53 states. [2018-11-12 20:43:05,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:05,229 INFO L93 Difference]: Finished difference Result 364 states and 415 transitions. [2018-11-12 20:43:05,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-12 20:43:05,229 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 129 [2018-11-12 20:43:05,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:05,230 INFO L225 Difference]: With dead ends: 364 [2018-11-12 20:43:05,230 INFO L226 Difference]: Without dead ends: 307 [2018-11-12 20:43:05,231 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 209 SyntacticMatches, 26 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3510 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1485, Invalid=6525, Unknown=0, NotChecked=0, Total=8010 [2018-11-12 20:43:05,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-11-12 20:43:05,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 167. [2018-11-12 20:43:05,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-12 20:43:05,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2018-11-12 20:43:05,529 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 129 [2018-11-12 20:43:05,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:05,530 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2018-11-12 20:43:05,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-11-12 20:43:05,530 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2018-11-12 20:43:05,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-12 20:43:05,530 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:05,530 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 10, 9, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:05,531 INFO L423 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:05,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:05,531 INFO L82 PathProgramCache]: Analyzing trace with hash -154759533, now seen corresponding path program 47 times [2018-11-12 20:43:05,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:05,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:05,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:05,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:05,532 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:05,982 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 275 proven. 96 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:43:05,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:05,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:05,983 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:05,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:05,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:05,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:43:05,992 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:43:05,992 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:43:06,037 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-12 20:43:06,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:06,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:06,558 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 275 proven. 96 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:43:06,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:06,828 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 275 proven. 96 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:43:06,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:06,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 52 [2018-11-12 20:43:06,847 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:06,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-12 20:43:06,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-12 20:43:06,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=507, Invalid=2145, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:43:06,848 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand 52 states. [2018-11-12 20:43:09,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:09,899 INFO L93 Difference]: Finished difference Result 432 states and 496 transitions. [2018-11-12 20:43:09,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-12 20:43:09,900 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 129 [2018-11-12 20:43:09,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:09,901 INFO L225 Difference]: With dead ends: 432 [2018-11-12 20:43:09,901 INFO L226 Difference]: Without dead ends: 375 [2018-11-12 20:43:09,902 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 210 SyntacticMatches, 26 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3996 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1729, Invalid=7777, Unknown=0, NotChecked=0, Total=9506 [2018-11-12 20:43:09,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-11-12 20:43:10,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 167. [2018-11-12 20:43:10,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-12 20:43:10,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2018-11-12 20:43:10,242 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 129 [2018-11-12 20:43:10,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:10,243 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2018-11-12 20:43:10,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-12 20:43:10,243 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2018-11-12 20:43:10,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-12 20:43:10,243 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:10,243 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 9, 8, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:10,244 INFO L423 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:10,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:10,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1607197471, now seen corresponding path program 48 times [2018-11-12 20:43:10,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:10,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:10,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:10,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:10,245 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:10,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:10,565 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 275 proven. 84 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:43:10,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:10,565 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:10,565 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:10,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:10,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:10,566 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:43:10,573 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:43:10,573 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:43:10,609 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:43:10,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:10,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:11,153 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 275 proven. 84 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:43:11,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:11,580 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 275 proven. 84 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:43:11,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:11,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 51 [2018-11-12 20:43:11,601 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:11,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-12 20:43:11,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-12 20:43:11,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=2071, Unknown=0, NotChecked=0, Total=2550 [2018-11-12 20:43:11,602 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand 51 states. [2018-11-12 20:43:15,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:15,166 INFO L93 Difference]: Finished difference Result 498 states and 575 transitions. [2018-11-12 20:43:15,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-12 20:43:15,166 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 129 [2018-11-12 20:43:15,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:15,168 INFO L225 Difference]: With dead ends: 498 [2018-11-12 20:43:15,168 INFO L226 Difference]: Without dead ends: 441 [2018-11-12 20:43:15,169 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 211 SyntacticMatches, 26 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4398 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1933, Invalid=8779, Unknown=0, NotChecked=0, Total=10712 [2018-11-12 20:43:15,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-11-12 20:43:15,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 167. [2018-11-12 20:43:15,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-12 20:43:15,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2018-11-12 20:43:15,497 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 129 [2018-11-12 20:43:15,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:15,498 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2018-11-12 20:43:15,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-12 20:43:15,498 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2018-11-12 20:43:15,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-12 20:43:15,498 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:15,498 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 8, 7, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:15,499 INFO L423 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:15,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:15,499 INFO L82 PathProgramCache]: Analyzing trace with hash -285939029, now seen corresponding path program 49 times [2018-11-12 20:43:15,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:15,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:15,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:15,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:15,499 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:15,803 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 275 proven. 76 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:43:15,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:15,803 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:15,804 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:15,804 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:15,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:15,804 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:43:15,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:15,812 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:43:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:15,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:16,342 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 275 proven. 76 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:43:16,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:16,642 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 275 proven. 76 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:43:16,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:16,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 50 [2018-11-12 20:43:16,661 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:16,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-12 20:43:16,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-12 20:43:16,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=455, Invalid=1995, Unknown=0, NotChecked=0, Total=2450 [2018-11-12 20:43:16,663 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand 50 states. [2018-11-12 20:43:20,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:20,423 INFO L93 Difference]: Finished difference Result 562 states and 652 transitions. [2018-11-12 20:43:20,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-11-12 20:43:20,423 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 129 [2018-11-12 20:43:20,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:20,425 INFO L225 Difference]: With dead ends: 562 [2018-11-12 20:43:20,425 INFO L226 Difference]: Without dead ends: 505 [2018-11-12 20:43:20,426 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 212 SyntacticMatches, 26 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4678 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2079, Invalid=9477, Unknown=0, NotChecked=0, Total=11556 [2018-11-12 20:43:20,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-11-12 20:43:20,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 167. [2018-11-12 20:43:20,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-12 20:43:20,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2018-11-12 20:43:20,768 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 129 [2018-11-12 20:43:20,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:20,768 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2018-11-12 20:43:20,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-12 20:43:20,768 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2018-11-12 20:43:20,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-12 20:43:20,769 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:20,769 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 7, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:20,769 INFO L423 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:20,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:20,769 INFO L82 PathProgramCache]: Analyzing trace with hash 798123319, now seen corresponding path program 50 times [2018-11-12 20:43:20,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:20,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:20,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:20,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:20,770 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:21,088 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 275 proven. 72 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:43:21,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:21,089 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:21,089 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:21,089 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:21,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:21,089 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:43:21,097 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:43:21,098 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:43:21,140 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-12 20:43:21,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:21,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:21,641 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 275 proven. 72 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:43:21,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:21,894 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 275 proven. 72 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:43:21,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:21,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 49 [2018-11-12 20:43:21,914 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:21,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-12 20:43:21,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-12 20:43:21,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1917, Unknown=0, NotChecked=0, Total=2352 [2018-11-12 20:43:21,915 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand 49 states. [2018-11-12 20:43:26,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:26,041 INFO L93 Difference]: Finished difference Result 624 states and 727 transitions. [2018-11-12 20:43:26,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-11-12 20:43:26,041 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 129 [2018-11-12 20:43:26,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:26,044 INFO L225 Difference]: With dead ends: 624 [2018-11-12 20:43:26,044 INFO L226 Difference]: Without dead ends: 567 [2018-11-12 20:43:26,045 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 213 SyntacticMatches, 26 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4810 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2155, Invalid=9835, Unknown=0, NotChecked=0, Total=11990 [2018-11-12 20:43:26,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2018-11-12 20:43:26,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 167. [2018-11-12 20:43:26,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-12 20:43:26,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2018-11-12 20:43:26,406 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 129 [2018-11-12 20:43:26,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:26,406 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2018-11-12 20:43:26,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-12 20:43:26,407 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2018-11-12 20:43:26,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-12 20:43:26,407 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:26,407 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 7, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:26,407 INFO L423 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:26,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:26,408 INFO L82 PathProgramCache]: Analyzing trace with hash -903540029, now seen corresponding path program 51 times [2018-11-12 20:43:26,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:26,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:26,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:26,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:26,409 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:26,812 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 275 proven. 72 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:43:26,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:26,812 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:26,812 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:26,813 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:26,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:26,813 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:43:26,821 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:43:26,821 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:43:26,865 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:43:26,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:26,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:27,451 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 275 proven. 72 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:43:27,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:27,697 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 275 proven. 72 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:43:27,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:27,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 48 [2018-11-12 20:43:27,719 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:27,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-12 20:43:27,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-12 20:43:27,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1837, Unknown=0, NotChecked=0, Total=2256 [2018-11-12 20:43:27,720 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand 48 states. [2018-11-12 20:43:32,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:32,019 INFO L93 Difference]: Finished difference Result 684 states and 800 transitions. [2018-11-12 20:43:32,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-11-12 20:43:32,019 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 129 [2018-11-12 20:43:32,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:32,021 INFO L225 Difference]: With dead ends: 684 [2018-11-12 20:43:32,021 INFO L226 Difference]: Without dead ends: 627 [2018-11-12 20:43:32,023 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 214 SyntacticMatches, 26 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4780 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2155, Invalid=9835, Unknown=0, NotChecked=0, Total=11990 [2018-11-12 20:43:32,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2018-11-12 20:43:32,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 167. [2018-11-12 20:43:32,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-12 20:43:32,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2018-11-12 20:43:32,371 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 129 [2018-11-12 20:43:32,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:32,372 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2018-11-12 20:43:32,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-12 20:43:32,372 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2018-11-12 20:43:32,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-12 20:43:32,373 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:32,373 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 8, 7, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:32,373 INFO L423 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:32,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:32,373 INFO L82 PathProgramCache]: Analyzing trace with hash 274576207, now seen corresponding path program 52 times [2018-11-12 20:43:32,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:32,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:32,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:32,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:32,374 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:32,713 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 275 proven. 76 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:43:32,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:32,713 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:32,713 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:32,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:32,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:32,714 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:43:32,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:32,731 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:43:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:32,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:33,224 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 275 proven. 76 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:43:33,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:33,499 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 275 proven. 76 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:43:33,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:33,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 47 [2018-11-12 20:43:33,519 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:33,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-12 20:43:33,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-12 20:43:33,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=1755, Unknown=0, NotChecked=0, Total=2162 [2018-11-12 20:43:33,520 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand 47 states. [2018-11-12 20:43:37,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:37,966 INFO L93 Difference]: Finished difference Result 742 states and 871 transitions. [2018-11-12 20:43:37,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-11-12 20:43:37,966 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 129 [2018-11-12 20:43:37,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:37,969 INFO L225 Difference]: With dead ends: 742 [2018-11-12 20:43:37,969 INFO L226 Difference]: Without dead ends: 685 [2018-11-12 20:43:37,970 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 215 SyntacticMatches, 26 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4582 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2079, Invalid=9477, Unknown=0, NotChecked=0, Total=11556 [2018-11-12 20:43:37,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2018-11-12 20:43:38,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 167. [2018-11-12 20:43:38,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-12 20:43:38,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2018-11-12 20:43:38,595 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 129 [2018-11-12 20:43:38,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:38,595 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2018-11-12 20:43:38,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-12 20:43:38,596 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2018-11-12 20:43:38,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-12 20:43:38,596 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:38,597 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 9, 8, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:38,597 INFO L423 AbstractCegarLoop]: === Iteration 87 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:38,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:38,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1994586405, now seen corresponding path program 53 times [2018-11-12 20:43:38,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:38,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:38,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:38,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:38,599 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:39,194 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 275 proven. 84 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:43:39,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:39,195 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:39,195 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:39,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:39,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:39,195 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:43:39,203 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:43:39,203 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:43:39,244 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-12 20:43:39,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:39,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:39,915 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 275 proven. 84 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:43:39,916 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:40,163 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 275 proven. 84 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:43:40,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:40,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 46 [2018-11-12 20:43:40,183 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:40,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-12 20:43:40,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-12 20:43:40,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1671, Unknown=0, NotChecked=0, Total=2070 [2018-11-12 20:43:40,185 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand 46 states. [2018-11-12 20:43:44,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:44,825 INFO L93 Difference]: Finished difference Result 798 states and 940 transitions. [2018-11-12 20:43:44,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-11-12 20:43:44,826 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 129 [2018-11-12 20:43:44,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:44,828 INFO L225 Difference]: With dead ends: 798 [2018-11-12 20:43:44,828 INFO L226 Difference]: Without dead ends: 741 [2018-11-12 20:43:44,829 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 216 SyntacticMatches, 26 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4218 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1933, Invalid=8779, Unknown=0, NotChecked=0, Total=10712 [2018-11-12 20:43:44,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-11-12 20:43:45,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 167. [2018-11-12 20:43:45,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-12 20:43:45,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2018-11-12 20:43:45,174 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 129 [2018-11-12 20:43:45,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:45,174 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2018-11-12 20:43:45,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-12 20:43:45,174 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2018-11-12 20:43:45,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-12 20:43:45,175 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:45,175 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 10, 9, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:45,175 INFO L423 AbstractCegarLoop]: === Iteration 88 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:45,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:45,175 INFO L82 PathProgramCache]: Analyzing trace with hash 2087964007, now seen corresponding path program 54 times [2018-11-12 20:43:45,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:45,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:45,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:45,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:45,176 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:45,505 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 275 proven. 96 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:43:45,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:45,505 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:45,506 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:45,506 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:45,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:45,506 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:43:45,516 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:43:45,517 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:43:45,552 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:43:45,553 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:45,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:45,973 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 275 proven. 96 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:43:45,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:46,222 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 275 proven. 96 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:43:46,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:46,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 45 [2018-11-12 20:43:46,243 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:46,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-12 20:43:46,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-12 20:43:46,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=1585, Unknown=0, NotChecked=0, Total=1980 [2018-11-12 20:43:46,244 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand 45 states. Received shutdown request... [2018-11-12 20:43:50,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-11-12 20:43:50,715 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-12 20:43:50,720 WARN L205 ceAbstractionStarter]: Timeout [2018-11-12 20:43:50,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 08:43:50 BoogieIcfgContainer [2018-11-12 20:43:50,720 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 20:43:50,721 INFO L168 Benchmark]: Toolchain (without parser) took 233699.42 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.5 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -371.7 MB). Peak memory consumption was 362.9 MB. Max. memory is 7.1 GB. [2018-11-12 20:43:50,722 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:43:50,722 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-12 20:43:50,722 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.71 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:43:50,723 INFO L168 Benchmark]: Boogie Preprocessor took 23.80 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:43:50,723 INFO L168 Benchmark]: RCFGBuilder took 513.33 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 726.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -777.6 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-12 20:43:50,723 INFO L168 Benchmark]: TraceAbstraction took 232810.61 ms. Allocated memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 8.4 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 395.3 MB). Peak memory consumption was 403.7 MB. Max. memory is 7.1 GB. [2018-11-12 20:43:50,726 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 322.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 18.71 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.80 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 513.33 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 726.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -777.6 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 232810.61 ms. Allocated memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 8.4 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 395.3 MB). Peak memory consumption was 403.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (167states) and FLOYD_HOARE automaton (currently 65 states, 45 states before enhancement),while ReachableStatesComputation was computing reachable states (750 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. TIMEOUT Result, 232.7s OverallTime, 88 OverallIterations, 12 TraceHistogramMax, 129.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4216 SDtfs, 11312 SDslu, 35247 SDs, 0 SdLazy, 32155 SolverSat, 7532 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 32.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 19520 GetRequests, 12916 SyntacticMatches, 1540 SemanticMatches, 5064 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149303 ImplicationChecksByTransitivity, 118.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.0s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 11.2s AutomataMinimizationTime, 87 MinimizatonAttempts, 16034 StatesRemovedByMinimization, 76 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 83.8s InterpolantComputationTime, 15427 NumberOfCodeBlocks, 15427 NumberOfCodeBlocksAsserted, 404 NumberOfCheckSat, 22854 ConstructedInterpolants, 0 QuantifiedInterpolants, 9084200 SizeOfPredicates, 545 NumberOfNonLiveVariables, 16590 ConjunctsInSsa, 1740 ConjunctsInUnsatCore, 258 InterpolantComputations, 3 PerfectInterpolantSequences, 60967/74867 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown