java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/nested3-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 13:14:00,605 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 13:14:00,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 13:14:00,619 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 13:14:00,620 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 13:14:00,621 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 13:14:00,622 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 13:14:00,624 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 13:14:00,625 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 13:14:00,626 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 13:14:00,627 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 13:14:00,628 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 13:14:00,628 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 13:14:00,629 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 13:14:00,630 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 13:14:00,631 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 13:14:00,632 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 13:14:00,633 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 13:14:00,634 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 13:14:00,636 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 13:14:00,637 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 13:14:00,638 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 13:14:00,639 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 13:14:00,640 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 13:14:00,642 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 13:14:00,642 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 13:14:00,642 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 13:14:00,643 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 13:14:00,644 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 13:14:00,644 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 13:14:00,645 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 13:14:00,645 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 13:14:00,646 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 13:14:00,647 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 13:14:00,648 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 13:14:00,648 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 13:14:00,649 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 13:14:00,649 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 13:14:00,649 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 13:14:00,650 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 13:14:00,650 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 13:14:00,651 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-05 13:14:00,665 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 13:14:00,665 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 13:14:00,666 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-05 13:14:00,666 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-05 13:14:00,666 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-05 13:14:00,667 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-05 13:14:00,667 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-05 13:14:00,667 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-05 13:14:00,667 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-05 13:14:00,667 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-05 13:14:00,668 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 13:14:00,668 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 13:14:00,669 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 13:14:00,669 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 13:14:00,669 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 13:14:00,669 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 13:14:00,669 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 13:14:00,670 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 13:14:00,670 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 13:14:00,670 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 13:14:00,670 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 13:14:00,670 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-05 13:14:00,671 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 13:14:00,671 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 13:14:00,671 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 13:14:00,671 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 13:14:00,671 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-05 13:14:00,672 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 13:14:00,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 13:14:00,672 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-05 13:14:00,699 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 13:14:00,712 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 13:14:00,715 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 13:14:00,716 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 13:14:00,717 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 13:14:00,717 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested3-2.c [2019-09-05 13:14:00,775 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae025af0f/b886467411b6444193c666f47b777b84/FLAG3335b4b3a [2019-09-05 13:14:01,200 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 13:14:01,201 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested3-2.c [2019-09-05 13:14:01,207 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae025af0f/b886467411b6444193c666f47b777b84/FLAG3335b4b3a [2019-09-05 13:14:01,597 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae025af0f/b886467411b6444193c666f47b777b84 [2019-09-05 13:14:01,610 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 13:14:01,614 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 13:14:01,618 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 13:14:01,618 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 13:14:01,622 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 13:14:01,623 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:14:01" (1/1) ... [2019-09-05 13:14:01,626 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6501343a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:14:01, skipping insertion in model container [2019-09-05 13:14:01,626 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:14:01" (1/1) ... [2019-09-05 13:14:01,633 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 13:14:01,652 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 13:14:01,856 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:14:01,866 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 13:14:01,883 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:14:01,894 INFO L192 MainTranslator]: Completed translation [2019-09-05 13:14:01,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:14:01 WrapperNode [2019-09-05 13:14:01,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 13:14:01,896 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 13:14:01,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 13:14:01,896 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 13:14:01,996 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:14:01" (1/1) ... [2019-09-05 13:14:01,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:14:01" (1/1) ... [2019-09-05 13:14:02,001 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:14:01" (1/1) ... [2019-09-05 13:14:02,002 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:14:01" (1/1) ... [2019-09-05 13:14:02,005 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:14:01" (1/1) ... [2019-09-05 13:14:02,010 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:14:01" (1/1) ... [2019-09-05 13:14:02,012 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:14:01" (1/1) ... [2019-09-05 13:14:02,014 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 13:14:02,014 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 13:14:02,014 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 13:14:02,015 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 13:14:02,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:14:01" (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 [2019-09-05 13:14:02,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 13:14:02,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 13:14:02,070 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 13:14:02,070 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 13:14:02,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 13:14:02,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 13:14:02,071 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 13:14:02,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 13:14:02,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 13:14:02,273 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 13:14:02,273 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-05 13:14:02,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:14:02 BoogieIcfgContainer [2019-09-05 13:14:02,276 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 13:14:02,277 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 13:14:02,278 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 13:14:02,293 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 13:14:02,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 01:14:01" (1/3) ... [2019-09-05 13:14:02,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5531cff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:14:02, skipping insertion in model container [2019-09-05 13:14:02,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:14:01" (2/3) ... [2019-09-05 13:14:02,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5531cff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:14:02, skipping insertion in model container [2019-09-05 13:14:02,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:14:02" (3/3) ... [2019-09-05 13:14:02,304 INFO L109 eAbstractionObserver]: Analyzing ICFG nested3-2.c [2019-09-05 13:14:02,326 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 13:14:02,333 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 13:14:02,350 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 13:14:02,378 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 13:14:02,378 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-05 13:14:02,379 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 13:14:02,379 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 13:14:02,379 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 13:14:02,379 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 13:14:02,379 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 13:14:02,379 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 13:14:02,394 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-09-05 13:14:02,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 13:14:02,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:02,405 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:02,408 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:02,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:02,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1303616190, now seen corresponding path program 1 times [2019-09-05 13:14:02,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:02,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:02,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:14:02,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:02,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:02,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:02,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:14:02,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-05 13:14:02,515 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:14:02,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-05 13:14:02,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-05 13:14:02,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 13:14:02,532 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2019-09-05 13:14:02,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:02,547 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-09-05 13:14:02,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-05 13:14:02,548 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-05 13:14:02,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:02,555 INFO L225 Difference]: With dead ends: 23 [2019-09-05 13:14:02,556 INFO L226 Difference]: Without dead ends: 19 [2019-09-05 13:14:02,557 INFO L628 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 [2019-09-05 13:14:02,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-05 13:14:02,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-05 13:14:02,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-05 13:14:02,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-09-05 13:14:02,595 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 10 [2019-09-05 13:14:02,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:02,596 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-09-05 13:14:02,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-05 13:14:02,596 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-09-05 13:14:02,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 13:14:02,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:02,597 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:02,598 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:02,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:02,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1274063518, now seen corresponding path program 1 times [2019-09-05 13:14:02,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:02,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:02,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:14:02,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:02,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:02,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:02,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:14:02,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 13:14:02,719 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:14:02,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 13:14:02,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 13:14:02,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 13:14:02,722 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 3 states. [2019-09-05 13:14:02,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:02,741 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-09-05 13:14:02,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 13:14:02,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-05 13:14:02,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:02,745 INFO L225 Difference]: With dead ends: 26 [2019-09-05 13:14:02,745 INFO L226 Difference]: Without dead ends: 26 [2019-09-05 13:14:02,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 13:14:02,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-05 13:14:02,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2019-09-05 13:14:02,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-05 13:14:02,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-09-05 13:14:02,753 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 10 [2019-09-05 13:14:02,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:02,754 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-09-05 13:14:02,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 13:14:02,754 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-09-05 13:14:02,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-05 13:14:02,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:02,754 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:02,755 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:02,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:02,755 INFO L82 PathProgramCache]: Analyzing trace with hash 856543284, now seen corresponding path program 1 times [2019-09-05 13:14:02,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:02,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:02,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:14:02,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:02,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:02,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:02,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:14:02,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 13:14:02,832 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:14:02,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 13:14:02,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 13:14:02,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 13:14:02,833 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 3 states. [2019-09-05 13:14:02,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:02,856 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2019-09-05 13:14:02,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 13:14:02,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-09-05 13:14:02,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:02,860 INFO L225 Difference]: With dead ends: 24 [2019-09-05 13:14:02,861 INFO L226 Difference]: Without dead ends: 24 [2019-09-05 13:14:02,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 13:14:02,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-05 13:14:02,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-09-05 13:14:02,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-05 13:14:02,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-09-05 13:14:02,870 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 11 [2019-09-05 13:14:02,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:02,870 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-09-05 13:14:02,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 13:14:02,871 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-09-05 13:14:02,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-05 13:14:02,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:02,872 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:02,878 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:02,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:02,879 INFO L82 PathProgramCache]: Analyzing trace with hash 808417067, now seen corresponding path program 1 times [2019-09-05 13:14:02,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:02,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:02,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:14:02,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:02,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:02,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:02,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:14:02,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 13:14:02,963 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:14:02,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 13:14:02,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 13:14:02,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 13:14:02,964 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 3 states. [2019-09-05 13:14:02,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:02,983 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-09-05 13:14:02,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 13:14:02,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-09-05 13:14:02,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:02,985 INFO L225 Difference]: With dead ends: 23 [2019-09-05 13:14:02,985 INFO L226 Difference]: Without dead ends: 23 [2019-09-05 13:14:02,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 13:14:02,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-05 13:14:02,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-09-05 13:14:02,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-05 13:14:02,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-09-05 13:14:02,991 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 12 [2019-09-05 13:14:02,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:02,991 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-09-05 13:14:02,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 13:14:02,992 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-09-05 13:14:02,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-05 13:14:02,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:02,992 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:02,993 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:02,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:02,993 INFO L82 PathProgramCache]: Analyzing trace with hash -681648618, now seen corresponding path program 1 times [2019-09-05 13:14:02,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:02,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:02,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:14:02,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:02,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:03,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:03,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:03,085 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:03,086 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2019-09-05 13:14:03,088 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [22], [29], [31], [47], [50], [52], [58], [59], [60], [62] [2019-09-05 13:14:03,120 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:14:03,121 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:14:03,173 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-05 13:14:03,671 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:14:03,674 INFO L272 AbstractInterpreter]: Visited 13 different actions 49 times. Merged at 2 different actions 12 times. Widened at 1 different actions 4 times. Performed 84 root evaluator evaluations with a maximum evaluation depth of 13. Performed 84 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2019-09-05 13:14:03,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:03,681 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:14:03,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:03,682 INFO L193 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) [2019-09-05 13:14:03,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:14:03,700 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:14:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:03,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-05 13:14:03,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:03,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:03,769 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:03,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 13:14:03,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:14:03,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-09-05 13:14:03,815 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:14:03,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:14:03,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:14:03,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-05 13:14:03,817 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 5 states. [2019-09-05 13:14:03,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:03,844 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2019-09-05 13:14:03,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 13:14:03,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-05 13:14:03,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:03,846 INFO L225 Difference]: With dead ends: 24 [2019-09-05 13:14:03,847 INFO L226 Difference]: Without dead ends: 24 [2019-09-05 13:14:03,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-05 13:14:03,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-05 13:14:03,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-09-05 13:14:03,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-05 13:14:03,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-09-05 13:14:03,852 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2019-09-05 13:14:03,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:03,852 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-09-05 13:14:03,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:14:03,853 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-09-05 13:14:03,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 13:14:03,853 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:03,854 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:03,854 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:03,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:03,854 INFO L82 PathProgramCache]: Analyzing trace with hash 370955403, now seen corresponding path program 2 times [2019-09-05 13:14:03,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:03,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:03,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:14:03,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:03,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:03,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:03,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:03,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:03,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:03,969 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:14:03,970 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:14:03,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:03,970 INFO L193 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 [2019-09-05 13:14:03,988 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:14:03,988 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:14:04,011 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-05 13:14:04,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:14:04,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-05 13:14:04,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:04,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:04,035 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:04,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:04,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:14:04,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-09-05 13:14:04,089 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:14:04,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 13:14:04,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 13:14:04,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-05 13:14:04,091 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2019-09-05 13:14:04,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:04,127 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2019-09-05 13:14:04,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:14:04,127 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-09-05 13:14:04,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:04,128 INFO L225 Difference]: With dead ends: 25 [2019-09-05 13:14:04,128 INFO L226 Difference]: Without dead ends: 25 [2019-09-05 13:14:04,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-05 13:14:04,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-05 13:14:04,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-09-05 13:14:04,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-05 13:14:04,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-09-05 13:14:04,133 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 14 [2019-09-05 13:14:04,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:04,133 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-09-05 13:14:04,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 13:14:04,133 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-09-05 13:14:04,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-05 13:14:04,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:04,134 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:04,134 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:04,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:04,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1358058314, now seen corresponding path program 3 times [2019-09-05 13:14:04,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:04,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:04,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:14:04,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:04,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:04,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:04,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:04,224 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:04,224 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:14:04,224 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:14:04,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:04,225 INFO L193 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 [2019-09-05 13:14:04,239 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:14:04,240 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:14:04,251 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:14:04,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:14:04,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-05 13:14:04,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:04,273 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:04,273 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:04,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:04,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:14:04,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-09-05 13:14:04,361 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:14:04,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 13:14:04,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 13:14:04,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-05 13:14:04,363 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 7 states. [2019-09-05 13:14:04,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:04,400 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-09-05 13:14:04,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:14:04,401 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-09-05 13:14:04,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:04,402 INFO L225 Difference]: With dead ends: 26 [2019-09-05 13:14:04,402 INFO L226 Difference]: Without dead ends: 26 [2019-09-05 13:14:04,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-05 13:14:04,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-05 13:14:04,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-09-05 13:14:04,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-05 13:14:04,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-09-05 13:14:04,406 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 15 [2019-09-05 13:14:04,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:04,407 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-09-05 13:14:04,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 13:14:04,407 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-09-05 13:14:04,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 13:14:04,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:04,408 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:04,408 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:04,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:04,408 INFO L82 PathProgramCache]: Analyzing trace with hash 877091307, now seen corresponding path program 4 times [2019-09-05 13:14:04,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:04,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:04,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:14:04,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:04,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:04,529 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:04,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:04,530 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:04,530 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:14:04,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:14:04,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:04,530 INFO L193 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 [2019-09-05 13:14:04,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:14:04,552 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:14:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:04,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-05 13:14:04,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:04,590 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:04,590 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:04,692 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:04,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:14:04,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-09-05 13:14:04,697 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:14:04,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 13:14:04,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 13:14:04,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-05 13:14:04,699 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 8 states. [2019-09-05 13:14:04,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:04,763 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2019-09-05 13:14:04,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 13:14:04,764 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-09-05 13:14:04,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:04,765 INFO L225 Difference]: With dead ends: 27 [2019-09-05 13:14:04,765 INFO L226 Difference]: Without dead ends: 27 [2019-09-05 13:14:04,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-05 13:14:04,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-05 13:14:04,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-09-05 13:14:04,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-05 13:14:04,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-09-05 13:14:04,775 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 16 [2019-09-05 13:14:04,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:04,775 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-09-05 13:14:04,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 13:14:04,776 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-09-05 13:14:04,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-05 13:14:04,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:04,777 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:04,777 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:04,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:04,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1447252822, now seen corresponding path program 5 times [2019-09-05 13:14:04,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:04,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:04,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:14:04,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:04,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:04,911 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:04,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:04,911 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:04,911 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:14:04,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:14:04,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:04,912 INFO L193 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 [2019-09-05 13:14:04,928 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:14:04,928 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:14:06,090 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-05 13:14:06,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:14:06,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-05 13:14:06,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:06,116 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:06,116 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:06,244 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:06,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:14:06,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-09-05 13:14:06,249 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:14:06,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 13:14:06,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 13:14:06,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-09-05 13:14:06,251 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 9 states. [2019-09-05 13:14:06,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:06,321 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2019-09-05 13:14:06,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 13:14:06,322 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-09-05 13:14:06,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:06,322 INFO L225 Difference]: With dead ends: 28 [2019-09-05 13:14:06,322 INFO L226 Difference]: Without dead ends: 28 [2019-09-05 13:14:06,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-09-05 13:14:06,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-05 13:14:06,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-09-05 13:14:06,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-05 13:14:06,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-09-05 13:14:06,326 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 17 [2019-09-05 13:14:06,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:06,327 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-09-05 13:14:06,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 13:14:06,327 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-09-05 13:14:06,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 13:14:06,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:06,328 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:06,328 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:06,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:06,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1942390603, now seen corresponding path program 6 times [2019-09-05 13:14:06,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:06,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:06,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:14:06,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:06,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:06,432 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:06,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:06,432 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:06,432 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:14:06,433 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:14:06,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:06,433 INFO L193 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 [2019-09-05 13:14:06,450 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:14:06,450 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:14:06,463 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:14:06,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:14:06,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-05 13:14:06,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:06,487 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:06,488 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:06,663 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:06,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:14:06,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-09-05 13:14:06,667 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:14:06,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-05 13:14:06,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-05 13:14:06,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-09-05 13:14:06,668 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 10 states. [2019-09-05 13:14:06,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:06,773 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2019-09-05 13:14:06,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 13:14:06,775 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-09-05 13:14:06,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:06,776 INFO L225 Difference]: With dead ends: 29 [2019-09-05 13:14:06,776 INFO L226 Difference]: Without dead ends: 29 [2019-09-05 13:14:06,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-09-05 13:14:06,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-05 13:14:06,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-09-05 13:14:06,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-05 13:14:06,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-09-05 13:14:06,783 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 18 [2019-09-05 13:14:06,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:06,784 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-09-05 13:14:06,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-05 13:14:06,785 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-09-05 13:14:06,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-05 13:14:06,786 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:06,786 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:06,786 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:06,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:06,787 INFO L82 PathProgramCache]: Analyzing trace with hash 111792630, now seen corresponding path program 7 times [2019-09-05 13:14:06,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:06,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:06,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:14:06,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:06,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:06,936 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:06,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:06,937 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:06,940 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:14:06,940 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:14:06,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:06,940 INFO L193 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) [2019-09-05 13:14:06,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:14:06,963 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:14:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:06,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-05 13:14:06,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:07,006 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:07,006 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:07,202 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:07,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:14:07,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-09-05 13:14:07,207 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:14:07,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-05 13:14:07,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-05 13:14:07,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-05 13:14:07,208 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 11 states. [2019-09-05 13:14:07,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:07,285 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2019-09-05 13:14:07,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-05 13:14:07,286 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-09-05 13:14:07,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:07,287 INFO L225 Difference]: With dead ends: 30 [2019-09-05 13:14:07,287 INFO L226 Difference]: Without dead ends: 30 [2019-09-05 13:14:07,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-05 13:14:07,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-05 13:14:07,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-09-05 13:14:07,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-05 13:14:07,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-09-05 13:14:07,291 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 19 [2019-09-05 13:14:07,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:07,291 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-09-05 13:14:07,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-05 13:14:07,291 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-09-05 13:14:07,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-05 13:14:07,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:07,292 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:07,292 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:07,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:07,293 INFO L82 PathProgramCache]: Analyzing trace with hash -802169685, now seen corresponding path program 8 times [2019-09-05 13:14:07,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:07,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:07,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:14:07,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:07,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:07,415 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:07,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:07,415 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:07,416 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:14:07,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:14:07,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:07,416 INFO L193 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 [2019-09-05 13:14:07,439 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:14:07,439 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:14:08,267 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-05 13:14:08,268 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:14:08,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-05 13:14:08,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:08,299 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:08,299 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:08,541 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:08,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:14:08,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-09-05 13:14:08,546 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:14:08,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-05 13:14:08,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-05 13:14:08,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-09-05 13:14:08,548 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 12 states. [2019-09-05 13:14:08,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:08,656 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-09-05 13:14:08,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-05 13:14:08,657 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-09-05 13:14:08,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:08,658 INFO L225 Difference]: With dead ends: 31 [2019-09-05 13:14:08,658 INFO L226 Difference]: Without dead ends: 31 [2019-09-05 13:14:08,659 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-09-05 13:14:08,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-05 13:14:08,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-09-05 13:14:08,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-05 13:14:08,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-09-05 13:14:08,662 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2019-09-05 13:14:08,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:08,662 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-09-05 13:14:08,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-05 13:14:08,663 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-09-05 13:14:08,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-05 13:14:08,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:08,664 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:08,664 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:08,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:08,665 INFO L82 PathProgramCache]: Analyzing trace with hash 929769622, now seen corresponding path program 9 times [2019-09-05 13:14:08,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:08,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:08,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:14:08,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:08,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:08,804 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:08,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:08,804 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:08,805 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:14:08,805 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:14:08,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:08,805 INFO L193 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 [2019-09-05 13:14:08,819 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:14:08,819 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:14:08,839 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:14:08,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:14:08,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-05 13:14:08,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:08,873 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:08,873 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:09,158 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:09,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:14:09,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-09-05 13:14:09,161 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:14:09,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-05 13:14:09,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-05 13:14:09,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-09-05 13:14:09,163 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 13 states. [2019-09-05 13:14:09,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:09,296 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-09-05 13:14:09,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-05 13:14:09,298 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2019-09-05 13:14:09,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:09,298 INFO L225 Difference]: With dead ends: 32 [2019-09-05 13:14:09,298 INFO L226 Difference]: Without dead ends: 32 [2019-09-05 13:14:09,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-09-05 13:14:09,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-05 13:14:09,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-09-05 13:14:09,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-05 13:14:09,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-09-05 13:14:09,302 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 21 [2019-09-05 13:14:09,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:09,302 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-09-05 13:14:09,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-05 13:14:09,302 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-09-05 13:14:09,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-05 13:14:09,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:09,303 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:09,303 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:09,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:09,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1214686709, now seen corresponding path program 10 times [2019-09-05 13:14:09,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:09,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:09,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:14:09,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:09,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:09,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:09,464 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:09,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:09,465 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:09,465 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:14:09,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:14:09,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:09,466 INFO L193 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 [2019-09-05 13:14:09,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:14:09,484 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:14:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:09,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-05 13:14:09,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:09,523 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:09,523 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:09,806 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:09,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:14:09,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-09-05 13:14:09,810 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:14:09,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-05 13:14:09,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-05 13:14:09,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-09-05 13:14:09,811 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 14 states. [2019-09-05 13:14:09,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:09,949 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-09-05 13:14:09,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-05 13:14:09,949 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-09-05 13:14:09,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:09,950 INFO L225 Difference]: With dead ends: 33 [2019-09-05 13:14:09,950 INFO L226 Difference]: Without dead ends: 33 [2019-09-05 13:14:09,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-09-05 13:14:09,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-05 13:14:09,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-09-05 13:14:09,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-05 13:14:09,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-09-05 13:14:09,954 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 22 [2019-09-05 13:14:09,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:09,955 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-09-05 13:14:09,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-05 13:14:09,955 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-09-05 13:14:09,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-05 13:14:09,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:09,956 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:09,956 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:09,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:09,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1026643766, now seen corresponding path program 11 times [2019-09-05 13:14:09,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:09,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:09,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:14:09,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:09,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:10,125 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:10,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:10,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:10,126 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:14:10,126 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:14:10,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:10,126 INFO L193 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 [2019-09-05 13:14:10,136 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:14:10,136 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:14:26,452 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-05 13:14:26,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:14:26,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-05 13:14:26,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:26,509 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:26,509 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:26,914 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:26,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:14:26,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-09-05 13:14:26,921 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:14:26,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-05 13:14:26,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-05 13:14:26,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2019-09-05 13:14:26,922 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 15 states. [2019-09-05 13:14:27,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:27,110 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-09-05 13:14:27,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-05 13:14:27,111 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2019-09-05 13:14:27,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:27,112 INFO L225 Difference]: With dead ends: 34 [2019-09-05 13:14:27,112 INFO L226 Difference]: Without dead ends: 34 [2019-09-05 13:14:27,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2019-09-05 13:14:27,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-05 13:14:27,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-09-05 13:14:27,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-05 13:14:27,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-09-05 13:14:27,116 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 23 [2019-09-05 13:14:27,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:27,116 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-09-05 13:14:27,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-05 13:14:27,117 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-09-05 13:14:27,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-05 13:14:27,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:27,117 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:27,118 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:27,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:27,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1788411755, now seen corresponding path program 12 times [2019-09-05 13:14:27,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:27,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:27,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:14:27,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:27,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:27,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:27,318 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:27,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:27,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:27,319 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:14:27,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:14:27,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:27,319 INFO L193 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 [2019-09-05 13:14:27,337 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:14:27,337 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:14:27,350 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:14:27,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:14:27,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-05 13:14:27,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:27,382 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:27,382 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:27,791 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:27,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:14:27,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-09-05 13:14:27,794 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:14:27,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-05 13:14:27,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-05 13:14:27,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-09-05 13:14:27,796 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 16 states. [2019-09-05 13:14:28,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:28,001 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-09-05 13:14:28,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-05 13:14:28,001 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2019-09-05 13:14:28,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:28,002 INFO L225 Difference]: With dead ends: 35 [2019-09-05 13:14:28,002 INFO L226 Difference]: Without dead ends: 35 [2019-09-05 13:14:28,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-09-05 13:14:28,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-05 13:14:28,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-09-05 13:14:28,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-05 13:14:28,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-09-05 13:14:28,006 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 24 [2019-09-05 13:14:28,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:28,006 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-09-05 13:14:28,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-05 13:14:28,006 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-09-05 13:14:28,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-05 13:14:28,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:28,007 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:28,007 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:28,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:28,008 INFO L82 PathProgramCache]: Analyzing trace with hash -366584362, now seen corresponding path program 13 times [2019-09-05 13:14:28,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:28,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:28,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:14:28,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:28,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:28,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:28,242 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:28,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:28,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:28,243 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:14:28,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:14:28,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:28,243 INFO L193 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 [2019-09-05 13:14:28,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:14:28,279 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:14:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:28,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-05 13:14:28,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:28,368 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:28,369 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:28,889 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:28,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:14:28,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-09-05 13:14:28,892 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:14:28,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-05 13:14:28,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-05 13:14:28,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2019-09-05 13:14:28,894 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 17 states. [2019-09-05 13:14:29,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:29,104 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-09-05 13:14:29,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-05 13:14:29,104 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2019-09-05 13:14:29,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:29,105 INFO L225 Difference]: With dead ends: 36 [2019-09-05 13:14:29,105 INFO L226 Difference]: Without dead ends: 36 [2019-09-05 13:14:29,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2019-09-05 13:14:29,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-05 13:14:29,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-09-05 13:14:29,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-05 13:14:29,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-09-05 13:14:29,109 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 25 [2019-09-05 13:14:29,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:29,110 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-09-05 13:14:29,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-05 13:14:29,110 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-09-05 13:14:29,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-05 13:14:29,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:29,111 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:29,111 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:29,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:29,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1548012747, now seen corresponding path program 14 times [2019-09-05 13:14:29,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:29,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:29,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:14:29,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:29,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:29,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:29,321 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:29,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:29,322 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:29,322 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:14:29,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:14:29,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:29,323 INFO L193 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 [2019-09-05 13:14:29,333 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:14:29,334 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:15:13,261 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-05 13:15:13,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:15:13,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-05 13:15:13,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:15:13,515 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:15:13,515 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:15:14,021 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 13:15:14,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:15:14,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-09-05 13:15:14,028 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:15:14,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-05 13:15:14,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-05 13:15:14,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 13:15:14,030 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 18 states. [2019-09-05 13:15:14,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:15:14,245 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-09-05 13:15:14,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 13:15:14,245 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2019-09-05 13:15:14,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:15:14,245 INFO L225 Difference]: With dead ends: 37 [2019-09-05 13:15:14,246 INFO L226 Difference]: Without dead ends: 37 [2019-09-05 13:15:14,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 13:15:14,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-05 13:15:14,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-09-05 13:15:14,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-05 13:15:14,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-09-05 13:15:14,249 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 26 [2019-09-05 13:15:14,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:15:14,250 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-09-05 13:15:14,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-05 13:15:14,250 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-09-05 13:15:14,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-05 13:15:14,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:15:14,251 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:15:14,251 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:15:14,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:15:14,251 INFO L82 PathProgramCache]: Analyzing trace with hash 770980982, now seen corresponding path program 15 times [2019-09-05 13:15:14,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:15:14,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:15:14,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:15:14,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:15:14,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:15:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:15:14,549 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:15:14,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:15:14,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:15:14,550 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:15:14,550 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:15:14,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:15:14,550 INFO L193 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 [2019-09-05 13:15:14,565 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:15:14,565 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:15:14,577 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:15:14,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:15:14,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-05 13:15:14,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:15:14,614 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:15:14,615 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:15:15,143 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:15:15,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:15:15,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-09-05 13:15:15,147 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:15:15,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-05 13:15:15,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-05 13:15:15,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 13:15:15,148 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 19 states. [2019-09-05 13:15:15,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:15:15,401 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-09-05 13:15:15,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-05 13:15:15,401 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 27 [2019-09-05 13:15:15,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:15:15,401 INFO L225 Difference]: With dead ends: 38 [2019-09-05 13:15:15,402 INFO L226 Difference]: Without dead ends: 38 [2019-09-05 13:15:15,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 13:15:15,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-05 13:15:15,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-09-05 13:15:15,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-05 13:15:15,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-09-05 13:15:15,406 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 27 [2019-09-05 13:15:15,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:15:15,406 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-09-05 13:15:15,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-05 13:15:15,407 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-09-05 13:15:15,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-05 13:15:15,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:15:15,407 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:15:15,408 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:15:15,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:15:15,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1842167253, now seen corresponding path program 16 times [2019-09-05 13:15:15,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:15:15,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:15:15,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:15:15,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:15:15,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:15:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:15:15,661 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:15:15,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:15:15,662 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:15:15,662 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:15:15,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:15:15,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:15:15,662 INFO L193 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 [2019-09-05 13:15:15,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:15:15,673 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:15:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:15:15,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-05 13:15:15,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:15:15,719 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:15:15,719 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:15:16,350 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:15:16,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:15:16,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-09-05 13:15:16,355 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:15:16,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-05 13:15:16,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-05 13:15:16,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2019-09-05 13:15:16,356 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 20 states. [2019-09-05 13:15:16,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:15:16,644 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2019-09-05 13:15:16,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-05 13:15:16,645 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2019-09-05 13:15:16,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:15:16,645 INFO L225 Difference]: With dead ends: 39 [2019-09-05 13:15:16,645 INFO L226 Difference]: Without dead ends: 39 [2019-09-05 13:15:16,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2019-09-05 13:15:16,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-05 13:15:16,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-09-05 13:15:16,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-05 13:15:16,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-09-05 13:15:16,648 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 28 [2019-09-05 13:15:16,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:15:16,649 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-09-05 13:15:16,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-05 13:15:16,649 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-09-05 13:15:16,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-05 13:15:16,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:15:16,650 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:15:16,650 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:15:16,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:15:16,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1245383914, now seen corresponding path program 17 times [2019-09-05 13:15:16,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:15:16,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:15:16,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:15:16,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:15:16,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:15:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:15:16,910 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:15:16,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:15:16,911 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:15:16,911 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:15:16,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:15:16,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:15:16,911 INFO L193 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 [2019-09-05 13:15:16,926 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:15:16,927 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:15:17,407 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-05 13:15:17,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:15:17,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-05 13:15:17,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:15:17,448 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:15:17,449 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:15:18,390 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:15:18,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:15:18,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-09-05 13:15:18,395 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:15:18,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-05 13:15:18,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-05 13:15:18,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 13:15:18,397 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 21 states. [2019-09-05 13:15:18,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:15:18,713 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-09-05 13:15:18,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-05 13:15:18,713 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2019-09-05 13:15:18,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:15:18,714 INFO L225 Difference]: With dead ends: 40 [2019-09-05 13:15:18,714 INFO L226 Difference]: Without dead ends: 40 [2019-09-05 13:15:18,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 13:15:18,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-05 13:15:18,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-09-05 13:15:18,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-05 13:15:18,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-05 13:15:18,717 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 29 [2019-09-05 13:15:18,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:15:18,717 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-05 13:15:18,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-05 13:15:18,717 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-05 13:15:18,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-05 13:15:18,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:15:18,718 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:15:18,719 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:15:18,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:15:18,719 INFO L82 PathProgramCache]: Analyzing trace with hash 75030411, now seen corresponding path program 18 times [2019-09-05 13:15:18,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:15:18,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:15:18,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:15:18,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:15:18,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:15:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:15:19,023 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:15:19,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:15:19,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:15:19,023 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:15:19,023 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:15:19,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:15:19,024 INFO L193 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 [2019-09-05 13:15:19,034 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:15:19,034 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:15:19,049 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:15:19,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:15:19,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-05 13:15:19,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:15:19,084 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:15:19,084 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:15:20,005 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:15:20,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:15:20,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-09-05 13:15:20,011 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:15:20,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-05 13:15:20,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-05 13:15:20,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2019-09-05 13:15:20,012 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 22 states. [2019-09-05 13:15:20,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:15:20,362 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-09-05 13:15:20,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-05 13:15:20,365 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2019-09-05 13:15:20,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:15:20,365 INFO L225 Difference]: With dead ends: 41 [2019-09-05 13:15:20,365 INFO L226 Difference]: Without dead ends: 41 [2019-09-05 13:15:20,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2019-09-05 13:15:20,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-05 13:15:20,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-09-05 13:15:20,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-05 13:15:20,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-09-05 13:15:20,368 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 30 [2019-09-05 13:15:20,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:15:20,368 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-09-05 13:15:20,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-05 13:15:20,368 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-09-05 13:15:20,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-05 13:15:20,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:15:20,369 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:15:20,369 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:15:20,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:15:20,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1941798474, now seen corresponding path program 19 times [2019-09-05 13:15:20,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:15:20,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:15:20,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:15:20,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:15:20,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:15:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:15:20,729 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:15:20,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:15:20,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:15:20,729 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:15:20,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:15:20,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:15:20,730 INFO L193 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 [2019-09-05 13:15:20,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:15:20,742 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:15:20,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:15:20,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-05 13:15:20,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:15:20,785 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:15:20,786 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:15:21,896 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:15:21,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:15:21,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-09-05 13:15:21,899 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:15:21,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-05 13:15:21,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-05 13:15:21,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2019-09-05 13:15:21,900 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 23 states. [2019-09-05 13:15:22,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:15:22,303 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-09-05 13:15:22,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-05 13:15:22,304 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 31 [2019-09-05 13:15:22,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:15:22,304 INFO L225 Difference]: With dead ends: 42 [2019-09-05 13:15:22,304 INFO L226 Difference]: Without dead ends: 42 [2019-09-05 13:15:22,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2019-09-05 13:15:22,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-05 13:15:22,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-09-05 13:15:22,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-05 13:15:22,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-09-05 13:15:22,308 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 31 [2019-09-05 13:15:22,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:15:22,308 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-09-05 13:15:22,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-05 13:15:22,308 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-09-05 13:15:22,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-05 13:15:22,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:15:22,309 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:15:22,309 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:15:22,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:15:22,309 INFO L82 PathProgramCache]: Analyzing trace with hash -38984469, now seen corresponding path program 20 times [2019-09-05 13:15:22,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:15:22,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:15:22,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:15:22,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:15:22,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:15:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:15:22,681 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:15:22,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:15:22,682 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:15:22,682 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:15:22,682 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:15:22,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:15:22,682 INFO L193 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) [2019-09-05 13:15:22,712 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:15:22,712 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:15:48,459 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-05 13:15:48,459 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:15:48,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-05 13:15:48,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:15:48,606 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:15:48,607 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:17:38,526 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 202 refuted. 8 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:17:38,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:17:38,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-09-05 13:17:38,533 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:17:38,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-05 13:17:38,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-05 13:17:38,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=1369, Unknown=41, NotChecked=0, Total=1980 [2019-09-05 13:17:38,534 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 24 states. [2019-09-05 13:17:38,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:17:38,967 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-09-05 13:17:38,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-05 13:17:38,967 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 32 [2019-09-05 13:17:38,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:17:38,968 INFO L225 Difference]: With dead ends: 43 [2019-09-05 13:17:38,968 INFO L226 Difference]: Without dead ends: 43 [2019-09-05 13:17:38,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 110.2s TimeCoverageRelationStatistics Valid=570, Invalid=1369, Unknown=41, NotChecked=0, Total=1980 [2019-09-05 13:17:38,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-05 13:17:38,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-09-05 13:17:38,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-05 13:17:38,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-09-05 13:17:38,972 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 32 [2019-09-05 13:17:38,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:17:38,972 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-09-05 13:17:38,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-05 13:17:38,973 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-09-05 13:17:38,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-05 13:17:38,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:17:38,973 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:17:38,973 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:17:38,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:17:38,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1181292458, now seen corresponding path program 21 times [2019-09-05 13:17:38,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:17:38,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:38,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:17:38,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:38,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:17:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:17:39,367 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:17:39,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:17:39,368 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:17:39,368 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:17:39,368 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:17:39,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:17:39,368 INFO L193 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 [2019-09-05 13:17:39,380 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:17:39,380 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:17:39,397 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:17:39,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:17:39,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-05 13:17:39,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:17:39,439 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:17:39,440 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:17:40,516 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:17:40,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:17:40,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-09-05 13:17:40,520 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:17:40,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-05 13:17:40,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-05 13:17:40,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2019-09-05 13:17:40,522 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 25 states. [2019-09-05 13:17:40,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:17:40,988 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2019-09-05 13:17:40,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-05 13:17:40,991 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 33 [2019-09-05 13:17:40,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:17:40,992 INFO L225 Difference]: With dead ends: 44 [2019-09-05 13:17:40,992 INFO L226 Difference]: Without dead ends: 44 [2019-09-05 13:17:40,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2019-09-05 13:17:40,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-05 13:17:40,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-09-05 13:17:40,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-05 13:17:40,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-09-05 13:17:40,995 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 33 [2019-09-05 13:17:40,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:17:40,995 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-09-05 13:17:40,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-05 13:17:40,996 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-09-05 13:17:40,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-05 13:17:40,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:17:40,996 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:17:40,997 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:17:40,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:17:40,997 INFO L82 PathProgramCache]: Analyzing trace with hash 2061865547, now seen corresponding path program 22 times [2019-09-05 13:17:40,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:17:40,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:40,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:17:40,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:40,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:17:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:17:41,563 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:17:41,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:17:41,563 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:17:41,563 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:17:41,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:17:41,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:17:41,564 INFO L193 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 [2019-09-05 13:17:41,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:41,575 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:17:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:17:41,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-05 13:17:41,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:17:41,622 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:17:41,623 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:17:42,982 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:17:42,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:17:42,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-09-05 13:17:42,986 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:17:42,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-05 13:17:42,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-05 13:17:42,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2019-09-05 13:17:42,989 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 26 states. [2019-09-05 13:17:43,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:17:43,496 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-09-05 13:17:43,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-05 13:17:43,497 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 34 [2019-09-05 13:17:43,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:17:43,497 INFO L225 Difference]: With dead ends: 45 [2019-09-05 13:17:43,497 INFO L226 Difference]: Without dead ends: 45 [2019-09-05 13:17:43,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2019-09-05 13:17:43,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-05 13:17:43,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-09-05 13:17:43,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-05 13:17:43,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-09-05 13:17:43,501 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 34 [2019-09-05 13:17:43,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:17:43,501 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-09-05 13:17:43,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-05 13:17:43,501 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-09-05 13:17:43,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-05 13:17:43,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:17:43,502 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:17:43,503 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:17:43,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:17:43,503 INFO L82 PathProgramCache]: Analyzing trace with hash -479451402, now seen corresponding path program 23 times [2019-09-05 13:17:43,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:17:43,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:43,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:43,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:43,504 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:17:43,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:17:43,899 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:17:43,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:17:43,899 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:17:43,899 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:17:43,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:17:43,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:17:43,900 INFO L193 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 [2019-09-05 13:17:43,911 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:17:43,911 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:19:39,215 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-05 13:19:39,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:19:39,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-05 13:19:39,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:19:39,333 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:19:39,333 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:21:44,105 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-09-05 13:22:03,908 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 262 refuted. 14 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:22:03,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:22:03,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-09-05 13:22:03,915 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:22:03,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-05 13:22:03,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-05 13:22:03,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=723, Invalid=1773, Unknown=54, NotChecked=0, Total=2550 [2019-09-05 13:22:03,917 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 27 states. [2019-09-05 13:22:04,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:22:04,441 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2019-09-05 13:22:04,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-05 13:22:04,441 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 35 [2019-09-05 13:22:04,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:22:04,442 INFO L225 Difference]: With dead ends: 46 [2019-09-05 13:22:04,442 INFO L226 Difference]: Without dead ends: 46 [2019-09-05 13:22:04,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 144.9s TimeCoverageRelationStatistics Valid=723, Invalid=1773, Unknown=54, NotChecked=0, Total=2550 [2019-09-05 13:22:04,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-05 13:22:04,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-09-05 13:22:04,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-05 13:22:04,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-09-05 13:22:04,446 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 35 [2019-09-05 13:22:04,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:22:04,448 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-09-05 13:22:04,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-05 13:22:04,449 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-09-05 13:22:04,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-05 13:22:04,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:22:04,449 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:22:04,450 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:22:04,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:22:04,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1950865493, now seen corresponding path program 24 times [2019-09-05 13:22:04,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:22:04,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:22:04,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:22:04,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:22:04,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:22:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:22:04,943 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:22:04,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:22:04,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:22:04,943 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:22:04,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:22:04,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:22:04,944 INFO L193 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 [2019-09-05 13:22:04,957 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:22:04,957 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:22:04,976 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:22:04,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:22:04,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-05 13:22:04,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:22:05,023 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:22:05,023 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:22:06,378 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:22:06,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:22:06,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-09-05 13:22:06,381 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:22:06,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-05 13:22:06,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-05 13:22:06,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2019-09-05 13:22:06,382 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 28 states. [2019-09-05 13:22:06,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:22:06,965 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2019-09-05 13:22:06,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-05 13:22:06,966 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 36 [2019-09-05 13:22:06,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:22:06,967 INFO L225 Difference]: With dead ends: 47 [2019-09-05 13:22:06,967 INFO L226 Difference]: Without dead ends: 47 [2019-09-05 13:22:06,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2019-09-05 13:22:06,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-05 13:22:06,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-09-05 13:22:06,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-05 13:22:06,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-09-05 13:22:06,971 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 36 [2019-09-05 13:22:06,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:22:06,971 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-09-05 13:22:06,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-05 13:22:06,971 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-09-05 13:22:06,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-05 13:22:06,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:22:06,972 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:22:06,972 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:22:06,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:22:06,972 INFO L82 PathProgramCache]: Analyzing trace with hash -320062058, now seen corresponding path program 25 times [2019-09-05 13:22:06,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:22:06,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:22:06,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:22:06,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:22:06,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:22:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:22:07,423 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:22:07,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:22:07,424 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:22:07,424 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:22:07,424 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:22:07,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:22:07,424 INFO L193 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 [2019-09-05 13:22:07,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:22:07,436 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:22:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:22:07,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-05 13:22:07,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:22:07,487 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:22:07,487 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:22:10,960 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 324 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:22:10,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:22:10,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-09-05 13:22:10,964 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:22:10,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-05 13:22:10,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-05 13:22:10,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=835, Invalid=2134, Unknown=1, NotChecked=0, Total=2970 [2019-09-05 13:22:10,966 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 29 states. [2019-09-05 13:22:11,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:22:11,566 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2019-09-05 13:22:11,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-05 13:22:11,567 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 37 [2019-09-05 13:22:11,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:22:11,568 INFO L225 Difference]: With dead ends: 48 [2019-09-05 13:22:11,568 INFO L226 Difference]: Without dead ends: 48 [2019-09-05 13:22:11,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=835, Invalid=2134, Unknown=1, NotChecked=0, Total=2970 [2019-09-05 13:22:11,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-05 13:22:11,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-09-05 13:22:11,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-05 13:22:11,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-09-05 13:22:11,571 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 37 [2019-09-05 13:22:11,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:22:11,571 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-09-05 13:22:11,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-05 13:22:11,571 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-09-05 13:22:11,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-05 13:22:11,572 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:22:11,572 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:22:11,572 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:22:11,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:22:11,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1304763125, now seen corresponding path program 26 times [2019-09-05 13:22:11,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:22:11,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:22:11,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:22:11,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:22:11,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:22:11,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:22:12,058 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:22:12,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:22:12,058 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:22:12,059 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:22:12,059 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:22:12,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:22:12,059 INFO L193 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 [2019-09-05 13:22:12,070 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:22:12,070 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:23:04,540 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-05 13:23:04,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:23:05,263 WARN L254 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-05 13:23:05,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:23:05,319 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:23:05,319 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:25:32,008 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 339 refuted. 12 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:25:32,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:25:32,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-09-05 13:25:32,014 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:25:32,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-05 13:25:32,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-05 13:25:32,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=894, Invalid=2246, Unknown=52, NotChecked=0, Total=3192 [2019-09-05 13:25:32,015 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 30 states. [2019-09-05 13:25:32,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:25:32,597 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-09-05 13:25:32,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-05 13:25:32,598 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 38 [2019-09-05 13:25:32,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:25:32,599 INFO L225 Difference]: With dead ends: 49 [2019-09-05 13:25:32,599 INFO L226 Difference]: Without dead ends: 49 [2019-09-05 13:25:32,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 147.1s TimeCoverageRelationStatistics Valid=894, Invalid=2246, Unknown=52, NotChecked=0, Total=3192 [2019-09-05 13:25:32,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-05 13:25:32,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-09-05 13:25:32,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-05 13:25:32,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-09-05 13:25:32,603 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 38 [2019-09-05 13:25:32,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:25:32,604 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-09-05 13:25:32,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-05 13:25:32,604 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-09-05 13:25:32,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-05 13:25:32,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:25:32,604 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:25:32,605 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:25:32,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:25:32,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1765725130, now seen corresponding path program 27 times [2019-09-05 13:25:32,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:25:32,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:25:32,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:25:32,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:25:32,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:25:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:25:33,273 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:25:33,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:25:33,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:25:33,273 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:25:33,273 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:25:33,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:25:33,273 INFO L193 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) [2019-09-05 13:25:33,287 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:25:33,287 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:25:33,308 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:25:33,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:25:33,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-05 13:25:33,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:25:33,344 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:25:33,344 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:25:34,995 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:25:35,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:25:35,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-09-05 13:25:35,001 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:25:35,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-05 13:25:35,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-05 13:25:35,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2019-09-05 13:25:35,003 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 31 states. [2019-09-05 13:25:35,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:25:35,668 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-09-05 13:25:35,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-05 13:25:35,669 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 39 [2019-09-05 13:25:35,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:25:35,669 INFO L225 Difference]: With dead ends: 50 [2019-09-05 13:25:35,670 INFO L226 Difference]: Without dead ends: 50 [2019-09-05 13:25:35,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2019-09-05 13:25:35,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-05 13:25:35,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-09-05 13:25:35,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-05 13:25:35,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-09-05 13:25:35,673 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 39 [2019-09-05 13:25:35,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:25:35,673 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-09-05 13:25:35,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-05 13:25:35,674 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-09-05 13:25:35,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-05 13:25:35,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:25:35,674 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:25:35,674 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:25:35,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:25:35,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1124321899, now seen corresponding path program 28 times [2019-09-05 13:25:35,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:25:35,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:25:35,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:25:35,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:25:35,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:25:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:25:36,226 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:25:36,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:25:36,227 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:25:36,227 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:25:36,227 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:25:36,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:25:36,227 INFO L193 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 [2019-09-05 13:25:36,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:25:36,246 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:25:36,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:25:36,274 WARN L254 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-05 13:25:36,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:25:36,308 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:25:36,308 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:25:38,064 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:25:38,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:25:38,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-09-05 13:25:38,068 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:25:38,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-05 13:25:38,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-05 13:25:38,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1018, Invalid=2642, Unknown=0, NotChecked=0, Total=3660 [2019-09-05 13:25:38,069 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 32 states. [2019-09-05 13:25:38,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:25:38,785 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2019-09-05 13:25:38,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-05 13:25:38,785 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2019-09-05 13:25:38,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:25:38,786 INFO L225 Difference]: With dead ends: 51 [2019-09-05 13:25:38,786 INFO L226 Difference]: Without dead ends: 51 [2019-09-05 13:25:38,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1018, Invalid=2642, Unknown=0, NotChecked=0, Total=3660 [2019-09-05 13:25:38,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-05 13:25:38,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-09-05 13:25:38,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-05 13:25:38,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-09-05 13:25:38,790 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 40 [2019-09-05 13:25:38,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:25:38,790 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-09-05 13:25:38,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-05 13:25:38,790 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-09-05 13:25:38,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-05 13:25:38,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:25:38,794 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:25:38,795 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:25:38,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:25:38,795 INFO L82 PathProgramCache]: Analyzing trace with hash 521466582, now seen corresponding path program 29 times [2019-09-05 13:25:38,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:25:38,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:25:38,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:25:38,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:25:38,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:25:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:25:39,359 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:25:39,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:25:39,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:25:39,359 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:25:39,359 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:25:39,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:25:39,360 INFO L193 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 [2019-09-05 13:25:39,372 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:25:39,373 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:28:03,890 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-05 13:28:03,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:28:04,004 WARN L254 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-05 13:28:04,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:28:04,062 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:28:04,062 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:28:06,057 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:28:06,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:28:06,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-09-05 13:28:06,064 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:28:06,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-05 13:28:06,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-05 13:28:06,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=2823, Unknown=0, NotChecked=0, Total=3906 [2019-09-05 13:28:06,065 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 33 states. [2019-09-05 13:28:06,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:28:06,880 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2019-09-05 13:28:06,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-05 13:28:06,881 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 41 [2019-09-05 13:28:06,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:28:06,881 INFO L225 Difference]: With dead ends: 52 [2019-09-05 13:28:06,881 INFO L226 Difference]: Without dead ends: 52 [2019-09-05 13:28:06,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1083, Invalid=2823, Unknown=0, NotChecked=0, Total=3906 [2019-09-05 13:28:06,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-05 13:28:06,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-09-05 13:28:06,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-05 13:28:06,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-09-05 13:28:06,885 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 41 [2019-09-05 13:28:06,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:28:06,886 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-09-05 13:28:06,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-05 13:28:06,886 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-09-05 13:28:06,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-05 13:28:06,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:28:06,887 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:28:06,887 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:28:06,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:28:06,887 INFO L82 PathProgramCache]: Analyzing trace with hash -987179061, now seen corresponding path program 30 times [2019-09-05 13:28:06,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:28:06,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:28:06,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:28:06,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:28:06,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:28:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:28:07,553 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:28:07,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:28:07,553 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:28:07,554 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:28:07,554 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:28:07,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:28:07,554 INFO L193 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 [2019-09-05 13:28:07,570 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:28:07,570 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:28:07,593 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:28:07,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:28:07,595 WARN L254 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-05 13:28:07,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:28:07,632 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:28:07,632 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:28:09,855 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:28:09,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:28:09,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-09-05 13:28:09,858 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:28:09,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-05 13:28:09,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-05 13:28:09,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1150, Invalid=3010, Unknown=0, NotChecked=0, Total=4160 [2019-09-05 13:28:09,859 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 34 states. [2019-09-05 13:28:10,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:28:10,721 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2019-09-05 13:28:10,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-05 13:28:10,728 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 42 [2019-09-05 13:28:10,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:28:10,729 INFO L225 Difference]: With dead ends: 53 [2019-09-05 13:28:10,729 INFO L226 Difference]: Without dead ends: 53 [2019-09-05 13:28:10,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1150, Invalid=3010, Unknown=0, NotChecked=0, Total=4160 [2019-09-05 13:28:10,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-05 13:28:10,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-09-05 13:28:10,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-05 13:28:10,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-09-05 13:28:10,734 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 42 [2019-09-05 13:28:10,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:28:10,734 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-09-05 13:28:10,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-05 13:28:10,735 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-09-05 13:28:10,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-05 13:28:10,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:28:10,735 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:28:10,735 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:28:10,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:28:10,736 INFO L82 PathProgramCache]: Analyzing trace with hash -510553738, now seen corresponding path program 31 times [2019-09-05 13:28:10,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:28:10,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:28:10,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:28:10,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:28:10,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:28:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:28:11,346 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:28:11,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:28:11,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:28:11,346 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:28:11,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:28:11,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:28:11,346 INFO L193 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 [2019-09-05 13:28:11,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:28:11,364 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:28:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:28:11,387 WARN L254 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-05 13:28:11,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:28:11,445 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:28:11,445 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:28:13,642 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:28:13,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:28:13,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-09-05 13:28:13,645 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:28:13,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-05 13:28:13,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-05 13:28:13,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1219, Invalid=3203, Unknown=0, NotChecked=0, Total=4422 [2019-09-05 13:28:13,647 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 35 states. [2019-09-05 13:28:14,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:28:14,562 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2019-09-05 13:28:14,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-05 13:28:14,562 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 43 [2019-09-05 13:28:14,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:28:14,563 INFO L225 Difference]: With dead ends: 54 [2019-09-05 13:28:14,563 INFO L226 Difference]: Without dead ends: 54 [2019-09-05 13:28:14,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1219, Invalid=3203, Unknown=0, NotChecked=0, Total=4422 [2019-09-05 13:28:14,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-05 13:28:14,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-09-05 13:28:14,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-05 13:28:14,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-09-05 13:28:14,566 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 43 [2019-09-05 13:28:14,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:28:14,567 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-09-05 13:28:14,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-05 13:28:14,567 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-09-05 13:28:14,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-05 13:28:14,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:28:14,567 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:28:14,567 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:28:14,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:28:14,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1379929387, now seen corresponding path program 32 times [2019-09-05 13:28:14,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:28:14,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:28:14,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:28:14,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:28:14,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:28:14,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:28:15,388 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:28:15,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:28:15,388 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:28:15,388 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:28:15,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:28:15,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:28:15,389 INFO L193 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) [2019-09-05 13:28:15,416 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:28:15,417 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000