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/Mono4_1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 21:04:27,063 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 21:04:27,065 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 21:04:27,080 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 21:04:27,081 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 21:04:27,082 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 21:04:27,084 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 21:04:27,090 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 21:04:27,091 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 21:04:27,097 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 21:04:27,098 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 21:04:27,099 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 21:04:27,099 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 21:04:27,100 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 21:04:27,101 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 21:04:27,103 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 21:04:27,104 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 21:04:27,105 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 21:04:27,110 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 21:04:27,112 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 21:04:27,114 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 21:04:27,115 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 21:04:27,118 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 21:04:27,119 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 21:04:27,122 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 21:04:27,122 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 21:04:27,122 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 21:04:27,124 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 21:04:27,125 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 21:04:27,125 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 21:04:27,126 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 21:04:27,126 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 21:04:27,127 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 21:04:27,128 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 21:04:27,129 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 21:04:27,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 21:04:27,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 21:04:27,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 21:04:27,130 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 21:04:27,131 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 21:04:27,132 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 21:04:27,132 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-03 21:04:27,147 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 21:04:27,147 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 21:04:27,148 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 21:04:27,148 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 21:04:27,149 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 21:04:27,149 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 21:04:27,149 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 21:04:27,149 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 21:04:27,149 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 21:04:27,150 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 21:04:27,150 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 21:04:27,150 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 21:04:27,151 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 21:04:27,151 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 21:04:27,151 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 21:04:27,151 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 21:04:27,151 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 21:04:27,151 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 21:04:27,152 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 21:04:27,152 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 21:04:27,152 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 21:04:27,152 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 21:04:27,152 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 21:04:27,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 21:04:27,153 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 21:04:27,153 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 21:04:27,153 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 21:04:27,153 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 21:04:27,154 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 21:04:27,154 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 21:04:27,184 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 21:04:27,196 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 21:04:27,199 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 21:04:27,201 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 21:04:27,201 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 21:04:27,202 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono4_1.c [2019-09-03 21:04:27,263 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c3dc255a/c7328d68004840feac3bcc4884bd7e3b/FLAG646c6ebac [2019-09-03 21:04:27,681 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 21:04:27,682 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono4_1.c [2019-09-03 21:04:27,687 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c3dc255a/c7328d68004840feac3bcc4884bd7e3b/FLAG646c6ebac [2019-09-03 21:04:28,019 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c3dc255a/c7328d68004840feac3bcc4884bd7e3b [2019-09-03 21:04:28,027 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 21:04:28,029 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 21:04:28,030 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 21:04:28,030 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 21:04:28,033 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 21:04:28,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 09:04:28" (1/1) ... [2019-09-03 21:04:28,037 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@318651a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:28, skipping insertion in model container [2019-09-03 21:04:28,037 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 09:04:28" (1/1) ... [2019-09-03 21:04:28,043 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 21:04:28,056 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 21:04:28,195 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 21:04:28,201 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 21:04:28,215 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 21:04:28,226 INFO L192 MainTranslator]: Completed translation [2019-09-03 21:04:28,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:28 WrapperNode [2019-09-03 21:04:28,226 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 21:04:28,227 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 21:04:28,227 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 21:04:28,227 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 21:04:28,240 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:28" (1/1) ... [2019-09-03 21:04:28,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:28" (1/1) ... [2019-09-03 21:04:28,244 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:28" (1/1) ... [2019-09-03 21:04:28,244 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:28" (1/1) ... [2019-09-03 21:04:28,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:28" (1/1) ... [2019-09-03 21:04:28,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:28" (1/1) ... [2019-09-03 21:04:28,334 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:28" (1/1) ... [2019-09-03 21:04:28,336 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 21:04:28,336 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 21:04:28,336 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 21:04:28,336 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 21:04:28,337 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:28" (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-03 21:04:28,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 21:04:28,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 21:04:28,389 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 21:04:28,389 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 21:04:28,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 21:04:28,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 21:04:28,389 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 21:04:28,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 21:04:28,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 21:04:28,528 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 21:04:28,528 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 21:04:28,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 09:04:28 BoogieIcfgContainer [2019-09-03 21:04:28,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 21:04:28,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 21:04:28,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 21:04:28,533 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 21:04:28,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 09:04:28" (1/3) ... [2019-09-03 21:04:28,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e402e96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 09:04:28, skipping insertion in model container [2019-09-03 21:04:28,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:28" (2/3) ... [2019-09-03 21:04:28,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e402e96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 09:04:28, skipping insertion in model container [2019-09-03 21:04:28,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 09:04:28" (3/3) ... [2019-09-03 21:04:28,537 INFO L109 eAbstractionObserver]: Analyzing ICFG Mono4_1.c [2019-09-03 21:04:28,544 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 21:04:28,550 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 21:04:28,566 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 21:04:28,590 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 21:04:28,590 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 21:04:28,591 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 21:04:28,591 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 21:04:28,591 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 21:04:28,591 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 21:04:28,591 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 21:04:28,591 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 21:04:28,603 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-09-03 21:04:28,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 21:04:28,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:28,611 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:28,613 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:28,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:28,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1712329921, now seen corresponding path program 1 times [2019-09-03 21:04:28,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:28,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:28,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:28,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:28,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:28,713 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-03 21:04:28,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 21:04:28,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 21:04:28,715 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 21:04:28,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 21:04:28,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 21:04:28,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 21:04:28,734 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-09-03 21:04:28,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:28,750 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-09-03 21:04:28,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 21:04:28,752 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-03 21:04:28,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:28,761 INFO L225 Difference]: With dead ends: 19 [2019-09-03 21:04:28,761 INFO L226 Difference]: Without dead ends: 12 [2019-09-03 21:04:28,763 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-03 21:04:28,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-03 21:04:28,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-03 21:04:28,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-03 21:04:28,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-09-03 21:04:28,800 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2019-09-03 21:04:28,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:28,800 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-09-03 21:04:28,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 21:04:28,801 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-09-03 21:04:28,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 21:04:28,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:28,801 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:28,802 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:28,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:28,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1703094711, now seen corresponding path program 1 times [2019-09-03 21:04:28,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:28,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:28,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:28,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:28,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:28,847 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-03 21:04:28,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 21:04:28,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 21:04:28,848 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 21:04:28,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 21:04:28,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 21:04:28,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 21:04:28,851 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 3 states. [2019-09-03 21:04:28,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:28,869 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-09-03 21:04:28,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 21:04:28,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-03 21:04:28,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:28,871 INFO L225 Difference]: With dead ends: 14 [2019-09-03 21:04:28,871 INFO L226 Difference]: Without dead ends: 14 [2019-09-03 21:04:28,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 21:04:28,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-03 21:04:28,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-03 21:04:28,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-03 21:04:28,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-09-03 21:04:28,876 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2019-09-03 21:04:28,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:28,876 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-09-03 21:04:28,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 21:04:28,877 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-09-03 21:04:28,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 21:04:28,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:28,878 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:28,878 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:28,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:28,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1337256884, now seen corresponding path program 1 times [2019-09-03 21:04:28,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:28,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:28,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:28,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:28,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:28,907 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-03 21:04:28,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:28,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:28,909 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 13 with the following transitions: [2019-09-03 21:04:28,911 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [26], [29], [31], [37], [38], [39], [41] [2019-09-03 21:04:28,954 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 21:04:28,955 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 21:04:29,060 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-03 21:04:29,063 INFO L272 AbstractInterpreter]: Visited 8 different actions 23 times. Merged at 2 different actions 10 times. Widened at 1 different actions 1 times. Performed 42 root evaluator evaluations with a maximum evaluation depth of 4. Performed 42 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2019-09-03 21:04:29,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:29,067 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-03 21:04:29,099 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-03 21:04:29,099 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-03 21:04:29,105 INFO L420 sIntCurrentIteration]: We unified 11 AI predicates to 11 [2019-09-03 21:04:29,105 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-03 21:04:29,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-03 21:04:29,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-03 21:04:29,106 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 21:04:29,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 21:04:29,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 21:04:29,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 21:04:29,108 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 3 states. [2019-09-03 21:04:29,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:29,134 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2019-09-03 21:04:29,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 21:04:29,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-09-03 21:04:29,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:29,135 INFO L225 Difference]: With dead ends: 16 [2019-09-03 21:04:29,136 INFO L226 Difference]: Without dead ends: 16 [2019-09-03 21:04:29,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 21:04:29,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-03 21:04:29,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-03 21:04:29,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-03 21:04:29,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-09-03 21:04:29,140 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2019-09-03 21:04:29,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:29,140 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-09-03 21:04:29,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 21:04:29,141 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-09-03 21:04:29,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 21:04:29,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:29,142 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:29,142 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:29,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:29,143 INFO L82 PathProgramCache]: Analyzing trace with hash 2011681711, now seen corresponding path program 1 times [2019-09-03 21:04:29,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:29,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:29,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:29,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:29,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:29,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:29,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:29,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:29,211 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2019-09-03 21:04:29,211 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [18], [26], [29], [31], [37], [38], [39], [41] [2019-09-03 21:04:29,214 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 21:04:29,214 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 21:04:29,256 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 21:04:29,256 INFO L272 AbstractInterpreter]: Visited 13 different actions 45 times. Merged at 4 different actions 15 times. Widened at 2 different actions 3 times. Performed 84 root evaluator evaluations with a maximum evaluation depth of 5. Performed 84 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 4 fixpoints after 2 different actions. Largest state had 2 variables. [2019-09-03 21:04:29,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:29,259 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 21:04:29,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:29,259 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-03 21:04:29,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:29,273 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-03 21:04:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:29,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-03 21:04:29,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:29,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:29,320 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:29,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:29,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:29,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-03 21:04:29,354 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:29,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 21:04:29,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 21:04:29,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-03 21:04:29,357 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 4 states. [2019-09-03 21:04:29,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:29,389 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-09-03 21:04:29,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 21:04:29,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-09-03 21:04:29,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:29,393 INFO L225 Difference]: With dead ends: 18 [2019-09-03 21:04:29,394 INFO L226 Difference]: Without dead ends: 18 [2019-09-03 21:04:29,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-03 21:04:29,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-03 21:04:29,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-03 21:04:29,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-03 21:04:29,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-09-03 21:04:29,401 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2019-09-03 21:04:29,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:29,402 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-09-03 21:04:29,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 21:04:29,402 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-09-03 21:04:29,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 21:04:29,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:29,404 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:29,404 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:29,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:29,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1891741908, now seen corresponding path program 2 times [2019-09-03 21:04:29,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:29,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:29,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:29,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:29,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:29,496 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-03 21:04:29,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:29,496 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:29,497 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:29,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:29,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:29,497 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-03 21:04:29,509 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:04:29,510 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:04:29,521 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-03 21:04:29,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:29,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 21:04:29,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:29,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:04:29,602 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-03 21:04:29,602 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:29,656 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-03 21:04:29,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:29,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-09-03 21:04:29,660 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:29,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 21:04:29,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 21:04:29,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-03 21:04:29,662 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 10 states. [2019-09-03 21:04:29,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:29,711 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2019-09-03 21:04:29,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 21:04:29,712 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-09-03 21:04:29,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:29,713 INFO L225 Difference]: With dead ends: 23 [2019-09-03 21:04:29,713 INFO L226 Difference]: Without dead ends: 20 [2019-09-03 21:04:29,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-09-03 21:04:29,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-03 21:04:29,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-03 21:04:29,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-03 21:04:29,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-09-03 21:04:29,718 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 16 [2019-09-03 21:04:29,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:29,718 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-09-03 21:04:29,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 21:04:29,719 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-09-03 21:04:29,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 21:04:29,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:29,720 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:29,720 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:29,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:29,721 INFO L82 PathProgramCache]: Analyzing trace with hash -89769689, now seen corresponding path program 3 times [2019-09-03 21:04:29,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:29,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:29,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:29,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:29,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:29,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:29,836 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-03 21:04:29,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:29,836 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:29,836 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:29,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:29,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:29,837 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-03 21:04:29,857 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:04:29,857 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:04:29,873 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:04:29,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:29,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-03 21:04:29,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:29,918 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 21:04:29,919 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:29,976 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 21:04:29,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:29,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 14 [2019-09-03 21:04:29,980 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:29,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 21:04:29,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 21:04:29,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-09-03 21:04:29,983 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 11 states. [2019-09-03 21:04:30,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:30,092 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2019-09-03 21:04:30,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 21:04:30,092 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-09-03 21:04:30,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:30,093 INFO L225 Difference]: With dead ends: 27 [2019-09-03 21:04:30,093 INFO L226 Difference]: Without dead ends: 24 [2019-09-03 21:04:30,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-09-03 21:04:30,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-03 21:04:30,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-03 21:04:30,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-03 21:04:30,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-09-03 21:04:30,098 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 18 [2019-09-03 21:04:30,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:30,098 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-09-03 21:04:30,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 21:04:30,098 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-09-03 21:04:30,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 21:04:30,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:30,099 INFO L399 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:30,100 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:30,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:30,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1567930911, now seen corresponding path program 4 times [2019-09-03 21:04:30,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:30,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:30,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:30,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:30,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:30,170 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 21:04:30,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:30,171 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:30,173 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:30,173 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:30,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:30,174 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-03 21:04:30,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:30,202 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:04:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:30,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 21:04:30,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:30,270 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 21:04:30,271 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:30,336 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 21:04:30,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:30,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 17 [2019-09-03 21:04:30,342 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:30,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 21:04:30,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 21:04:30,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-09-03 21:04:30,343 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 13 states. [2019-09-03 21:04:30,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:30,460 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-09-03 21:04:30,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 21:04:30,461 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2019-09-03 21:04:30,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:30,462 INFO L225 Difference]: With dead ends: 31 [2019-09-03 21:04:30,462 INFO L226 Difference]: Without dead ends: 28 [2019-09-03 21:04:30,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2019-09-03 21:04:30,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-03 21:04:30,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-09-03 21:04:30,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-03 21:04:30,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-09-03 21:04:30,471 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 22 [2019-09-03 21:04:30,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:30,472 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-09-03 21:04:30,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 21:04:30,472 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-09-03 21:04:30,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 21:04:30,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:30,473 INFO L399 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:30,474 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:30,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:30,476 INFO L82 PathProgramCache]: Analyzing trace with hash 240236183, now seen corresponding path program 5 times [2019-09-03 21:04:30,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:30,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:30,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:30,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:30,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:30,604 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-03 21:04:30,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:30,605 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:30,605 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:30,605 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:30,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:30,606 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-03 21:04:30,625 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:04:30,625 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:04:30,641 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-03 21:04:30,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:30,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 21:04:30,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:30,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:04:30,696 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-03 21:04:30,697 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:30,808 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-03 21:04:30,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:30,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-09-03 21:04:30,816 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:30,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 21:04:30,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 21:04:30,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-09-03 21:04:30,818 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 13 states. [2019-09-03 21:04:30,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:30,884 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2019-09-03 21:04:30,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 21:04:30,885 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2019-09-03 21:04:30,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:30,885 INFO L225 Difference]: With dead ends: 33 [2019-09-03 21:04:30,886 INFO L226 Difference]: Without dead ends: 30 [2019-09-03 21:04:30,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2019-09-03 21:04:30,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-03 21:04:30,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-03 21:04:30,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-03 21:04:30,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-09-03 21:04:30,891 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 26 [2019-09-03 21:04:30,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:30,891 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-09-03 21:04:30,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 21:04:30,891 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-09-03 21:04:30,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 21:04:30,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:30,892 INFO L399 BasicCegarLoop]: trace histogram [9, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:30,892 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:30,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:30,893 INFO L82 PathProgramCache]: Analyzing trace with hash 41775570, now seen corresponding path program 6 times [2019-09-03 21:04:30,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:30,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:30,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:30,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:30,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:31,001 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-03 21:04:31,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:31,001 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:31,001 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:31,002 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:31,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:31,002 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-03 21:04:31,016 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:04:31,016 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:04:31,031 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:04:31,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:31,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 21:04:31,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:31,135 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-03 21:04:31,135 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:31,229 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-03 21:04:31,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:31,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 21 [2019-09-03 21:04:31,233 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:31,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 21:04:31,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 21:04:31,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2019-09-03 21:04:31,234 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 16 states. [2019-09-03 21:04:31,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:31,376 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2019-09-03 21:04:31,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 21:04:31,376 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2019-09-03 21:04:31,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:31,377 INFO L225 Difference]: With dead ends: 37 [2019-09-03 21:04:31,377 INFO L226 Difference]: Without dead ends: 34 [2019-09-03 21:04:31,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2019-09-03 21:04:31,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-03 21:04:31,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-09-03 21:04:31,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-03 21:04:31,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2019-09-03 21:04:31,382 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 28 [2019-09-03 21:04:31,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:31,383 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2019-09-03 21:04:31,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 21:04:31,383 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2019-09-03 21:04:31,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 21:04:31,384 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:31,384 INFO L399 BasicCegarLoop]: trace histogram [11, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:31,384 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:31,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:31,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1184443338, now seen corresponding path program 7 times [2019-09-03 21:04:31,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:31,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:31,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:31,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:31,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:31,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:31,494 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-03 21:04:31,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:31,495 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:31,495 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:31,495 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:31,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:31,495 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:31,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:31,506 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:04:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:31,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 21:04:31,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:31,600 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 30 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-03 21:04:31,600 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:31,711 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 30 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-03 21:04:31,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:31,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 24 [2019-09-03 21:04:31,715 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:31,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 21:04:31,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 21:04:31,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2019-09-03 21:04:31,717 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 18 states. [2019-09-03 21:04:31,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:31,885 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2019-09-03 21:04:31,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 21:04:31,886 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2019-09-03 21:04:31,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:31,886 INFO L225 Difference]: With dead ends: 41 [2019-09-03 21:04:31,887 INFO L226 Difference]: Without dead ends: 38 [2019-09-03 21:04:31,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=266, Invalid=726, Unknown=0, NotChecked=0, Total=992 [2019-09-03 21:04:31,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-03 21:04:31,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-09-03 21:04:31,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-03 21:04:31,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2019-09-03 21:04:31,891 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 32 [2019-09-03 21:04:31,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:31,892 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2019-09-03 21:04:31,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 21:04:31,892 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2019-09-03 21:04:31,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-03 21:04:31,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:31,893 INFO L399 BasicCegarLoop]: trace histogram [13, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:31,893 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:31,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:31,894 INFO L82 PathProgramCache]: Analyzing trace with hash -71876286, now seen corresponding path program 8 times [2019-09-03 21:04:31,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:31,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:31,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:31,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:31,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:31,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:31,981 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 127 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-03 21:04:31,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:31,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:31,982 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:31,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:31,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:31,982 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-03 21:04:31,994 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:04:31,994 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:04:32,018 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-03 21:04:32,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:32,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 21:04:32,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:32,142 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 91 proven. 42 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-03 21:04:32,142 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:32,290 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 91 proven. 42 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-03 21:04:32,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:32,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 27 [2019-09-03 21:04:32,293 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:32,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 21:04:32,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 21:04:32,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2019-09-03 21:04:32,295 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 20 states. [2019-09-03 21:04:32,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:32,444 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2019-09-03 21:04:32,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 21:04:32,445 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-09-03 21:04:32,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:32,447 INFO L225 Difference]: With dead ends: 45 [2019-09-03 21:04:32,447 INFO L226 Difference]: Without dead ends: 42 [2019-09-03 21:04:32,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=346, Invalid=914, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 21:04:32,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-03 21:04:32,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-03 21:04:32,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-03 21:04:32,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2019-09-03 21:04:32,454 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 36 [2019-09-03 21:04:32,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:32,454 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2019-09-03 21:04:32,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 21:04:32,455 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2019-09-03 21:04:32,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 21:04:32,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:32,456 INFO L399 BasicCegarLoop]: trace histogram [15, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:32,456 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:32,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:32,456 INFO L82 PathProgramCache]: Analyzing trace with hash -493481414, now seen corresponding path program 9 times [2019-09-03 21:04:32,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:32,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:32,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:32,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:32,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:32,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:32,558 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-03 21:04:32,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:32,559 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:32,559 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:32,559 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:32,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:32,559 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-03 21:04:32,577 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:04:32,577 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:04:32,616 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:04:32,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:32,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 21:04:32,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:32,728 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 56 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-03 21:04:32,728 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:32,900 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 56 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-03 21:04:32,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:32,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 30 [2019-09-03 21:04:32,903 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:32,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 21:04:32,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 21:04:32,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=657, Unknown=0, NotChecked=0, Total=870 [2019-09-03 21:04:32,905 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand 22 states. [2019-09-03 21:04:33,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:33,073 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2019-09-03 21:04:33,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 21:04:33,074 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2019-09-03 21:04:33,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:33,075 INFO L225 Difference]: With dead ends: 49 [2019-09-03 21:04:33,075 INFO L226 Difference]: Without dead ends: 46 [2019-09-03 21:04:33,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=437, Invalid=1123, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 21:04:33,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-03 21:04:33,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-09-03 21:04:33,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-03 21:04:33,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2019-09-03 21:04:33,080 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 40 [2019-09-03 21:04:33,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:33,081 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-09-03 21:04:33,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 21:04:33,081 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2019-09-03 21:04:33,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-03 21:04:33,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:33,082 INFO L399 BasicCegarLoop]: trace histogram [17, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:33,082 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:33,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:33,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1069809998, now seen corresponding path program 10 times [2019-09-03 21:04:33,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:33,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:33,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:33,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:33,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:33,207 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-03 21:04:33,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:33,208 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:33,208 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:33,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:33,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:33,208 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-03 21:04:33,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:33,223 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:04:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:33,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 21:04:33,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:33,361 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 153 proven. 72 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-03 21:04:33,361 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:33,566 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 153 proven. 72 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-03 21:04:33,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:33,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 33 [2019-09-03 21:04:33,573 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:33,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 21:04:33,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 21:04:33,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=795, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 21:04:33,577 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand 24 states. [2019-09-03 21:04:33,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:33,802 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2019-09-03 21:04:33,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 21:04:33,802 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2019-09-03 21:04:33,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:33,803 INFO L225 Difference]: With dead ends: 53 [2019-09-03 21:04:33,803 INFO L226 Difference]: Without dead ends: 50 [2019-09-03 21:04:33,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=539, Invalid=1353, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 21:04:33,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-03 21:04:33,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-09-03 21:04:33,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-03 21:04:33,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2019-09-03 21:04:33,811 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 44 [2019-09-03 21:04:33,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:33,813 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2019-09-03 21:04:33,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 21:04:33,813 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2019-09-03 21:04:33,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 21:04:33,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:33,816 INFO L399 BasicCegarLoop]: trace histogram [19, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:33,816 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:33,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:33,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1006069418, now seen corresponding path program 11 times [2019-09-03 21:04:33,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:33,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:33,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:33,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:33,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:33,970 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 271 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-03 21:04:33,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:33,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:33,971 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:33,971 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:33,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:33,971 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-03 21:04:33,987 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:04:33,987 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:04:34,016 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-03 21:04:34,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:34,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 21:04:34,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:34,293 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 190 proven. 90 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-03 21:04:34,294 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:34,486 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 190 proven. 90 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-03 21:04:34,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:34,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 36 [2019-09-03 21:04:34,489 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:34,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 21:04:34,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 21:04:34,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=946, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 21:04:34,490 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand 26 states. [2019-09-03 21:04:34,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:34,721 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2019-09-03 21:04:34,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 21:04:34,722 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2019-09-03 21:04:34,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:34,722 INFO L225 Difference]: With dead ends: 57 [2019-09-03 21:04:34,723 INFO L226 Difference]: Without dead ends: 54 [2019-09-03 21:04:34,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=652, Invalid=1604, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 21:04:34,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-03 21:04:34,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-09-03 21:04:34,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-03 21:04:34,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2019-09-03 21:04:34,730 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 48 [2019-09-03 21:04:34,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:34,730 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2019-09-03 21:04:34,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 21:04:34,730 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2019-09-03 21:04:34,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-03 21:04:34,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:34,731 INFO L399 BasicCegarLoop]: trace histogram [21, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:34,732 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:34,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:34,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1029614114, now seen corresponding path program 12 times [2019-09-03 21:04:34,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:34,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:34,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:34,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:34,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:34,902 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 331 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-09-03 21:04:34,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:34,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:34,903 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:34,903 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:34,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:34,903 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-03 21:04:34,914 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:04:34,914 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:04:34,936 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:04:34,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:34,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 21:04:34,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:35,093 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 231 proven. 110 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-03 21:04:35,093 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:35,309 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 231 proven. 110 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-03 21:04:35,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:35,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 39 [2019-09-03 21:04:35,313 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:35,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 21:04:35,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 21:04:35,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=1110, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 21:04:35,314 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand 28 states. [2019-09-03 21:04:35,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:35,541 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2019-09-03 21:04:35,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 21:04:35,542 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2019-09-03 21:04:35,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:35,543 INFO L225 Difference]: With dead ends: 61 [2019-09-03 21:04:35,543 INFO L226 Difference]: Without dead ends: 58 [2019-09-03 21:04:35,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=776, Invalid=1876, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 21:04:35,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-03 21:04:35,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-09-03 21:04:35,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-03 21:04:35,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2019-09-03 21:04:35,549 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 52 [2019-09-03 21:04:35,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:35,550 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2019-09-03 21:04:35,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 21:04:35,550 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2019-09-03 21:04:35,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-03 21:04:35,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:35,551 INFO L399 BasicCegarLoop]: trace histogram [23, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:35,551 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:35,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:35,552 INFO L82 PathProgramCache]: Analyzing trace with hash -900716262, now seen corresponding path program 13 times [2019-09-03 21:04:35,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:35,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:35,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:35,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:35,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:35,731 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 397 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-03 21:04:35,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:35,731 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:35,731 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:35,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:35,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:35,732 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-03 21:04:35,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:35,744 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:04:35,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:35,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 21:04:35,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:35,989 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 276 proven. 132 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 21:04:35,989 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:36,273 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 276 proven. 132 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 21:04:36,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:36,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 42 [2019-09-03 21:04:36,277 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:36,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 21:04:36,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 21:04:36,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1287, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 21:04:36,278 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand 30 states. [2019-09-03 21:04:36,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:36,560 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2019-09-03 21:04:36,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 21:04:36,561 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2019-09-03 21:04:36,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:36,562 INFO L225 Difference]: With dead ends: 65 [2019-09-03 21:04:36,562 INFO L226 Difference]: Without dead ends: 62 [2019-09-03 21:04:36,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=911, Invalid=2169, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 21:04:36,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-03 21:04:36,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-09-03 21:04:36,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-03 21:04:36,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2019-09-03 21:04:36,569 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 56 [2019-09-03 21:04:36,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:36,570 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2019-09-03 21:04:36,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 21:04:36,570 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2019-09-03 21:04:36,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-03 21:04:36,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:36,571 INFO L399 BasicCegarLoop]: trace histogram [25, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:36,571 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:36,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:36,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1693598610, now seen corresponding path program 14 times [2019-09-03 21:04:36,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:36,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:36,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:36,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:36,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:36,801 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 469 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-09-03 21:04:36,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:36,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:36,802 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:36,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:36,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:36,802 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) [2019-09-03 21:04:36,823 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:04:36,823 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:36,857 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-09-03 21:04:36,857 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:36,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 21:04:36,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:37,061 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 325 proven. 156 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 21:04:37,061 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:37,457 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 325 proven. 156 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 21:04:37,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:37,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 15] total 45 [2019-09-03 21:04:37,461 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:37,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 21:04:37,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 21:04:37,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=503, Invalid=1477, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 21:04:37,462 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. Second operand 32 states. [2019-09-03 21:04:37,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:37,790 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2019-09-03 21:04:37,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 21:04:37,791 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2019-09-03 21:04:37,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:37,792 INFO L225 Difference]: With dead ends: 69 [2019-09-03 21:04:37,792 INFO L226 Difference]: Without dead ends: 66 [2019-09-03 21:04:37,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1057, Invalid=2483, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 21:04:37,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-03 21:04:37,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-09-03 21:04:37,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-03 21:04:37,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2019-09-03 21:04:37,796 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 60 [2019-09-03 21:04:37,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:37,797 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2019-09-03 21:04:37,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 21:04:37,797 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2019-09-03 21:04:37,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-03 21:04:37,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:37,798 INFO L399 BasicCegarLoop]: trace histogram [27, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:37,798 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:37,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:37,798 INFO L82 PathProgramCache]: Analyzing trace with hash -374122102, now seen corresponding path program 15 times [2019-09-03 21:04:37,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:37,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:37,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:37,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:37,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:37,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:37,998 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 547 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-09-03 21:04:37,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:37,998 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:37,998 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:37,998 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:37,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:37,998 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-03 21:04:38,008 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:04:38,009 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:04:38,032 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:04:38,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:38,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 21:04:38,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:38,290 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 378 proven. 182 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-03 21:04:38,290 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:38,685 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 378 proven. 182 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-03 21:04:38,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:38,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 16] total 48 [2019-09-03 21:04:38,689 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:38,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 21:04:38,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 21:04:38,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=576, Invalid=1680, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 21:04:38,691 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. Second operand 34 states. [2019-09-03 21:04:38,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:38,977 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2019-09-03 21:04:38,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 21:04:38,978 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2019-09-03 21:04:38,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:38,979 INFO L225 Difference]: With dead ends: 73 [2019-09-03 21:04:38,979 INFO L226 Difference]: Without dead ends: 70 [2019-09-03 21:04:38,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1214, Invalid=2818, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 21:04:38,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-03 21:04:38,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-09-03 21:04:38,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-03 21:04:38,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2019-09-03 21:04:38,985 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 64 [2019-09-03 21:04:38,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:38,985 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2019-09-03 21:04:38,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 21:04:38,986 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2019-09-03 21:04:38,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-03 21:04:38,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:38,986 INFO L399 BasicCegarLoop]: trace histogram [29, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:38,987 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:38,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:38,987 INFO L82 PathProgramCache]: Analyzing trace with hash -313931006, now seen corresponding path program 16 times [2019-09-03 21:04:38,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:38,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:38,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:38,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:38,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:39,178 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 631 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-03 21:04:39,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:39,178 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:39,178 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:39,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:39,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:39,179 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-03 21:04:39,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:39,190 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:04:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:39,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 21:04:39,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:39,491 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 435 proven. 210 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-03 21:04:39,492 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:39,896 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 435 proven. 210 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-03 21:04:39,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:39,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 51 [2019-09-03 21:04:39,899 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:39,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 21:04:39,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 21:04:39,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=654, Invalid=1896, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 21:04:39,903 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand 36 states. [2019-09-03 21:04:40,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:40,204 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2019-09-03 21:04:40,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 21:04:40,204 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2019-09-03 21:04:40,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:40,205 INFO L225 Difference]: With dead ends: 77 [2019-09-03 21:04:40,206 INFO L226 Difference]: Without dead ends: 74 [2019-09-03 21:04:40,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1382, Invalid=3174, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 21:04:40,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-03 21:04:40,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-09-03 21:04:40,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-03 21:04:40,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2019-09-03 21:04:40,211 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 68 [2019-09-03 21:04:40,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:40,212 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2019-09-03 21:04:40,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 21:04:40,212 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2019-09-03 21:04:40,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-03 21:04:40,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:40,213 INFO L399 BasicCegarLoop]: trace histogram [31, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:40,213 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:40,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:40,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1699481606, now seen corresponding path program 17 times [2019-09-03 21:04:40,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:40,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:40,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:40,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:40,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:40,441 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 721 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-09-03 21:04:40,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:40,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:40,442 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:40,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:40,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:40,442 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-03 21:04:40,453 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:04:40,453 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:04:40,486 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-09-03 21:04:40,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:40,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 21:04:40,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:40,741 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 496 proven. 240 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-03 21:04:40,741 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:41,157 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 496 proven. 240 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-03 21:04:41,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:41,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 18] total 54 [2019-09-03 21:04:41,160 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:41,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 21:04:41,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 21:04:41,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=737, Invalid=2125, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 21:04:41,162 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 38 states. [2019-09-03 21:04:41,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:41,511 INFO L93 Difference]: Finished difference Result 81 states and 99 transitions. [2019-09-03 21:04:41,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-03 21:04:41,512 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2019-09-03 21:04:41,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:41,512 INFO L225 Difference]: With dead ends: 81 [2019-09-03 21:04:41,513 INFO L226 Difference]: Without dead ends: 78 [2019-09-03 21:04:41,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1561, Invalid=3551, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 21:04:41,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-03 21:04:41,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-09-03 21:04:41,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-03 21:04:41,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 96 transitions. [2019-09-03 21:04:41,520 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 96 transitions. Word has length 72 [2019-09-03 21:04:41,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:41,520 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 96 transitions. [2019-09-03 21:04:41,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 21:04:41,521 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 96 transitions. [2019-09-03 21:04:41,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-03 21:04:41,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:41,521 INFO L399 BasicCegarLoop]: trace histogram [33, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:41,522 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:41,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:41,522 INFO L82 PathProgramCache]: Analyzing trace with hash 288899186, now seen corresponding path program 18 times [2019-09-03 21:04:41,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:41,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:41,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:41,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:41,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:41,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 817 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-09-03 21:04:41,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:41,738 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:41,738 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:41,738 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:41,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:41,738 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-03 21:04:41,749 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:04:41,749 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:04:41,775 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:04:41,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:41,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 21:04:41,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:42,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 561 proven. 272 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-03 21:04:42,044 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:42,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 561 proven. 272 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-03 21:04:42,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:42,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 19] total 57 [2019-09-03 21:04:42,551 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:42,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-03 21:04:42,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-03 21:04:42,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=825, Invalid=2367, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 21:04:42,553 INFO L87 Difference]: Start difference. First operand 78 states and 96 transitions. Second operand 40 states. [2019-09-03 21:04:42,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:42,966 INFO L93 Difference]: Finished difference Result 85 states and 104 transitions. [2019-09-03 21:04:42,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-03 21:04:42,967 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2019-09-03 21:04:42,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:42,967 INFO L225 Difference]: With dead ends: 85 [2019-09-03 21:04:42,967 INFO L226 Difference]: Without dead ends: 82 [2019-09-03 21:04:42,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1751, Invalid=3949, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 21:04:42,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-03 21:04:42,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-09-03 21:04:42,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-03 21:04:42,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2019-09-03 21:04:42,973 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 76 [2019-09-03 21:04:42,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:42,973 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2019-09-03 21:04:42,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-03 21:04:42,973 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2019-09-03 21:04:42,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-03 21:04:42,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:42,975 INFO L399 BasicCegarLoop]: trace histogram [35, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:42,975 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:42,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:42,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1113916522, now seen corresponding path program 19 times [2019-09-03 21:04:42,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:42,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:42,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:42,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:42,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:42,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:43,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 919 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2019-09-03 21:04:43,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:43,208 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:43,208 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:43,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:43,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:43,208 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-03 21:04:43,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:43,223 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:04:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:43,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-03 21:04:43,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:43,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 630 proven. 306 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-03 21:04:43,558 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:44,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 630 proven. 306 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-03 21:04:44,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:44,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20, 20] total 60 [2019-09-03 21:04:44,088 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:44,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-03 21:04:44,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-03 21:04:44,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=918, Invalid=2622, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 21:04:44,090 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand 42 states. [2019-09-03 21:04:44,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:44,471 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2019-09-03 21:04:44,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-03 21:04:44,475 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2019-09-03 21:04:44,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:44,476 INFO L225 Difference]: With dead ends: 89 [2019-09-03 21:04:44,476 INFO L226 Difference]: Without dead ends: 86 [2019-09-03 21:04:44,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 926 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1952, Invalid=4368, Unknown=0, NotChecked=0, Total=6320 [2019-09-03 21:04:44,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-03 21:04:44,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-09-03 21:04:44,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-03 21:04:44,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 106 transitions. [2019-09-03 21:04:44,480 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 106 transitions. Word has length 80 [2019-09-03 21:04:44,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:44,480 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 106 transitions. [2019-09-03 21:04:44,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-03 21:04:44,480 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 106 transitions. [2019-09-03 21:04:44,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-03 21:04:44,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:44,481 INFO L399 BasicCegarLoop]: trace histogram [37, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:44,481 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:44,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:44,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1343267810, now seen corresponding path program 20 times [2019-09-03 21:04:44,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:44,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:44,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:44,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:44,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:44,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-09-03 21:04:44,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:44,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:44,771 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:44,772 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:44,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:44,772 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) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:44,805 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:04:44,805 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:04:44,872 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-09-03 21:04:44,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:44,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 21:04:44,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:45,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 703 proven. 342 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-09-03 21:04:45,288 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:45,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 703 proven. 342 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-09-03 21:04:45,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:45,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21, 21] total 63 [2019-09-03 21:04:45,888 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:45,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-03 21:04:45,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-03 21:04:45,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1016, Invalid=2890, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 21:04:45,890 INFO L87 Difference]: Start difference. First operand 86 states and 106 transitions. Second operand 44 states. [2019-09-03 21:04:46,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:46,313 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2019-09-03 21:04:46,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-03 21:04:46,313 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2019-09-03 21:04:46,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:46,314 INFO L225 Difference]: With dead ends: 93 [2019-09-03 21:04:46,314 INFO L226 Difference]: Without dead ends: 90 [2019-09-03 21:04:46,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2164, Invalid=4808, Unknown=0, NotChecked=0, Total=6972 [2019-09-03 21:04:46,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-03 21:04:46,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-09-03 21:04:46,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-03 21:04:46,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 111 transitions. [2019-09-03 21:04:46,319 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 111 transitions. Word has length 84 [2019-09-03 21:04:46,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:46,319 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 111 transitions. [2019-09-03 21:04:46,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-03 21:04:46,319 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2019-09-03 21:04:46,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-03 21:04:46,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:46,320 INFO L399 BasicCegarLoop]: trace histogram [39, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:46,321 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:46,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:46,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1784250074, now seen corresponding path program 21 times [2019-09-03 21:04:46,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:46,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:46,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:46,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:46,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:46,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1141 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-09-03 21:04:46,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:46,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:46,571 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:46,571 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:46,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:46,571 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-03 21:04:46,581 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:04:46,581 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:04:46,629 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:04:46,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:46,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 21:04:46,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:47,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 780 proven. 380 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-03 21:04:47,027 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:47,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 780 proven. 380 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-03 21:04:47,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:47,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22, 22] total 66 [2019-09-03 21:04:47,663 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:47,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-03 21:04:47,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-03 21:04:47,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1119, Invalid=3171, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 21:04:47,664 INFO L87 Difference]: Start difference. First operand 90 states and 111 transitions. Second operand 46 states. [2019-09-03 21:04:48,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:48,156 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2019-09-03 21:04:48,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-03 21:04:48,157 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2019-09-03 21:04:48,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:48,158 INFO L225 Difference]: With dead ends: 97 [2019-09-03 21:04:48,158 INFO L226 Difference]: Without dead ends: 94 [2019-09-03 21:04:48,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1129 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2387, Invalid=5269, Unknown=0, NotChecked=0, Total=7656 [2019-09-03 21:04:48,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-03 21:04:48,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-09-03 21:04:48,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-09-03 21:04:48,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 116 transitions. [2019-09-03 21:04:48,162 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 116 transitions. Word has length 88 [2019-09-03 21:04:48,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:48,162 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 116 transitions. [2019-09-03 21:04:48,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-03 21:04:48,162 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2019-09-03 21:04:48,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-03 21:04:48,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:48,163 INFO L399 BasicCegarLoop]: trace histogram [41, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:48,164 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:48,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:48,164 INFO L82 PathProgramCache]: Analyzing trace with hash 765850962, now seen corresponding path program 22 times [2019-09-03 21:04:48,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:48,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:48,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:48,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:48,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:48,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1261 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 21:04:48,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:48,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:48,429 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:48,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:48,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:48,429 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-03 21:04:48,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:48,439 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:04:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:48,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 21:04:48,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:48,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 861 proven. 420 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-03 21:04:48,875 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:49,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 861 proven. 420 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-03 21:04:49,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:49,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23, 23] total 69 [2019-09-03 21:04:49,571 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:49,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-03 21:04:49,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-03 21:04:49,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1227, Invalid=3465, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 21:04:49,572 INFO L87 Difference]: Start difference. First operand 94 states and 116 transitions. Second operand 48 states. [2019-09-03 21:04:50,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:50,030 INFO L93 Difference]: Finished difference Result 101 states and 124 transitions. [2019-09-03 21:04:50,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-03 21:04:50,030 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2019-09-03 21:04:50,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:50,031 INFO L225 Difference]: With dead ends: 101 [2019-09-03 21:04:50,031 INFO L226 Difference]: Without dead ends: 98 [2019-09-03 21:04:50,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1238 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2621, Invalid=5751, Unknown=0, NotChecked=0, Total=8372 [2019-09-03 21:04:50,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-03 21:04:50,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-09-03 21:04:50,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-09-03 21:04:50,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 121 transitions. [2019-09-03 21:04:50,036 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 121 transitions. Word has length 92 [2019-09-03 21:04:50,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:50,036 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 121 transitions. [2019-09-03 21:04:50,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-03 21:04:50,037 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 121 transitions. [2019-09-03 21:04:50,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-03 21:04:50,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:50,038 INFO L399 BasicCegarLoop]: trace histogram [43, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:50,038 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:50,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:50,038 INFO L82 PathProgramCache]: Analyzing trace with hash -2136709302, now seen corresponding path program 23 times [2019-09-03 21:04:50,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:50,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:50,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:50,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:50,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:50,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1387 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2019-09-03 21:04:50,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:50,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:50,327 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:50,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:50,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:50,327 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-03 21:04:50,337 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:04:50,337 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:04:50,384 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-09-03 21:04:50,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:50,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 21:04:50,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:50,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 946 proven. 462 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-09-03 21:04:50,820 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:51,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 946 proven. 462 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-09-03 21:04:51,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:51,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 24, 24] total 72 [2019-09-03 21:04:51,571 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:51,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-03 21:04:51,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-03 21:04:51,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1340, Invalid=3772, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 21:04:51,573 INFO L87 Difference]: Start difference. First operand 98 states and 121 transitions. Second operand 50 states. [2019-09-03 21:04:52,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:52,069 INFO L93 Difference]: Finished difference Result 105 states and 129 transitions. [2019-09-03 21:04:52,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-03 21:04:52,070 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2019-09-03 21:04:52,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:52,071 INFO L225 Difference]: With dead ends: 105 [2019-09-03 21:04:52,071 INFO L226 Difference]: Without dead ends: 102 [2019-09-03 21:04:52,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1352 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2866, Invalid=6254, Unknown=0, NotChecked=0, Total=9120 [2019-09-03 21:04:52,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-03 21:04:52,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-09-03 21:04:52,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-09-03 21:04:52,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 126 transitions. [2019-09-03 21:04:52,076 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 126 transitions. Word has length 96 [2019-09-03 21:04:52,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:52,076 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 126 transitions. [2019-09-03 21:04:52,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-03 21:04:52,076 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 126 transitions. [2019-09-03 21:04:52,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-03 21:04:52,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:52,077 INFO L399 BasicCegarLoop]: trace histogram [45, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:52,077 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:52,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:52,077 INFO L82 PathProgramCache]: Analyzing trace with hash -229952318, now seen corresponding path program 24 times [2019-09-03 21:04:52,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:52,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:52,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:52,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:52,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:52,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 1519 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-09-03 21:04:52,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:52,386 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:52,386 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:52,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:52,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:52,386 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-03 21:04:52,396 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:04:52,397 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:04:52,428 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:04:52,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:52,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 21:04:52,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:52,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 1035 proven. 506 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2019-09-03 21:04:52,887 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:53,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 1035 proven. 506 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2019-09-03 21:04:53,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:53,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 25, 25] total 75 [2019-09-03 21:04:53,801 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:53,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 21:04:53,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 21:04:53,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1458, Invalid=4092, Unknown=0, NotChecked=0, Total=5550 [2019-09-03 21:04:53,802 INFO L87 Difference]: Start difference. First operand 102 states and 126 transitions. Second operand 52 states. [2019-09-03 21:04:54,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:54,366 INFO L93 Difference]: Finished difference Result 109 states and 134 transitions. [2019-09-03 21:04:54,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-03 21:04:54,367 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2019-09-03 21:04:54,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:54,368 INFO L225 Difference]: With dead ends: 109 [2019-09-03 21:04:54,368 INFO L226 Difference]: Without dead ends: 106 [2019-09-03 21:04:54,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1471 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3122, Invalid=6778, Unknown=0, NotChecked=0, Total=9900 [2019-09-03 21:04:54,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-03 21:04:54,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-09-03 21:04:54,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-09-03 21:04:54,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 131 transitions. [2019-09-03 21:04:54,373 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 131 transitions. Word has length 100 [2019-09-03 21:04:54,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:54,373 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 131 transitions. [2019-09-03 21:04:54,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 21:04:54,373 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2019-09-03 21:04:54,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-03 21:04:54,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:54,374 INFO L399 BasicCegarLoop]: trace histogram [47, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:54,374 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:54,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:54,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1747403334, now seen corresponding path program 25 times [2019-09-03 21:04:54,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:54,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:54,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:54,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:54,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:54,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 1657 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2019-09-03 21:04:54,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:54,805 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:54,805 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:54,805 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:54,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:54,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 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-03 21:04:54,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:54,818 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:04:54,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:54,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-03 21:04:54,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:55,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 1128 proven. 552 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2019-09-03 21:04:55,408 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:56,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 1128 proven. 552 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2019-09-03 21:04:56,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:56,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26, 26] total 78 [2019-09-03 21:04:56,298 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:56,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-03 21:04:56,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-03 21:04:56,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1581, Invalid=4425, Unknown=0, NotChecked=0, Total=6006 [2019-09-03 21:04:56,300 INFO L87 Difference]: Start difference. First operand 106 states and 131 transitions. Second operand 54 states. [2019-09-03 21:04:56,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:56,887 INFO L93 Difference]: Finished difference Result 113 states and 139 transitions. [2019-09-03 21:04:56,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-03 21:04:56,888 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2019-09-03 21:04:56,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:56,889 INFO L225 Difference]: With dead ends: 113 [2019-09-03 21:04:56,889 INFO L226 Difference]: Without dead ends: 110 [2019-09-03 21:04:56,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1595 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3389, Invalid=7323, Unknown=0, NotChecked=0, Total=10712 [2019-09-03 21:04:56,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-03 21:04:56,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-09-03 21:04:56,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-03 21:04:56,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 136 transitions. [2019-09-03 21:04:56,893 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 136 transitions. Word has length 104 [2019-09-03 21:04:56,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:56,893 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 136 transitions. [2019-09-03 21:04:56,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-03 21:04:56,893 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 136 transitions. [2019-09-03 21:04:56,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-03 21:04:56,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:56,894 INFO L399 BasicCegarLoop]: trace histogram [49, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:56,894 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:56,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:56,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1792238130, now seen corresponding path program 26 times [2019-09-03 21:04:56,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:56,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:56,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:56,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:56,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:57,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 1801 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2019-09-03 21:04:57,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:57,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:57,366 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:57,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:57,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:57,367 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) [2019-09-03 21:04:57,393 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:04:57,394 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:57,470 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-09-03 21:04:57,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:57,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 21:04:57,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:58,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1225 proven. 600 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-09-03 21:04:58,005 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:59,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1225 proven. 600 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-09-03 21:04:59,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:59,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27, 27] total 81 [2019-09-03 21:04:59,059 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:59,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-03 21:04:59,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-03 21:04:59,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=4771, Unknown=0, NotChecked=0, Total=6480 [2019-09-03 21:04:59,061 INFO L87 Difference]: Start difference. First operand 110 states and 136 transitions. Second operand 56 states. [2019-09-03 21:04:59,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:59,662 INFO L93 Difference]: Finished difference Result 117 states and 144 transitions. [2019-09-03 21:04:59,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-03 21:04:59,663 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2019-09-03 21:04:59,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:59,664 INFO L225 Difference]: With dead ends: 117 [2019-09-03 21:04:59,664 INFO L226 Difference]: Without dead ends: 114 [2019-09-03 21:04:59,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1724 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3667, Invalid=7889, Unknown=0, NotChecked=0, Total=11556 [2019-09-03 21:04:59,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-03 21:04:59,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-09-03 21:04:59,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-09-03 21:04:59,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 141 transitions. [2019-09-03 21:04:59,669 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 141 transitions. Word has length 108 [2019-09-03 21:04:59,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:59,670 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 141 transitions. [2019-09-03 21:04:59,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-03 21:04:59,670 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 141 transitions. [2019-09-03 21:04:59,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-03 21:04:59,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:59,671 INFO L399 BasicCegarLoop]: trace histogram [51, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:59,671 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:59,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:59,671 INFO L82 PathProgramCache]: Analyzing trace with hash 654934570, now seen corresponding path program 27 times [2019-09-03 21:04:59,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:59,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:59,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:59,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:59,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:00,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 1951 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2019-09-03 21:05:00,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:00,067 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:00,068 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:00,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:00,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:00,068 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) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:05:00,078 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:05:00,079 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:05:00,111 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:05:00,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:05:00,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 21:05:00,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:00,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1326 proven. 650 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2019-09-03 21:05:00,697 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:01,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1326 proven. 650 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (28)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 21:05:01,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:01,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 28, 28] total 84 [2019-09-03 21:05:01,716 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:01,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-03 21:05:01,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-03 21:05:01,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1842, Invalid=5130, Unknown=0, NotChecked=0, Total=6972 [2019-09-03 21:05:01,718 INFO L87 Difference]: Start difference. First operand 114 states and 141 transitions. Second operand 58 states. [2019-09-03 21:05:02,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:02,401 INFO L93 Difference]: Finished difference Result 121 states and 149 transitions. [2019-09-03 21:05:02,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-03 21:05:02,401 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2019-09-03 21:05:02,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:02,402 INFO L225 Difference]: With dead ends: 121 [2019-09-03 21:05:02,402 INFO L226 Difference]: Without dead ends: 118 [2019-09-03 21:05:02,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1858 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3956, Invalid=8476, Unknown=0, NotChecked=0, Total=12432 [2019-09-03 21:05:02,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-03 21:05:02,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-09-03 21:05:02,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-03 21:05:02,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 146 transitions. [2019-09-03 21:05:02,407 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 146 transitions. Word has length 112 [2019-09-03 21:05:02,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:02,407 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 146 transitions. [2019-09-03 21:05:02,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-03 21:05:02,407 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 146 transitions. [2019-09-03 21:05:02,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-03 21:05:02,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:02,408 INFO L399 BasicCegarLoop]: trace histogram [53, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:02,408 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:02,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:02,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1466860126, now seen corresponding path program 28 times [2019-09-03 21:05:02,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:02,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:02,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:05:02,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:02,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:02,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2107 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2019-09-03 21:05:02,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:02,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:02,954 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:02,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:02,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:02,954 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) [2019-09-03 21:05:02,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:05:02,967 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:05:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:03,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 21:05:03,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:03,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 1431 proven. 702 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-09-03 21:05:03,614 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:04,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 1431 proven. 702 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-09-03 21:05:04,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:04,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 29, 29] total 87 [2019-09-03 21:05:04,744 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:04,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-03 21:05:04,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-03 21:05:04,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1980, Invalid=5502, Unknown=0, NotChecked=0, Total=7482 [2019-09-03 21:05:04,746 INFO L87 Difference]: Start difference. First operand 118 states and 146 transitions. Second operand 60 states. [2019-09-03 21:05:05,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:05,432 INFO L93 Difference]: Finished difference Result 125 states and 154 transitions. [2019-09-03 21:05:05,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-03 21:05:05,433 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 116 [2019-09-03 21:05:05,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:05,434 INFO L225 Difference]: With dead ends: 125 [2019-09-03 21:05:05,434 INFO L226 Difference]: Without dead ends: 122 [2019-09-03 21:05:05,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1997 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4256, Invalid=9084, Unknown=0, NotChecked=0, Total=13340 [2019-09-03 21:05:05,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-03 21:05:05,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-09-03 21:05:05,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-03 21:05:05,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 151 transitions. [2019-09-03 21:05:05,438 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 151 transitions. Word has length 116 [2019-09-03 21:05:05,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:05,438 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 151 transitions. [2019-09-03 21:05:05,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-03 21:05:05,438 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 151 transitions. [2019-09-03 21:05:05,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-03 21:05:05,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:05,439 INFO L399 BasicCegarLoop]: trace histogram [55, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:05,440 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:05,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:05,440 INFO L82 PathProgramCache]: Analyzing trace with hash -909527910, now seen corresponding path program 29 times [2019-09-03 21:05:05,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:05,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:05,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:05:05,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:05,443 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:05,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:05,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 2269 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2019-09-03 21:05:05,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:05,878 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:05,879 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:05,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:05,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:05,879 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-03 21:05:05,889 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:05:05,889 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:05:05,959 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2019-09-03 21:05:05,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:05:05,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 21:05:05,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:06,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1540 proven. 756 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-09-03 21:05:06,618 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:07,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1540 proven. 756 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-09-03 21:05:07,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:07,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 30, 30] total 90 [2019-09-03 21:05:07,816 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:07,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-03 21:05:07,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-03 21:05:07,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2123, Invalid=5887, Unknown=0, NotChecked=0, Total=8010 [2019-09-03 21:05:07,817 INFO L87 Difference]: Start difference. First operand 122 states and 151 transitions. Second operand 62 states. [2019-09-03 21:05:08,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:08,505 INFO L93 Difference]: Finished difference Result 129 states and 159 transitions. [2019-09-03 21:05:08,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-03 21:05:08,506 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2019-09-03 21:05:08,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:08,507 INFO L225 Difference]: With dead ends: 129 [2019-09-03 21:05:08,507 INFO L226 Difference]: Without dead ends: 126 [2019-09-03 21:05:08,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2141 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4567, Invalid=9713, Unknown=0, NotChecked=0, Total=14280 [2019-09-03 21:05:08,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-09-03 21:05:08,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2019-09-03 21:05:08,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-09-03 21:05:08,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 156 transitions. [2019-09-03 21:05:08,514 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 156 transitions. Word has length 120 [2019-09-03 21:05:08,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:08,514 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 156 transitions. [2019-09-03 21:05:08,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-03 21:05:08,514 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 156 transitions. [2019-09-03 21:05:08,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-03 21:05:08,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:08,515 INFO L399 BasicCegarLoop]: trace histogram [57, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:08,515 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:08,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:08,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1051162862, now seen corresponding path program 30 times [2019-09-03 21:05:08,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:08,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:08,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:05:08,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:08,517 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:09,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 2437 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2019-09-03 21:05:09,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:09,057 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:09,057 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:09,057 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:09,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:09,058 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-03 21:05:09,068 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:05:09,068 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:05:09,105 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:05:09,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:05:09,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 21:05:09,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:09,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1653 proven. 812 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-09-03 21:05:09,829 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:11,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1653 proven. 812 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-09-03 21:05:11,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:11,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 31, 31] total 93 [2019-09-03 21:05:11,115 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:11,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-03 21:05:11,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-03 21:05:11,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2271, Invalid=6285, Unknown=0, NotChecked=0, Total=8556 [2019-09-03 21:05:11,116 INFO L87 Difference]: Start difference. First operand 126 states and 156 transitions. Second operand 64 states. [2019-09-03 21:05:11,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:11,861 INFO L93 Difference]: Finished difference Result 133 states and 164 transitions. [2019-09-03 21:05:11,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-03 21:05:11,861 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2019-09-03 21:05:11,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:11,862 INFO L225 Difference]: With dead ends: 133 [2019-09-03 21:05:11,863 INFO L226 Difference]: Without dead ends: 130 [2019-09-03 21:05:11,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2290 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4889, Invalid=10363, Unknown=0, NotChecked=0, Total=15252 [2019-09-03 21:05:11,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-09-03 21:05:11,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-09-03 21:05:11,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-03 21:05:11,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 161 transitions. [2019-09-03 21:05:11,868 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 161 transitions. Word has length 124 [2019-09-03 21:05:11,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:11,868 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 161 transitions. [2019-09-03 21:05:11,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-03 21:05:11,869 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2019-09-03 21:05:11,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-03 21:05:11,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:11,869 INFO L399 BasicCegarLoop]: trace histogram [59, 30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:11,870 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:11,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:11,870 INFO L82 PathProgramCache]: Analyzing trace with hash 2905354, now seen corresponding path program 31 times [2019-09-03 21:05:11,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:11,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:11,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:05:11,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:11,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:12,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 2611 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2019-09-03 21:05:12,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:12,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:12,391 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:12,392 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:12,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:12,392 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-03 21:05:12,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:05:12,401 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:05:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:12,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-03 21:05:12,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:13,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1770 proven. 870 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2019-09-03 21:05:13,195 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:14,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1770 proven. 870 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2019-09-03 21:05:14,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:14,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 32, 32] total 96 [2019-09-03 21:05:14,545 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:14,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-03 21:05:14,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-03 21:05:14,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2424, Invalid=6696, Unknown=0, NotChecked=0, Total=9120 [2019-09-03 21:05:14,547 INFO L87 Difference]: Start difference. First operand 130 states and 161 transitions. Second operand 66 states. [2019-09-03 21:05:15,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:15,393 INFO L93 Difference]: Finished difference Result 137 states and 169 transitions. [2019-09-03 21:05:15,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-03 21:05:15,394 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2019-09-03 21:05:15,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:15,395 INFO L225 Difference]: With dead ends: 137 [2019-09-03 21:05:15,395 INFO L226 Difference]: Without dead ends: 134 [2019-09-03 21:05:15,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2444 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5222, Invalid=11034, Unknown=0, NotChecked=0, Total=16256 [2019-09-03 21:05:15,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-09-03 21:05:15,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-09-03 21:05:15,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-09-03 21:05:15,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 166 transitions. [2019-09-03 21:05:15,400 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 166 transitions. Word has length 128 [2019-09-03 21:05:15,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:15,400 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 166 transitions. [2019-09-03 21:05:15,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-03 21:05:15,400 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 166 transitions. [2019-09-03 21:05:15,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-03 21:05:15,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:15,401 INFO L399 BasicCegarLoop]: trace histogram [61, 31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:15,401 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:15,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:15,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1887732094, now seen corresponding path program 32 times [2019-09-03 21:05:15,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:15,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:15,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:05:15,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:15,403 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:15,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 2791 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2019-09-03 21:05:15,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:15,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:15,883 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:15,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:15,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:15,883 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) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:05:15,892 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:05:15,892 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:05:15,970 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 62 check-sat command(s) [2019-09-03 21:05:15,970 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:05:15,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 21:05:15,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:16,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1891 proven. 930 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2019-09-03 21:05:16,744 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:18,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1891 proven. 930 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2019-09-03 21:05:18,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:18,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 33, 33] total 99 [2019-09-03 21:05:18,196 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:18,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-03 21:05:18,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-03 21:05:18,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2582, Invalid=7120, Unknown=0, NotChecked=0, Total=9702 [2019-09-03 21:05:18,197 INFO L87 Difference]: Start difference. First operand 134 states and 166 transitions. Second operand 68 states. [2019-09-03 21:05:18,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:18,990 INFO L93 Difference]: Finished difference Result 141 states and 174 transitions. [2019-09-03 21:05:18,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-03 21:05:18,990 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2019-09-03 21:05:18,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:18,992 INFO L225 Difference]: With dead ends: 141 [2019-09-03 21:05:18,992 INFO L226 Difference]: Without dead ends: 138 [2019-09-03 21:05:18,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2603 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5566, Invalid=11726, Unknown=0, NotChecked=0, Total=17292 [2019-09-03 21:05:18,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-03 21:05:18,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2019-09-03 21:05:18,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-09-03 21:05:18,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 171 transitions. [2019-09-03 21:05:18,997 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 171 transitions. Word has length 132 [2019-09-03 21:05:18,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:18,997 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 171 transitions. [2019-09-03 21:05:18,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-03 21:05:18,997 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 171 transitions. [2019-09-03 21:05:18,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 21:05:18,998 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:18,998 INFO L399 BasicCegarLoop]: trace histogram [63, 32, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:18,998 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:18,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:18,999 INFO L82 PathProgramCache]: Analyzing trace with hash -289119366, now seen corresponding path program 33 times [2019-09-03 21:05:18,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:18,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:19,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:05:19,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:19,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:19,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:19,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 2977 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2019-09-03 21:05:19,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:19,506 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:19,506 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:19,506 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:19,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:19,506 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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:05:19,516 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:05:19,516 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:05:19,561 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:05:19,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:05:19,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 21:05:19,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:20,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 2016 proven. 992 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2019-09-03 21:05:20,449 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:22,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 2016 proven. 992 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2019-09-03 21:05:22,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:22,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 34, 34] total 102 [2019-09-03 21:05:22,047 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:22,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-03 21:05:22,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-03 21:05:22,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2745, Invalid=7557, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 21:05:22,049 INFO L87 Difference]: Start difference. First operand 138 states and 171 transitions. Second operand 70 states. [2019-09-03 21:05:22,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:22,872 INFO L93 Difference]: Finished difference Result 145 states and 179 transitions. [2019-09-03 21:05:22,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-03 21:05:22,873 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2019-09-03 21:05:22,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:22,873 INFO L225 Difference]: With dead ends: 145 [2019-09-03 21:05:22,873 INFO L226 Difference]: Without dead ends: 142 [2019-09-03 21:05:22,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2767 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5921, Invalid=12439, Unknown=0, NotChecked=0, Total=18360 [2019-09-03 21:05:22,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-09-03 21:05:22,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2019-09-03 21:05:22,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-09-03 21:05:22,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 176 transitions. [2019-09-03 21:05:22,878 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 176 transitions. Word has length 136 [2019-09-03 21:05:22,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:22,879 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 176 transitions. [2019-09-03 21:05:22,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-03 21:05:22,879 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 176 transitions. [2019-09-03 21:05:22,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-03 21:05:22,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:22,880 INFO L399 BasicCegarLoop]: trace histogram [65, 33, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:22,880 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:22,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:22,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1909285874, now seen corresponding path program 34 times [2019-09-03 21:05:22,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:22,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:22,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:05:22,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:22,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:23,400 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 3169 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-09-03 21:05:23,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:23,400 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:23,400 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:23,400 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:23,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:23,400 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:05:23,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:05:23,410 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:05:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:23,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 21:05:23,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:24,335 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 2145 proven. 1056 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2019-09-03 21:05:24,336 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:25,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 2145 proven. 1056 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2019-09-03 21:05:25,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:25,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 35, 35] total 105 [2019-09-03 21:05:25,963 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:25,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-03 21:05:25,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-03 21:05:25,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2913, Invalid=8007, Unknown=0, NotChecked=0, Total=10920 [2019-09-03 21:05:25,965 INFO L87 Difference]: Start difference. First operand 142 states and 176 transitions. Second operand 72 states. [2019-09-03 21:05:26,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:26,837 INFO L93 Difference]: Finished difference Result 149 states and 184 transitions. [2019-09-03 21:05:26,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-03 21:05:26,837 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 140 [2019-09-03 21:05:26,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:26,838 INFO L225 Difference]: With dead ends: 149 [2019-09-03 21:05:26,839 INFO L226 Difference]: Without dead ends: 146 [2019-09-03 21:05:26,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2936 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=6287, Invalid=13173, Unknown=0, NotChecked=0, Total=19460 [2019-09-03 21:05:26,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-09-03 21:05:26,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-09-03 21:05:26,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-09-03 21:05:26,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 181 transitions. [2019-09-03 21:05:26,845 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 181 transitions. Word has length 140 [2019-09-03 21:05:26,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:26,846 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 181 transitions. [2019-09-03 21:05:26,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-03 21:05:26,847 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 181 transitions. [2019-09-03 21:05:26,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 21:05:26,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:26,848 INFO L399 BasicCegarLoop]: trace histogram [67, 34, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:26,848 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:26,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:26,848 INFO L82 PathProgramCache]: Analyzing trace with hash 514121706, now seen corresponding path program 35 times [2019-09-03 21:05:26,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:26,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:26,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:05:26,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:26,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:27,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 3367 refuted. 0 times theorem prover too weak. 1122 trivial. 0 not checked. [2019-09-03 21:05:27,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:27,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:27,427 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:27,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:27,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:27,427 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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:05:27,437 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:05:27,437 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:05:27,518 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 68 check-sat command(s) [2019-09-03 21:05:27,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:05:27,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-03 21:05:27,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:28,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 2278 proven. 1122 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-09-03 21:05:28,449 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:30,136 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 2278 proven. 1122 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-09-03 21:05:30,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:30,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 36, 36] total 108 [2019-09-03 21:05:30,141 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:30,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-03 21:05:30,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-03 21:05:30,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3086, Invalid=8470, Unknown=0, NotChecked=0, Total=11556 [2019-09-03 21:05:30,143 INFO L87 Difference]: Start difference. First operand 146 states and 181 transitions. Second operand 74 states. [2019-09-03 21:05:31,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:31,124 INFO L93 Difference]: Finished difference Result 153 states and 189 transitions. [2019-09-03 21:05:31,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-03 21:05:31,124 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2019-09-03 21:05:31,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:31,125 INFO L225 Difference]: With dead ends: 153 [2019-09-03 21:05:31,125 INFO L226 Difference]: Without dead ends: 150 [2019-09-03 21:05:31,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3110 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=6664, Invalid=13928, Unknown=0, NotChecked=0, Total=20592 [2019-09-03 21:05:31,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-03 21:05:31,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2019-09-03 21:05:31,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-03 21:05:31,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 186 transitions. [2019-09-03 21:05:31,130 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 186 transitions. Word has length 144 [2019-09-03 21:05:31,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:31,130 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 186 transitions. [2019-09-03 21:05:31,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-03 21:05:31,130 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 186 transitions. [2019-09-03 21:05:31,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-03 21:05:31,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:31,131 INFO L399 BasicCegarLoop]: trace histogram [69, 35, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:31,131 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:31,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:31,132 INFO L82 PathProgramCache]: Analyzing trace with hash 195114850, now seen corresponding path program 36 times [2019-09-03 21:05:31,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:31,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:31,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:05:31,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:31,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:31,786 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 3571 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2019-09-03 21:05:31,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:31,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:31,786 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:31,786 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:31,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:31,787 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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:05:31,799 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:05:31,799 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:05:31,843 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:05:31,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:05:31,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 21:05:31,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:32,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 2415 proven. 1190 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2019-09-03 21:05:32,871 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:34,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 2415 proven. 1190 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2019-09-03 21:05:34,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:34,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 37, 37] total 111 [2019-09-03 21:05:34,666 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:34,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-03 21:05:34,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-03 21:05:34,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3264, Invalid=8946, Unknown=0, NotChecked=0, Total=12210 [2019-09-03 21:05:34,668 INFO L87 Difference]: Start difference. First operand 150 states and 186 transitions. Second operand 76 states. [2019-09-03 21:05:35,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:35,669 INFO L93 Difference]: Finished difference Result 157 states and 194 transitions. [2019-09-03 21:05:35,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-03 21:05:35,670 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148 [2019-09-03 21:05:35,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:35,671 INFO L225 Difference]: With dead ends: 157 [2019-09-03 21:05:35,671 INFO L226 Difference]: Without dead ends: 154 [2019-09-03 21:05:35,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3289 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=7052, Invalid=14704, Unknown=0, NotChecked=0, Total=21756 [2019-09-03 21:05:35,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-09-03 21:05:35,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-09-03 21:05:35,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-09-03 21:05:35,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 191 transitions. [2019-09-03 21:05:35,677 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 191 transitions. Word has length 148 [2019-09-03 21:05:35,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:35,677 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 191 transitions. [2019-09-03 21:05:35,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-03 21:05:35,677 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 191 transitions. [2019-09-03 21:05:35,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 21:05:35,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:35,678 INFO L399 BasicCegarLoop]: trace histogram [71, 36, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:35,679 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:35,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:35,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1029753434, now seen corresponding path program 37 times [2019-09-03 21:05:35,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:35,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:35,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:05:35,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:35,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:35,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:36,551 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 3781 refuted. 0 times theorem prover too weak. 1260 trivial. 0 not checked. [2019-09-03 21:05:36,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:36,552 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:36,552 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:36,552 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:36,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:36,552 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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:05:36,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:05:36,563 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:05:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:36,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-03 21:05:36,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:37,634 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2556 proven. 1260 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-09-03 21:05:37,634 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:39,650 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2556 proven. 1260 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-09-03 21:05:39,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:39,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 38, 38] total 114 [2019-09-03 21:05:39,653 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:39,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-03 21:05:39,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-03 21:05:39,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3447, Invalid=9435, Unknown=0, NotChecked=0, Total=12882 [2019-09-03 21:05:39,656 INFO L87 Difference]: Start difference. First operand 154 states and 191 transitions. Second operand 78 states. [2019-09-03 21:05:40,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:40,673 INFO L93 Difference]: Finished difference Result 161 states and 199 transitions. [2019-09-03 21:05:40,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-03 21:05:40,674 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2019-09-03 21:05:40,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:40,675 INFO L225 Difference]: With dead ends: 161 [2019-09-03 21:05:40,675 INFO L226 Difference]: Without dead ends: 158 [2019-09-03 21:05:40,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3473 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7451, Invalid=15501, Unknown=0, NotChecked=0, Total=22952 [2019-09-03 21:05:40,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-09-03 21:05:40,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2019-09-03 21:05:40,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-09-03 21:05:40,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 196 transitions. [2019-09-03 21:05:40,680 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 196 transitions. Word has length 152 [2019-09-03 21:05:40,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:40,681 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 196 transitions. [2019-09-03 21:05:40,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-03 21:05:40,681 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 196 transitions. [2019-09-03 21:05:40,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-03 21:05:40,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:40,682 INFO L399 BasicCegarLoop]: trace histogram [73, 37, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:40,682 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:40,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:40,682 INFO L82 PathProgramCache]: Analyzing trace with hash 80345298, now seen corresponding path program 38 times [2019-09-03 21:05:40,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:40,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:40,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:05:40,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:40,684 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:40,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:41,332 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 3997 refuted. 0 times theorem prover too weak. 1332 trivial. 0 not checked. [2019-09-03 21:05:41,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:41,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:41,333 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:41,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:41,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:41,333 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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:05:41,344 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:05:41,344 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:05:41,430 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 74 check-sat command(s) [2019-09-03 21:05:41,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:05:41,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 21:05:41,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:42,527 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 2701 proven. 1332 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [2019-09-03 21:05:42,527 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:44,512 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 2701 proven. 1332 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [2019-09-03 21:05:44,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:44,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 39, 39] total 117 [2019-09-03 21:05:44,515 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:44,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-03 21:05:44,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-03 21:05:44,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3635, Invalid=9937, Unknown=0, NotChecked=0, Total=13572 [2019-09-03 21:05:44,517 INFO L87 Difference]: Start difference. First operand 158 states and 196 transitions. Second operand 80 states. [2019-09-03 21:05:45,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:45,845 INFO L93 Difference]: Finished difference Result 165 states and 204 transitions. [2019-09-03 21:05:45,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-03 21:05:45,845 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156 [2019-09-03 21:05:45,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:45,847 INFO L225 Difference]: With dead ends: 165 [2019-09-03 21:05:45,847 INFO L226 Difference]: Without dead ends: 162 [2019-09-03 21:05:45,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3662 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7861, Invalid=16319, Unknown=0, NotChecked=0, Total=24180 [2019-09-03 21:05:45,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-03 21:05:45,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2019-09-03 21:05:45,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-09-03 21:05:45,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 201 transitions. [2019-09-03 21:05:45,854 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 201 transitions. Word has length 156 [2019-09-03 21:05:45,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:45,855 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 201 transitions. [2019-09-03 21:05:45,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-03 21:05:45,855 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 201 transitions. [2019-09-03 21:05:45,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-03 21:05:45,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:45,856 INFO L399 BasicCegarLoop]: trace histogram [75, 38, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:45,856 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:45,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:45,857 INFO L82 PathProgramCache]: Analyzing trace with hash -586472758, now seen corresponding path program 39 times [2019-09-03 21:05:45,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:45,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:45,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:05:45,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:45,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:46,696 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 4219 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2019-09-03 21:05:46,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:46,696 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:46,696 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:46,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:46,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:46,697 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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:05:46,706 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:05:46,707 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:05:46,756 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:05:46,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:05:46,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-03 21:05:46,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:48,445 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2850 proven. 1406 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2019-09-03 21:05:48,445 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:50,580 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2850 proven. 1406 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2019-09-03 21:05:50,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:50,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 40, 40] total 120 [2019-09-03 21:05:50,583 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:50,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-03 21:05:50,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-03 21:05:50,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=10452, Unknown=0, NotChecked=0, Total=14280 [2019-09-03 21:05:50,586 INFO L87 Difference]: Start difference. First operand 162 states and 201 transitions. Second operand 82 states. [2019-09-03 21:05:52,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:52,001 INFO L93 Difference]: Finished difference Result 169 states and 209 transitions. [2019-09-03 21:05:52,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-03 21:05:52,001 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2019-09-03 21:05:52,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:52,003 INFO L225 Difference]: With dead ends: 169 [2019-09-03 21:05:52,003 INFO L226 Difference]: Without dead ends: 166 [2019-09-03 21:05:52,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3856 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8282, Invalid=17158, Unknown=0, NotChecked=0, Total=25440 [2019-09-03 21:05:52,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-09-03 21:05:52,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2019-09-03 21:05:52,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-09-03 21:05:52,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 206 transitions. [2019-09-03 21:05:52,010 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 206 transitions. Word has length 160 [2019-09-03 21:05:52,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:52,010 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 206 transitions. [2019-09-03 21:05:52,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-03 21:05:52,011 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 206 transitions. [2019-09-03 21:05:52,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-03 21:05:52,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:52,013 INFO L399 BasicCegarLoop]: trace histogram [77, 39, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:52,013 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:52,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:52,013 INFO L82 PathProgramCache]: Analyzing trace with hash -912611262, now seen corresponding path program 40 times [2019-09-03 21:05:52,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:52,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:52,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:05:52,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:52,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:52,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:52,804 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 4447 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2019-09-03 21:05:52,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:52,804 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:52,804 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:52,804 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:52,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:52,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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:05:52,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:05:52,814 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:05:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:52,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 21:05:52,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:54,059 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 3003 proven. 1482 refuted. 0 times theorem prover too weak. 1444 trivial. 0 not checked. [2019-09-03 21:05:54,059 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:56,238 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 3003 proven. 1482 refuted. 0 times theorem prover too weak. 1444 trivial. 0 not checked. [2019-09-03 21:05:56,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:56,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 41, 41] total 123 [2019-09-03 21:05:56,241 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:56,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-09-03 21:05:56,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-09-03 21:05:56,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4026, Invalid=10980, Unknown=0, NotChecked=0, Total=15006 [2019-09-03 21:05:56,242 INFO L87 Difference]: Start difference. First operand 166 states and 206 transitions. Second operand 84 states. [2019-09-03 21:05:57,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:57,411 INFO L93 Difference]: Finished difference Result 173 states and 214 transitions. [2019-09-03 21:05:57,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-03 21:05:57,412 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 164 [2019-09-03 21:05:57,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:57,413 INFO L225 Difference]: With dead ends: 173 [2019-09-03 21:05:57,413 INFO L226 Difference]: Without dead ends: 170 [2019-09-03 21:05:57,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4055 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=8714, Invalid=18018, Unknown=0, NotChecked=0, Total=26732 [2019-09-03 21:05:57,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-03 21:05:57,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2019-09-03 21:05:57,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-03 21:05:57,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 211 transitions. [2019-09-03 21:05:57,418 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 211 transitions. Word has length 164 [2019-09-03 21:05:57,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:57,419 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 211 transitions. [2019-09-03 21:05:57,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-09-03 21:05:57,419 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 211 transitions. [2019-09-03 21:05:57,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-03 21:05:57,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:57,420 INFO L399 BasicCegarLoop]: trace histogram [79, 40, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:57,420 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:57,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:57,421 INFO L82 PathProgramCache]: Analyzing trace with hash 876013882, now seen corresponding path program 41 times [2019-09-03 21:05:57,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:57,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:57,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:05:57,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:57,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:58,251 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 4681 refuted. 0 times theorem prover too weak. 1560 trivial. 0 not checked. [2019-09-03 21:05:58,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:58,251 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:58,252 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:58,252 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:58,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:58,252 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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:05:58,262 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:05:58,262 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:05:58,361 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 80 check-sat command(s) [2019-09-03 21:05:58,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:05:58,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 21:05:58,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:59,594 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 3160 proven. 1560 refuted. 0 times theorem prover too weak. 1521 trivial. 0 not checked. [2019-09-03 21:05:59,595 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:06:01,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 3160 proven. 1560 refuted. 0 times theorem prover too weak. 1521 trivial. 0 not checked. [2019-09-03 21:06:01,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:06:01,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 42, 42] total 126 [2019-09-03 21:06:01,920 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:06:01,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-09-03 21:06:01,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-09-03 21:06:01,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4229, Invalid=11521, Unknown=0, NotChecked=0, Total=15750 [2019-09-03 21:06:01,922 INFO L87 Difference]: Start difference. First operand 170 states and 211 transitions. Second operand 86 states. [2019-09-03 21:06:03,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:06:03,154 INFO L93 Difference]: Finished difference Result 177 states and 219 transitions. [2019-09-03 21:06:03,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-03 21:06:03,154 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168 [2019-09-03 21:06:03,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:06:03,155 INFO L225 Difference]: With dead ends: 177 [2019-09-03 21:06:03,155 INFO L226 Difference]: Without dead ends: 174 [2019-09-03 21:06:03,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4259 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=9157, Invalid=18899, Unknown=0, NotChecked=0, Total=28056 [2019-09-03 21:06:03,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-03 21:06:03,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2019-09-03 21:06:03,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-09-03 21:06:03,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 216 transitions. [2019-09-03 21:06:03,160 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 216 transitions. Word has length 168 [2019-09-03 21:06:03,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:06:03,161 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 216 transitions. [2019-09-03 21:06:03,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-09-03 21:06:03,161 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 216 transitions. [2019-09-03 21:06:03,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-03 21:06:03,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:06:03,162 INFO L399 BasicCegarLoop]: trace histogram [81, 41, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:06:03,162 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:06:03,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:06:03,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1256605106, now seen corresponding path program 42 times [2019-09-03 21:06:03,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:06:03,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:03,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:06:03,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:03,164 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:06:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:03,920 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 4921 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-03 21:06:03,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:03,920 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:06:03,920 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:06:03,920 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:06:03,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:03,920 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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:06:03,931 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:06:03,931 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:06:03,982 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:06:03,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:06:03,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 21:06:03,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:06:05,278 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 3321 proven. 1640 refuted. 0 times theorem prover too weak. 1600 trivial. 0 not checked. [2019-09-03 21:06:05,278 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:06:07,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 3321 proven. 1640 refuted. 0 times theorem prover too weak. 1600 trivial. 0 not checked. [2019-09-03 21:06:07,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:06:07,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 43, 43] total 129 [2019-09-03 21:06:07,705 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:06:07,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-03 21:06:07,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-03 21:06:07,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4437, Invalid=12075, Unknown=0, NotChecked=0, Total=16512 [2019-09-03 21:06:07,706 INFO L87 Difference]: Start difference. First operand 174 states and 216 transitions. Second operand 88 states. [2019-09-03 21:06:09,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:06:09,022 INFO L93 Difference]: Finished difference Result 181 states and 224 transitions. [2019-09-03 21:06:09,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-03 21:06:09,022 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 172 [2019-09-03 21:06:09,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:06:09,023 INFO L225 Difference]: With dead ends: 181 [2019-09-03 21:06:09,023 INFO L226 Difference]: Without dead ends: 178 [2019-09-03 21:06:09,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4468 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=9611, Invalid=19801, Unknown=0, NotChecked=0, Total=29412 [2019-09-03 21:06:09,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-03 21:06:09,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2019-09-03 21:06:09,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-03 21:06:09,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 221 transitions. [2019-09-03 21:06:09,029 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 221 transitions. Word has length 172 [2019-09-03 21:06:09,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:06:09,029 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 221 transitions. [2019-09-03 21:06:09,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-03 21:06:09,029 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 221 transitions. [2019-09-03 21:06:09,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-03 21:06:09,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:06:09,031 INFO L399 BasicCegarLoop]: trace histogram [83, 42, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:06:09,031 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:06:09,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:06:09,031 INFO L82 PathProgramCache]: Analyzing trace with hash -571007574, now seen corresponding path program 43 times [2019-09-03 21:06:09,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:06:09,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:09,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:06:09,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:09,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:06:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:10,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 5167 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2019-09-03 21:06:10,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:10,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:06:10,263 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:06:10,263 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:06:10,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:10,263 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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 21:06:10,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:06:10,279 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:06:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:10,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-03 21:06:10,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:06:11,706 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 3486 proven. 1722 refuted. 0 times theorem prover too weak. 1681 trivial. 0 not checked. [2019-09-03 21:06:11,706 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:06:14,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 3486 proven. 1722 refuted. 0 times theorem prover too weak. 1681 trivial. 0 not checked. [2019-09-03 21:06:14,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:06:14,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 44, 44] total 132 [2019-09-03 21:06:14,309 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:06:14,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-09-03 21:06:14,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-09-03 21:06:14,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4650, Invalid=12642, Unknown=0, NotChecked=0, Total=17292 [2019-09-03 21:06:14,311 INFO L87 Difference]: Start difference. First operand 178 states and 221 transitions. Second operand 90 states. [2019-09-03 21:06:15,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:06:15,679 INFO L93 Difference]: Finished difference Result 185 states and 229 transitions. [2019-09-03 21:06:15,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-03 21:06:15,679 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 176 [2019-09-03 21:06:15,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:06:15,680 INFO L225 Difference]: With dead ends: 185 [2019-09-03 21:06:15,680 INFO L226 Difference]: Without dead ends: 182 [2019-09-03 21:06:15,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4682 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=10076, Invalid=20724, Unknown=0, NotChecked=0, Total=30800 [2019-09-03 21:06:15,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-03 21:06:15,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2019-09-03 21:06:15,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-09-03 21:06:15,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 226 transitions. [2019-09-03 21:06:15,684 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 226 transitions. Word has length 176 [2019-09-03 21:06:15,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:06:15,684 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 226 transitions. [2019-09-03 21:06:15,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-09-03 21:06:15,684 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 226 transitions. [2019-09-03 21:06:15,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-03 21:06:15,685 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:06:15,685 INFO L399 BasicCegarLoop]: trace histogram [85, 43, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:06:15,685 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:06:15,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:06:15,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1107308254, now seen corresponding path program 44 times [2019-09-03 21:06:15,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:06:15,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:15,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:06:15,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:15,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:06:15,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:16,680 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 5419 refuted. 0 times theorem prover too weak. 1806 trivial. 0 not checked. [2019-09-03 21:06:16,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:16,680 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:06:16,680 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:06:16,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:06:16,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:16,680 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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:06:16,690 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:06:16,691 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:06:16,802 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 86 check-sat command(s) [2019-09-03 21:06:16,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:06:16,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 21:06:16,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:06:18,296 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 3655 proven. 1806 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2019-09-03 21:06:18,297 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:06:20,946 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 3655 proven. 1806 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2019-09-03 21:06:20,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:06:20,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 45, 45] total 135 [2019-09-03 21:06:20,950 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:06:20,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-09-03 21:06:20,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-09-03 21:06:20,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4868, Invalid=13222, Unknown=0, NotChecked=0, Total=18090 [2019-09-03 21:06:20,952 INFO L87 Difference]: Start difference. First operand 182 states and 226 transitions. Second operand 92 states. [2019-09-03 21:06:22,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:06:22,306 INFO L93 Difference]: Finished difference Result 189 states and 234 transitions. [2019-09-03 21:06:22,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-03 21:06:22,306 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 180 [2019-09-03 21:06:22,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:06:22,307 INFO L225 Difference]: With dead ends: 189 [2019-09-03 21:06:22,308 INFO L226 Difference]: Without dead ends: 186 [2019-09-03 21:06:22,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4901 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=10552, Invalid=21668, Unknown=0, NotChecked=0, Total=32220 [2019-09-03 21:06:22,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-03 21:06:22,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-09-03 21:06:22,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-09-03 21:06:22,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 231 transitions. [2019-09-03 21:06:22,313 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 231 transitions. Word has length 180 [2019-09-03 21:06:22,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:06:22,313 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 231 transitions. [2019-09-03 21:06:22,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-09-03 21:06:22,313 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 231 transitions. [2019-09-03 21:06:22,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-03 21:06:22,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:06:22,314 INFO L399 BasicCegarLoop]: trace histogram [87, 44, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:06:22,314 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:06:22,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:06:22,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1713455078, now seen corresponding path program 45 times [2019-09-03 21:06:22,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:06:22,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:22,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:06:22,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:22,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:06:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:23,707 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 5677 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2019-09-03 21:06:23,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:23,708 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:06:23,708 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:06:23,708 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:06:23,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:23,709 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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:06:23,718 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:06:23,718 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:06:23,773 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:06:23,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:06:23,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-03 21:06:23,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:06:25,383 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 3828 proven. 1892 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2019-09-03 21:06:25,383 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:06:28,383 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 3828 proven. 1892 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2019-09-03 21:06:28,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:06:28,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 46, 46] total 138 [2019-09-03 21:06:28,387 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:06:28,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-09-03 21:06:28,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-09-03 21:06:28,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5091, Invalid=13815, Unknown=0, NotChecked=0, Total=18906 [2019-09-03 21:06:28,388 INFO L87 Difference]: Start difference. First operand 186 states and 231 transitions. Second operand 94 states. [2019-09-03 21:06:29,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:06:29,814 INFO L93 Difference]: Finished difference Result 193 states and 239 transitions. [2019-09-03 21:06:29,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-03 21:06:29,814 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 184 [2019-09-03 21:06:29,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:06:29,815 INFO L225 Difference]: With dead ends: 193 [2019-09-03 21:06:29,815 INFO L226 Difference]: Without dead ends: 190 [2019-09-03 21:06:29,817 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5125 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=11039, Invalid=22633, Unknown=0, NotChecked=0, Total=33672 [2019-09-03 21:06:29,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-09-03 21:06:29,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2019-09-03 21:06:29,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 21:06:29,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 236 transitions. [2019-09-03 21:06:29,821 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 236 transitions. Word has length 184 [2019-09-03 21:06:29,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:06:29,821 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 236 transitions. [2019-09-03 21:06:29,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-09-03 21:06:29,821 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 236 transitions. [2019-09-03 21:06:29,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-03 21:06:29,822 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:06:29,822 INFO L399 BasicCegarLoop]: trace histogram [89, 45, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:06:29,823 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:06:29,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:06:29,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1555712658, now seen corresponding path program 46 times [2019-09-03 21:06:29,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:06:29,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:29,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:06:29,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:29,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:06:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:31,097 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 5941 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2019-09-03 21:06:31,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:31,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:06:31,098 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:06:31,098 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:06:31,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:31,098 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 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:06:31,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:06:31,108 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:06:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:31,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 21:06:31,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:06:32,685 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 4005 proven. 1980 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-09-03 21:06:32,686 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:06:35,566 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 4005 proven. 1980 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-09-03 21:06:35,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:06:35,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 47, 47] total 141 [2019-09-03 21:06:35,570 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:06:35,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-09-03 21:06:35,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-09-03 21:06:35,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5319, Invalid=14421, Unknown=0, NotChecked=0, Total=19740 [2019-09-03 21:06:35,571 INFO L87 Difference]: Start difference. First operand 190 states and 236 transitions. Second operand 96 states. [2019-09-03 21:06:37,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:06:37,095 INFO L93 Difference]: Finished difference Result 197 states and 244 transitions. [2019-09-03 21:06:37,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-03 21:06:37,095 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 188 [2019-09-03 21:06:37,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:06:37,096 INFO L225 Difference]: With dead ends: 197 [2019-09-03 21:06:37,097 INFO L226 Difference]: Without dead ends: 194 [2019-09-03 21:06:37,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5354 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=11537, Invalid=23619, Unknown=0, NotChecked=0, Total=35156 [2019-09-03 21:06:37,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-09-03 21:06:37,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2019-09-03 21:06:37,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-03 21:06:37,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 241 transitions. [2019-09-03 21:06:37,102 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 241 transitions. Word has length 188 [2019-09-03 21:06:37,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:06:37,103 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 241 transitions. [2019-09-03 21:06:37,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-09-03 21:06:37,103 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 241 transitions. [2019-09-03 21:06:37,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-03 21:06:37,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:06:37,104 INFO L399 BasicCegarLoop]: trace histogram [91, 46, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:06:37,104 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:06:37,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:06:37,104 INFO L82 PathProgramCache]: Analyzing trace with hash 201379978, now seen corresponding path program 47 times [2019-09-03 21:06:37,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:06:37,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:37,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:06:37,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:37,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:06:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:38,046 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6211 refuted. 0 times theorem prover too weak. 2070 trivial. 0 not checked. [2019-09-03 21:06:38,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:38,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:06:38,046 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:06:38,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:06:38,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:38,046 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 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:06:38,056 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:06:38,056 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:06:38,175 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 92 check-sat command(s) [2019-09-03 21:06:38,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:06:38,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-03 21:06:38,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:06:39,811 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 4186 proven. 2070 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2019-09-03 21:06:39,811 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:06:42,870 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 4186 proven. 2070 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2019-09-03 21:06:42,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:06:42,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 48, 48] total 144 [2019-09-03 21:06:42,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:06:42,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-09-03 21:06:42,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-09-03 21:06:42,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5552, Invalid=15040, Unknown=0, NotChecked=0, Total=20592 [2019-09-03 21:06:42,876 INFO L87 Difference]: Start difference. First operand 194 states and 241 transitions. Second operand 98 states. [2019-09-03 21:06:44,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:06:44,398 INFO L93 Difference]: Finished difference Result 201 states and 249 transitions. [2019-09-03 21:06:44,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-03 21:06:44,398 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 192 [2019-09-03 21:06:44,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:06:44,400 INFO L225 Difference]: With dead ends: 201 [2019-09-03 21:06:44,400 INFO L226 Difference]: Without dead ends: 198 [2019-09-03 21:06:44,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5588 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=12046, Invalid=24626, Unknown=0, NotChecked=0, Total=36672 [2019-09-03 21:06:44,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-09-03 21:06:44,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2019-09-03 21:06:44,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-09-03 21:06:44,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 246 transitions. [2019-09-03 21:06:44,405 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 246 transitions. Word has length 192 [2019-09-03 21:06:44,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:06:44,406 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 246 transitions. [2019-09-03 21:06:44,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-09-03 21:06:44,406 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 246 transitions. [2019-09-03 21:06:44,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-03 21:06:44,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:06:44,407 INFO L399 BasicCegarLoop]: trace histogram [93, 47, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:06:44,407 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:06:44,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:06:44,408 INFO L82 PathProgramCache]: Analyzing trace with hash 627618306, now seen corresponding path program 48 times [2019-09-03 21:06:44,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:06:44,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:44,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:06:44,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:44,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:06:44,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:45,382 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 0 proven. 6487 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2019-09-03 21:06:45,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:45,382 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:06:45,382 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:06:45,383 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:06:45,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:45,383 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 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:06:45,394 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:06:45,395 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:06:45,453 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:06:45,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:06:45,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-03 21:06:45,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:06:47,125 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 4371 proven. 2162 refuted. 0 times theorem prover too weak. 2116 trivial. 0 not checked. [2019-09-03 21:06:47,125 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:06:50,244 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 4371 proven. 2162 refuted. 0 times theorem prover too weak. 2116 trivial. 0 not checked. [2019-09-03 21:06:50,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:06:50,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 49, 49] total 147 [2019-09-03 21:06:50,247 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:06:50,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-09-03 21:06:50,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-09-03 21:06:50,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5790, Invalid=15672, Unknown=0, NotChecked=0, Total=21462 [2019-09-03 21:06:50,249 INFO L87 Difference]: Start difference. First operand 198 states and 246 transitions. Second operand 100 states. [2019-09-03 21:06:51,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:06:51,886 INFO L93 Difference]: Finished difference Result 205 states and 254 transitions. [2019-09-03 21:06:51,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-03 21:06:51,886 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 196 [2019-09-03 21:06:51,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:06:51,887 INFO L225 Difference]: With dead ends: 205 [2019-09-03 21:06:51,887 INFO L226 Difference]: Without dead ends: 202 [2019-09-03 21:06:51,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5827 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=12566, Invalid=25654, Unknown=0, NotChecked=0, Total=38220 [2019-09-03 21:06:51,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-03 21:06:51,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2019-09-03 21:06:51,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-03 21:06:51,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 251 transitions. [2019-09-03 21:06:51,892 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 251 transitions. Word has length 196 [2019-09-03 21:06:51,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:06:51,893 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 251 transitions. [2019-09-03 21:06:51,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-09-03 21:06:51,893 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 251 transitions. [2019-09-03 21:06:51,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-03 21:06:51,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:06:51,894 INFO L399 BasicCegarLoop]: trace histogram [95, 48, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:06:51,894 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:06:51,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:06:51,895 INFO L82 PathProgramCache]: Analyzing trace with hash 2096123642, now seen corresponding path program 49 times [2019-09-03 21:06:51,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:06:51,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:51,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:06:51,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:51,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:06:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:53,030 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 0 proven. 6769 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2019-09-03 21:06:53,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:53,030 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:06:53,031 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:06:53,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:06:53,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:53,031 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 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:06:53,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:06:53,040 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:06:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:53,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-03 21:06:53,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:06:55,043 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4560 proven. 2256 refuted. 0 times theorem prover too weak. 2209 trivial. 0 not checked. [2019-09-03 21:06:55,043 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:06:58,326 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4560 proven. 2256 refuted. 0 times theorem prover too weak. 2209 trivial. 0 not checked. [2019-09-03 21:06:58,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:06:58,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 50, 50] total 150 [2019-09-03 21:06:58,330 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:06:58,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-09-03 21:06:58,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-09-03 21:06:58,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6033, Invalid=16317, Unknown=0, NotChecked=0, Total=22350 [2019-09-03 21:06:58,332 INFO L87 Difference]: Start difference. First operand 202 states and 251 transitions. Second operand 102 states. [2019-09-03 21:07:00,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:07:00,058 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2019-09-03 21:07:00,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-09-03 21:07:00,058 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 200 [2019-09-03 21:07:00,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:07:00,059 INFO L225 Difference]: With dead ends: 209 [2019-09-03 21:07:00,059 INFO L226 Difference]: Without dead ends: 206 [2019-09-03 21:07:00,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6071 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=13097, Invalid=26703, Unknown=0, NotChecked=0, Total=39800 [2019-09-03 21:07:00,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-03 21:07:00,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2019-09-03 21:07:00,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-03 21:07:00,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 256 transitions. [2019-09-03 21:07:00,065 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 256 transitions. Word has length 200 [2019-09-03 21:07:00,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:07:00,065 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 256 transitions. [2019-09-03 21:07:00,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-09-03 21:07:00,065 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 256 transitions. [2019-09-03 21:07:00,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-03 21:07:00,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:07:00,066 INFO L399 BasicCegarLoop]: trace histogram [97, 49, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:07:00,067 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:07:00,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:07:00,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1696725134, now seen corresponding path program 50 times [2019-09-03 21:07:00,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:07:00,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:00,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:07:00,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:00,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:07:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:07:01,092 INFO L134 CoverageAnalysis]: Checked inductivity of 9409 backedges. 0 proven. 7057 refuted. 0 times theorem prover too weak. 2352 trivial. 0 not checked. [2019-09-03 21:07:01,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:01,093 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:07:01,093 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:07:01,093 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:07:01,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:01,093 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 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:07:01,103 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:07:01,103 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:07:01,233 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 98 check-sat command(s) [2019-09-03 21:07:01,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:07:01,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-03 21:07:01,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:07:03,037 INFO L134 CoverageAnalysis]: Checked inductivity of 9409 backedges. 4753 proven. 2352 refuted. 0 times theorem prover too weak. 2304 trivial. 0 not checked. [2019-09-03 21:07:03,037 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:07:06,435 INFO L134 CoverageAnalysis]: Checked inductivity of 9409 backedges. 4753 proven. 2352 refuted. 0 times theorem prover too weak. 2304 trivial. 0 not checked. [2019-09-03 21:07:06,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:07:06,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 51, 51] total 153 [2019-09-03 21:07:06,439 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:07:06,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-09-03 21:07:06,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-09-03 21:07:06,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6281, Invalid=16975, Unknown=0, NotChecked=0, Total=23256 [2019-09-03 21:07:06,442 INFO L87 Difference]: Start difference. First operand 206 states and 256 transitions. Second operand 104 states. [2019-09-03 21:07:08,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:07:08,100 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2019-09-03 21:07:08,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-09-03 21:07:08,100 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 204 [2019-09-03 21:07:08,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:07:08,101 INFO L225 Difference]: With dead ends: 213 [2019-09-03 21:07:08,102 INFO L226 Difference]: Without dead ends: 210 [2019-09-03 21:07:08,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6320 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=13639, Invalid=27773, Unknown=0, NotChecked=0, Total=41412 [2019-09-03 21:07:08,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-03 21:07:08,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2019-09-03 21:07:08,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-03 21:07:08,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 261 transitions. [2019-09-03 21:07:08,107 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 261 transitions. Word has length 204 [2019-09-03 21:07:08,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:07:08,107 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 261 transitions. [2019-09-03 21:07:08,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-09-03 21:07:08,107 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 261 transitions. [2019-09-03 21:07:08,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-03 21:07:08,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:07:08,108 INFO L399 BasicCegarLoop]: trace histogram [99, 50, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:07:08,109 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:07:08,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:07:08,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1715455126, now seen corresponding path program 51 times [2019-09-03 21:07:08,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:07:08,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:08,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:07:08,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:08,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:07:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:07:09,171 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 7351 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-03 21:07:09,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:09,172 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:07:09,172 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:07:09,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:07:09,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:09,173 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 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:07:09,183 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:07:09,183 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:07:09,242 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:07:09,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:07:09,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-03 21:07:09,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:07:11,138 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 4950 proven. 2450 refuted. 0 times theorem prover too weak. 2401 trivial. 0 not checked. [2019-09-03 21:07:11,138 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:07:14,729 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 4950 proven. 2450 refuted. 0 times theorem prover too weak. 2401 trivial. 0 not checked. [2019-09-03 21:07:14,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:07:14,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 52, 52] total 156 [2019-09-03 21:07:14,733 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:07:14,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-09-03 21:07:14,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-09-03 21:07:14,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6534, Invalid=17646, Unknown=0, NotChecked=0, Total=24180 [2019-09-03 21:07:14,735 INFO L87 Difference]: Start difference. First operand 210 states and 261 transitions. Second operand 106 states. [2019-09-03 21:07:16,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:07:16,514 INFO L93 Difference]: Finished difference Result 217 states and 269 transitions. [2019-09-03 21:07:16,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-09-03 21:07:16,514 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 208 [2019-09-03 21:07:16,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:07:16,516 INFO L225 Difference]: With dead ends: 217 [2019-09-03 21:07:16,516 INFO L226 Difference]: Without dead ends: 214 [2019-09-03 21:07:16,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6574 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=14192, Invalid=28864, Unknown=0, NotChecked=0, Total=43056 [2019-09-03 21:07:16,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-03 21:07:16,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2019-09-03 21:07:16,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-09-03 21:07:16,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 266 transitions. [2019-09-03 21:07:16,521 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 266 transitions. Word has length 208 [2019-09-03 21:07:16,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:07:16,522 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 266 transitions. [2019-09-03 21:07:16,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-09-03 21:07:16,522 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 266 transitions. [2019-09-03 21:07:16,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-03 21:07:16,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:07:16,523 INFO L399 BasicCegarLoop]: trace histogram [101, 51, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:07:16,524 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:07:16,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:07:16,524 INFO L82 PathProgramCache]: Analyzing trace with hash -2073212190, now seen corresponding path program 52 times [2019-09-03 21:07:16,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:07:16,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:16,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:07:16,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:16,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:07:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:07:17,784 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 0 proven. 7651 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2019-09-03 21:07:17,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:17,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:07:17,784 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:07:17,784 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:07:17,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:17,785 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 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:07:17,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:07:17,796 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:07:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:07:17,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-03 21:07:17,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:07:19,811 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 5151 proven. 2550 refuted. 0 times theorem prover too weak. 2500 trivial. 0 not checked. [2019-09-03 21:07:19,811 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:07:23,697 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 5151 proven. 2550 refuted. 0 times theorem prover too weak. 2500 trivial. 0 not checked. [2019-09-03 21:07:23,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:07:23,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 53, 53] total 159 [2019-09-03 21:07:23,701 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:07:23,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-09-03 21:07:23,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-09-03 21:07:23,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6792, Invalid=18330, Unknown=0, NotChecked=0, Total=25122 [2019-09-03 21:07:23,703 INFO L87 Difference]: Start difference. First operand 214 states and 266 transitions. Second operand 108 states. [2019-09-03 21:07:25,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:07:25,564 INFO L93 Difference]: Finished difference Result 221 states and 274 transitions. [2019-09-03 21:07:25,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-09-03 21:07:25,564 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 212 [2019-09-03 21:07:25,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:07:25,565 INFO L225 Difference]: With dead ends: 221 [2019-09-03 21:07:25,565 INFO L226 Difference]: Without dead ends: 218 [2019-09-03 21:07:25,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6833 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=14756, Invalid=29976, Unknown=0, NotChecked=0, Total=44732 [2019-09-03 21:07:25,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-03 21:07:25,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2019-09-03 21:07:25,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-09-03 21:07:25,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 271 transitions. [2019-09-03 21:07:25,570 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 271 transitions. Word has length 212 [2019-09-03 21:07:25,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:07:25,570 INFO L475 AbstractCegarLoop]: Abstraction has 218 states and 271 transitions. [2019-09-03 21:07:25,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-09-03 21:07:25,570 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 271 transitions. [2019-09-03 21:07:25,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-03 21:07:25,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:07:25,571 INFO L399 BasicCegarLoop]: trace histogram [103, 52, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:07:25,571 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:07:25,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:07:25,572 INFO L82 PathProgramCache]: Analyzing trace with hash 872650202, now seen corresponding path program 53 times [2019-09-03 21:07:25,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:07:25,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:25,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:07:25,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:25,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:07:25,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:07:26,702 INFO L134 CoverageAnalysis]: Checked inductivity of 10609 backedges. 0 proven. 7957 refuted. 0 times theorem prover too weak. 2652 trivial. 0 not checked. [2019-09-03 21:07:26,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:26,703 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:07:26,703 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:07:26,703 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:07:26,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:26,703 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 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:07:26,713 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:07:26,714 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:07:26,854 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 104 check-sat command(s) [2019-09-03 21:07:26,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:07:26,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-03 21:07:26,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:07:28,872 INFO L134 CoverageAnalysis]: Checked inductivity of 10609 backedges. 5356 proven. 2652 refuted. 0 times theorem prover too weak. 2601 trivial. 0 not checked. [2019-09-03 21:07:28,873 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:07:32,715 INFO L134 CoverageAnalysis]: Checked inductivity of 10609 backedges. 5356 proven. 2652 refuted. 0 times theorem prover too weak. 2601 trivial. 0 not checked. [2019-09-03 21:07:32,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:07:32,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 54, 54] total 162 [2019-09-03 21:07:32,719 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:07:32,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-09-03 21:07:32,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-09-03 21:07:32,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7055, Invalid=19027, Unknown=0, NotChecked=0, Total=26082 [2019-09-03 21:07:32,721 INFO L87 Difference]: Start difference. First operand 218 states and 271 transitions. Second operand 110 states. [2019-09-03 21:07:34,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:07:34,678 INFO L93 Difference]: Finished difference Result 225 states and 279 transitions. [2019-09-03 21:07:34,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-09-03 21:07:34,678 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 216 [2019-09-03 21:07:34,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:07:34,680 INFO L225 Difference]: With dead ends: 225 [2019-09-03 21:07:34,680 INFO L226 Difference]: Without dead ends: 222 [2019-09-03 21:07:34,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7097 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=15331, Invalid=31109, Unknown=0, NotChecked=0, Total=46440 [2019-09-03 21:07:34,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-03 21:07:34,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2019-09-03 21:07:34,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-09-03 21:07:34,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 276 transitions. [2019-09-03 21:07:34,685 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 276 transitions. Word has length 216 [2019-09-03 21:07:34,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:07:34,685 INFO L475 AbstractCegarLoop]: Abstraction has 222 states and 276 transitions. [2019-09-03 21:07:34,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-09-03 21:07:34,686 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 276 transitions. [2019-09-03 21:07:34,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-03 21:07:34,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:07:34,687 INFO L399 BasicCegarLoop]: trace histogram [105, 53, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:07:34,687 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:07:34,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:07:34,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1377207214, now seen corresponding path program 54 times [2019-09-03 21:07:34,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:07:34,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:34,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:07:34,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:34,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:07:34,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:07:35,845 INFO L134 CoverageAnalysis]: Checked inductivity of 11025 backedges. 0 proven. 8269 refuted. 0 times theorem prover too weak. 2756 trivial. 0 not checked. [2019-09-03 21:07:35,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:35,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:07:35,845 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:07:35,845 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:07:35,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:35,846 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 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:07:35,856 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:07:35,856 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:07:35,921 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:07:35,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:07:35,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-03 21:07:35,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:07:38,025 INFO L134 CoverageAnalysis]: Checked inductivity of 11025 backedges. 5565 proven. 2756 refuted. 0 times theorem prover too weak. 2704 trivial. 0 not checked. [2019-09-03 21:07:38,026 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:07:42,008 INFO L134 CoverageAnalysis]: Checked inductivity of 11025 backedges. 5565 proven. 2756 refuted. 0 times theorem prover too weak. 2704 trivial. 0 not checked. [2019-09-03 21:07:42,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:07:42,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 55, 55] total 165 [2019-09-03 21:07:42,011 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:07:42,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-09-03 21:07:42,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-09-03 21:07:42,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7323, Invalid=19737, Unknown=0, NotChecked=0, Total=27060 [2019-09-03 21:07:42,013 INFO L87 Difference]: Start difference. First operand 222 states and 276 transitions. Second operand 112 states. [2019-09-03 21:07:44,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:07:44,037 INFO L93 Difference]: Finished difference Result 229 states and 284 transitions. [2019-09-03 21:07:44,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-09-03 21:07:44,038 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 220 [2019-09-03 21:07:44,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:07:44,039 INFO L225 Difference]: With dead ends: 229 [2019-09-03 21:07:44,039 INFO L226 Difference]: Without dead ends: 226 [2019-09-03 21:07:44,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7366 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=15917, Invalid=32263, Unknown=0, NotChecked=0, Total=48180 [2019-09-03 21:07:44,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-03 21:07:44,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2019-09-03 21:07:44,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-03 21:07:44,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 281 transitions. [2019-09-03 21:07:44,043 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 281 transitions. Word has length 220 [2019-09-03 21:07:44,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:07:44,044 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 281 transitions. [2019-09-03 21:07:44,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-09-03 21:07:44,044 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 281 transitions. [2019-09-03 21:07:44,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-03 21:07:44,045 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:07:44,045 INFO L399 BasicCegarLoop]: trace histogram [107, 54, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:07:44,045 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:07:44,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:07:44,046 INFO L82 PathProgramCache]: Analyzing trace with hash 30236234, now seen corresponding path program 55 times [2019-09-03 21:07:44,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:07:44,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:44,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:07:44,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:44,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:07:44,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:07:45,284 INFO L134 CoverageAnalysis]: Checked inductivity of 11449 backedges. 0 proven. 8587 refuted. 0 times theorem prover too weak. 2862 trivial. 0 not checked. [2019-09-03 21:07:45,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:45,285 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:07:45,285 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:07:45,285 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:07:45,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:45,285 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 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:07:45,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:07:45,298 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:07:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:07:45,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-03 21:07:45,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:07:47,509 INFO L134 CoverageAnalysis]: Checked inductivity of 11449 backedges. 5778 proven. 2862 refuted. 0 times theorem prover too weak. 2809 trivial. 0 not checked. [2019-09-03 21:07:47,510 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:07:51,610 INFO L134 CoverageAnalysis]: Checked inductivity of 11449 backedges. 5778 proven. 2862 refuted. 0 times theorem prover too weak. 2809 trivial. 0 not checked. [2019-09-03 21:07:51,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:07:51,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 56, 56] total 168 [2019-09-03 21:07:51,614 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:07:51,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-09-03 21:07:51,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-09-03 21:07:51,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7596, Invalid=20460, Unknown=0, NotChecked=0, Total=28056 [2019-09-03 21:07:51,616 INFO L87 Difference]: Start difference. First operand 226 states and 281 transitions. Second operand 114 states. [2019-09-03 21:07:53,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:07:53,672 INFO L93 Difference]: Finished difference Result 233 states and 289 transitions. [2019-09-03 21:07:53,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-09-03 21:07:53,672 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 224 [2019-09-03 21:07:53,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:07:53,673 INFO L225 Difference]: With dead ends: 233 [2019-09-03 21:07:53,673 INFO L226 Difference]: Without dead ends: 230 [2019-09-03 21:07:53,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 563 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7640 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=16514, Invalid=33438, Unknown=0, NotChecked=0, Total=49952 [2019-09-03 21:07:53,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-09-03 21:07:53,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2019-09-03 21:07:53,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-09-03 21:07:53,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 286 transitions. [2019-09-03 21:07:53,678 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 286 transitions. Word has length 224 [2019-09-03 21:07:53,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:07:53,678 INFO L475 AbstractCegarLoop]: Abstraction has 230 states and 286 transitions. [2019-09-03 21:07:53,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-09-03 21:07:53,678 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 286 transitions. [2019-09-03 21:07:53,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-03 21:07:53,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:07:53,680 INFO L399 BasicCegarLoop]: trace histogram [109, 55, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:07:53,680 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:07:53,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:07:53,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1482318910, now seen corresponding path program 56 times [2019-09-03 21:07:53,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:07:53,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:53,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:07:53,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:53,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:07:53,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:07:55,382 INFO L134 CoverageAnalysis]: Checked inductivity of 11881 backedges. 0 proven. 8911 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2019-09-03 21:07:55,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:55,382 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:07:55,383 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:07:55,383 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:07:55,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:55,383 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 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:07:55,394 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:07:55,394 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:07:55,557 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 110 check-sat command(s) [2019-09-03 21:07:55,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:07:55,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-03 21:07:55,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:07:57,907 INFO L134 CoverageAnalysis]: Checked inductivity of 11881 backedges. 5995 proven. 2970 refuted. 0 times theorem prover too weak. 2916 trivial. 0 not checked. [2019-09-03 21:07:57,907 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:08:02,209 INFO L134 CoverageAnalysis]: Checked inductivity of 11881 backedges. 5995 proven. 2970 refuted. 0 times theorem prover too weak. 2916 trivial. 0 not checked. [2019-09-03 21:08:02,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:08:02,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 57, 57] total 171 [2019-09-03 21:08:02,216 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:08:02,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-09-03 21:08:02,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-09-03 21:08:02,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7874, Invalid=21196, Unknown=0, NotChecked=0, Total=29070 [2019-09-03 21:08:02,219 INFO L87 Difference]: Start difference. First operand 230 states and 286 transitions. Second operand 116 states. [2019-09-03 21:08:04,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:08:04,381 INFO L93 Difference]: Finished difference Result 237 states and 294 transitions. [2019-09-03 21:08:04,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-09-03 21:08:04,381 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 228 [2019-09-03 21:08:04,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:08:04,382 INFO L225 Difference]: With dead ends: 237 [2019-09-03 21:08:04,382 INFO L226 Difference]: Without dead ends: 234 [2019-09-03 21:08:04,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 573 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7919 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=17122, Invalid=34634, Unknown=0, NotChecked=0, Total=51756 [2019-09-03 21:08:04,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-09-03 21:08:04,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2019-09-03 21:08:04,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-09-03 21:08:04,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 291 transitions. [2019-09-03 21:08:04,387 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 291 transitions. Word has length 228 [2019-09-03 21:08:04,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:08:04,387 INFO L475 AbstractCegarLoop]: Abstraction has 234 states and 291 transitions. [2019-09-03 21:08:04,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-09-03 21:08:04,388 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 291 transitions. [2019-09-03 21:08:04,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-03 21:08:04,389 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:08:04,389 INFO L399 BasicCegarLoop]: trace histogram [111, 56, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:08:04,389 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:08:04,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:08:04,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1571853498, now seen corresponding path program 57 times [2019-09-03 21:08:04,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:08:04,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:04,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:08:04,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:04,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:08:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:08:05,737 INFO L134 CoverageAnalysis]: Checked inductivity of 12321 backedges. 0 proven. 9241 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2019-09-03 21:08:05,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:08:05,737 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:08:05,738 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:08:05,738 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:08:05,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:08:05,738 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 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:08:05,748 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:08:05,748 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:08:05,817 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:08:05,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:08:05,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-03 21:08:05,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:08:08,129 INFO L134 CoverageAnalysis]: Checked inductivity of 12321 backedges. 6216 proven. 3080 refuted. 0 times theorem prover too weak. 3025 trivial. 0 not checked. [2019-09-03 21:08:08,129 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:08:12,543 INFO L134 CoverageAnalysis]: Checked inductivity of 12321 backedges. 6216 proven. 3080 refuted. 0 times theorem prover too weak. 3025 trivial. 0 not checked. [2019-09-03 21:08:12,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:08:12,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 58, 58] total 174 [2019-09-03 21:08:12,546 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:08:12,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-09-03 21:08:12,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-09-03 21:08:12,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8157, Invalid=21945, Unknown=0, NotChecked=0, Total=30102 [2019-09-03 21:08:12,549 INFO L87 Difference]: Start difference. First operand 234 states and 291 transitions. Second operand 118 states. [2019-09-03 21:08:14,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:08:14,775 INFO L93 Difference]: Finished difference Result 241 states and 299 transitions. [2019-09-03 21:08:14,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-09-03 21:08:14,775 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 232 [2019-09-03 21:08:14,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:08:14,776 INFO L225 Difference]: With dead ends: 241 [2019-09-03 21:08:14,776 INFO L226 Difference]: Without dead ends: 238 [2019-09-03 21:08:14,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8203 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=17741, Invalid=35851, Unknown=0, NotChecked=0, Total=53592 [2019-09-03 21:08:14,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-09-03 21:08:14,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2019-09-03 21:08:14,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-09-03 21:08:14,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 296 transitions. [2019-09-03 21:08:14,781 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 296 transitions. Word has length 232 [2019-09-03 21:08:14,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:08:14,781 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 296 transitions. [2019-09-03 21:08:14,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-09-03 21:08:14,781 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 296 transitions. [2019-09-03 21:08:14,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-03 21:08:14,782 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:08:14,782 INFO L399 BasicCegarLoop]: trace histogram [113, 57, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:08:14,783 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:08:14,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:08:14,783 INFO L82 PathProgramCache]: Analyzing trace with hash -2039174862, now seen corresponding path program 58 times [2019-09-03 21:08:14,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:08:14,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:14,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:08:14,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:14,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:08:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:08:16,147 INFO L134 CoverageAnalysis]: Checked inductivity of 12769 backedges. 0 proven. 9577 refuted. 0 times theorem prover too weak. 3192 trivial. 0 not checked. [2019-09-03 21:08:16,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:08:16,148 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:08:16,148 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:08:16,148 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:08:16,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:08:16,148 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 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:08:16,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:08:16,157 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:08:16,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:08:16,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-03 21:08:16,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:08:18,634 INFO L134 CoverageAnalysis]: Checked inductivity of 12769 backedges. 6441 proven. 3192 refuted. 0 times theorem prover too weak. 3136 trivial. 0 not checked. [2019-09-03 21:08:18,634 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:08:23,179 INFO L134 CoverageAnalysis]: Checked inductivity of 12769 backedges. 6441 proven. 3192 refuted. 0 times theorem prover too weak. 3136 trivial. 0 not checked. [2019-09-03 21:08:23,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:08:23,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 59, 59] total 177 [2019-09-03 21:08:23,182 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:08:23,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-09-03 21:08:23,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-09-03 21:08:23,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8445, Invalid=22707, Unknown=0, NotChecked=0, Total=31152 [2019-09-03 21:08:23,184 INFO L87 Difference]: Start difference. First operand 238 states and 296 transitions. Second operand 120 states. [2019-09-03 21:08:25,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:08:25,597 INFO L93 Difference]: Finished difference Result 245 states and 304 transitions. [2019-09-03 21:08:25,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-09-03 21:08:25,598 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 236 [2019-09-03 21:08:25,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:08:25,599 INFO L225 Difference]: With dead ends: 245 [2019-09-03 21:08:25,599 INFO L226 Difference]: Without dead ends: 242 [2019-09-03 21:08:25,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 593 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8492 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=18371, Invalid=37089, Unknown=0, NotChecked=0, Total=55460 [2019-09-03 21:08:25,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-09-03 21:08:25,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-09-03 21:08:25,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-09-03 21:08:25,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 301 transitions. [2019-09-03 21:08:25,604 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 301 transitions. Word has length 236 [2019-09-03 21:08:25,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:08:25,604 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 301 transitions. [2019-09-03 21:08:25,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-09-03 21:08:25,605 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 301 transitions. [2019-09-03 21:08:25,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-03 21:08:25,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:08:25,606 INFO L399 BasicCegarLoop]: trace histogram [115, 58, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:08:25,606 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:08:25,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:08:25,606 INFO L82 PathProgramCache]: Analyzing trace with hash 113260842, now seen corresponding path program 59 times [2019-09-03 21:08:25,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:08:25,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:25,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:08:25,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:25,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:08:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:08:27,005 INFO L134 CoverageAnalysis]: Checked inductivity of 13225 backedges. 0 proven. 9919 refuted. 0 times theorem prover too weak. 3306 trivial. 0 not checked. [2019-09-03 21:08:27,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:08:27,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:08:27,006 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:08:27,006 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:08:27,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:08:27,006 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 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:08:27,016 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:08:27,016 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:08:27,195 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 116 check-sat command(s) [2019-09-03 21:08:27,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:08:27,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-03 21:08:27,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:08:29,711 INFO L134 CoverageAnalysis]: Checked inductivity of 13225 backedges. 6670 proven. 3306 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2019-09-03 21:08:29,711 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:08:34,444 INFO L134 CoverageAnalysis]: Checked inductivity of 13225 backedges. 6670 proven. 3306 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2019-09-03 21:08:34,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:08:34,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 60, 60] total 180 [2019-09-03 21:08:34,448 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:08:34,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-09-03 21:08:34,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-09-03 21:08:34,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8738, Invalid=23482, Unknown=0, NotChecked=0, Total=32220 [2019-09-03 21:08:34,450 INFO L87 Difference]: Start difference. First operand 242 states and 301 transitions. Second operand 122 states. [2019-09-03 21:08:36,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:08:36,862 INFO L93 Difference]: Finished difference Result 249 states and 309 transitions. [2019-09-03 21:08:36,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-09-03 21:08:36,862 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 240 [2019-09-03 21:08:36,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:08:36,863 INFO L225 Difference]: With dead ends: 249 [2019-09-03 21:08:36,863 INFO L226 Difference]: Without dead ends: 246 [2019-09-03 21:08:36,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8786 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=19012, Invalid=38348, Unknown=0, NotChecked=0, Total=57360 [2019-09-03 21:08:36,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-09-03 21:08:36,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2019-09-03 21:08:36,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-09-03 21:08:36,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 306 transitions. [2019-09-03 21:08:36,869 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 306 transitions. Word has length 240 [2019-09-03 21:08:36,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:08:36,869 INFO L475 AbstractCegarLoop]: Abstraction has 246 states and 306 transitions. [2019-09-03 21:08:36,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-09-03 21:08:36,869 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 306 transitions. [2019-09-03 21:08:36,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-03 21:08:36,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:08:36,871 INFO L399 BasicCegarLoop]: trace histogram [117, 59, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:08:36,871 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:08:36,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:08:36,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1549163358, now seen corresponding path program 60 times [2019-09-03 21:08:36,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:08:36,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:36,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:08:36,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:36,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:08:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:08:38,301 INFO L134 CoverageAnalysis]: Checked inductivity of 13689 backedges. 0 proven. 10267 refuted. 0 times theorem prover too weak. 3422 trivial. 0 not checked. [2019-09-03 21:08:38,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:08:38,301 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:08:38,301 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:08:38,301 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:08:38,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:08:38,301 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 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:08:38,328 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:08:38,328 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:08:38,400 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:08:38,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:08:38,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-03 21:08:38,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:08:40,947 INFO L134 CoverageAnalysis]: Checked inductivity of 13689 backedges. 6903 proven. 3422 refuted. 0 times theorem prover too weak. 3364 trivial. 0 not checked. [2019-09-03 21:08:40,947 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:08:45,838 INFO L134 CoverageAnalysis]: Checked inductivity of 13689 backedges. 6903 proven. 3422 refuted. 0 times theorem prover too weak. 3364 trivial. 0 not checked. [2019-09-03 21:08:45,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:08:45,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 61, 61] total 183 [2019-09-03 21:08:45,842 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:08:45,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-09-03 21:08:45,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-09-03 21:08:45,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9036, Invalid=24270, Unknown=0, NotChecked=0, Total=33306 [2019-09-03 21:08:45,844 INFO L87 Difference]: Start difference. First operand 246 states and 306 transitions. Second operand 124 states. [2019-09-03 21:08:48,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:08:48,288 INFO L93 Difference]: Finished difference Result 253 states and 314 transitions. [2019-09-03 21:08:48,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2019-09-03 21:08:48,288 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 244 [2019-09-03 21:08:48,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:08:48,289 INFO L225 Difference]: With dead ends: 253 [2019-09-03 21:08:48,290 INFO L226 Difference]: Without dead ends: 250 [2019-09-03 21:08:48,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 613 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9085 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=19664, Invalid=39628, Unknown=0, NotChecked=0, Total=59292 [2019-09-03 21:08:48,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-09-03 21:08:48,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2019-09-03 21:08:48,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-09-03 21:08:48,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 311 transitions. [2019-09-03 21:08:48,294 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 311 transitions. Word has length 244 [2019-09-03 21:08:48,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:08:48,294 INFO L475 AbstractCegarLoop]: Abstraction has 250 states and 311 transitions. [2019-09-03 21:08:48,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-09-03 21:08:48,294 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 311 transitions. [2019-09-03 21:08:48,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-03 21:08:48,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:08:48,296 INFO L399 BasicCegarLoop]: trace histogram [119, 60, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:08:48,296 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:08:48,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:08:48,296 INFO L82 PathProgramCache]: Analyzing trace with hash -527479910, now seen corresponding path program 61 times [2019-09-03 21:08:48,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:08:48,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:48,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:08:48,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:48,297 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:08:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:08:49,760 INFO L134 CoverageAnalysis]: Checked inductivity of 14161 backedges. 0 proven. 10621 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2019-09-03 21:08:49,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:08:49,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:08:49,761 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:08:49,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:08:49,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:08:49,761 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 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:08:49,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:08:49,772 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:08:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:08:49,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-03 21:08:49,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:08:52,465 INFO L134 CoverageAnalysis]: Checked inductivity of 14161 backedges. 7140 proven. 3540 refuted. 0 times theorem prover too weak. 3481 trivial. 0 not checked. [2019-09-03 21:08:52,465 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:08:57,493 INFO L134 CoverageAnalysis]: Checked inductivity of 14161 backedges. 7140 proven. 3540 refuted. 0 times theorem prover too weak. 3481 trivial. 0 not checked. [2019-09-03 21:08:57,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:08:57,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 62, 62] total 186 [2019-09-03 21:08:57,496 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:08:57,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-09-03 21:08:57,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-09-03 21:08:57,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9339, Invalid=25071, Unknown=0, NotChecked=0, Total=34410 [2019-09-03 21:08:57,499 INFO L87 Difference]: Start difference. First operand 250 states and 311 transitions. Second operand 126 states. [2019-09-03 21:08:59,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:08:59,923 INFO L93 Difference]: Finished difference Result 257 states and 319 transitions. [2019-09-03 21:08:59,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-09-03 21:08:59,923 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 248 [2019-09-03 21:08:59,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:08:59,924 INFO L225 Difference]: With dead ends: 257 [2019-09-03 21:08:59,925 INFO L226 Difference]: Without dead ends: 254 [2019-09-03 21:08:59,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9389 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=20327, Invalid=40929, Unknown=0, NotChecked=0, Total=61256 [2019-09-03 21:08:59,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-09-03 21:08:59,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2019-09-03 21:08:59,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-09-03 21:08:59,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 316 transitions. [2019-09-03 21:08:59,930 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 316 transitions. Word has length 248 [2019-09-03 21:08:59,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:08:59,931 INFO L475 AbstractCegarLoop]: Abstraction has 254 states and 316 transitions. [2019-09-03 21:08:59,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-09-03 21:08:59,931 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 316 transitions. [2019-09-03 21:08:59,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-03 21:08:59,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:08:59,933 INFO L399 BasicCegarLoop]: trace histogram [121, 61, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:08:59,933 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:08:59,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:08:59,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1561824786, now seen corresponding path program 62 times [2019-09-03 21:08:59,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:08:59,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:59,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:08:59,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:59,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:08:59,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:01,405 INFO L134 CoverageAnalysis]: Checked inductivity of 14641 backedges. 0 proven. 10981 refuted. 0 times theorem prover too weak. 3660 trivial. 0 not checked. [2019-09-03 21:09:01,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:01,405 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:09:01,406 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:09:01,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:09:01,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:01,406 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 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:09:01,418 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:09:01,419 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:09:01,606 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 122 check-sat command(s) [2019-09-03 21:09:01,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:09:01,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-03 21:09:01,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:09:04,335 INFO L134 CoverageAnalysis]: Checked inductivity of 14641 backedges. 7381 proven. 3660 refuted. 0 times theorem prover too weak. 3600 trivial. 0 not checked. [2019-09-03 21:09:04,336 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:09:09,562 INFO L134 CoverageAnalysis]: Checked inductivity of 14641 backedges. 7381 proven. 3660 refuted. 0 times theorem prover too weak. 3600 trivial. 0 not checked. [2019-09-03 21:09:09,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:09:09,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 63, 63] total 189 [2019-09-03 21:09:09,566 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:09:09,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-09-03 21:09:09,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-09-03 21:09:09,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9647, Invalid=25885, Unknown=0, NotChecked=0, Total=35532 [2019-09-03 21:09:09,568 INFO L87 Difference]: Start difference. First operand 254 states and 316 transitions. Second operand 128 states. [2019-09-03 21:09:12,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:09:12,123 INFO L93 Difference]: Finished difference Result 261 states and 324 transitions. [2019-09-03 21:09:12,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-09-03 21:09:12,124 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 252 [2019-09-03 21:09:12,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:09:12,125 INFO L225 Difference]: With dead ends: 261 [2019-09-03 21:09:12,125 INFO L226 Difference]: Without dead ends: 258 [2019-09-03 21:09:12,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9698 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=21001, Invalid=42251, Unknown=0, NotChecked=0, Total=63252 [2019-09-03 21:09:12,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-09-03 21:09:12,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2019-09-03 21:09:12,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-03 21:09:12,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 321 transitions. [2019-09-03 21:09:12,130 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 321 transitions. Word has length 252 [2019-09-03 21:09:12,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:09:12,131 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 321 transitions. [2019-09-03 21:09:12,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-09-03 21:09:12,131 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 321 transitions. [2019-09-03 21:09:12,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-03 21:09:12,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:09:12,132 INFO L399 BasicCegarLoop]: trace histogram [123, 62, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:09:12,132 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:09:12,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:12,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1288647670, now seen corresponding path program 63 times [2019-09-03 21:09:12,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:09:12,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:12,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:09:12,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:12,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:09:12,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:13,836 INFO L134 CoverageAnalysis]: Checked inductivity of 15129 backedges. 0 proven. 11347 refuted. 0 times theorem prover too weak. 3782 trivial. 0 not checked. [2019-09-03 21:09:13,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:13,836 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:09:13,836 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:09:13,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:09:13,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:13,837 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 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:09:13,848 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:09:13,848 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:09:13,933 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:09:13,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:09:13,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-03 21:09:13,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:09:16,738 INFO L134 CoverageAnalysis]: Checked inductivity of 15129 backedges. 7626 proven. 3782 refuted. 0 times theorem prover too weak. 3721 trivial. 0 not checked. [2019-09-03 21:09:16,738 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:09:22,133 INFO L134 CoverageAnalysis]: Checked inductivity of 15129 backedges. 7626 proven. 3782 refuted. 0 times theorem prover too weak. 3721 trivial. 0 not checked. [2019-09-03 21:09:22,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:09:22,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 64, 64] total 192 [2019-09-03 21:09:22,137 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:09:22,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-09-03 21:09:22,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-09-03 21:09:22,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9960, Invalid=26712, Unknown=0, NotChecked=0, Total=36672 [2019-09-03 21:09:22,139 INFO L87 Difference]: Start difference. First operand 258 states and 321 transitions. Second operand 130 states. [2019-09-03 21:09:24,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:09:24,846 INFO L93 Difference]: Finished difference Result 265 states and 329 transitions. [2019-09-03 21:09:24,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2019-09-03 21:09:24,846 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 256 [2019-09-03 21:09:24,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:09:24,847 INFO L225 Difference]: With dead ends: 265 [2019-09-03 21:09:24,847 INFO L226 Difference]: Without dead ends: 262 [2019-09-03 21:09:24,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 643 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10012 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=21686, Invalid=43594, Unknown=0, NotChecked=0, Total=65280 [2019-09-03 21:09:24,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-09-03 21:09:24,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2019-09-03 21:09:24,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-03 21:09:24,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 326 transitions. [2019-09-03 21:09:24,853 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 326 transitions. Word has length 256 [2019-09-03 21:09:24,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:09:24,853 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 326 transitions. [2019-09-03 21:09:24,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-09-03 21:09:24,854 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 326 transitions. [2019-09-03 21:09:24,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-03 21:09:24,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:09:24,855 INFO L399 BasicCegarLoop]: trace histogram [125, 63, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:09:24,855 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:09:24,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:24,856 INFO L82 PathProgramCache]: Analyzing trace with hash -720280190, now seen corresponding path program 64 times [2019-09-03 21:09:24,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:09:24,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:24,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:09:24,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:24,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:09:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:26,488 INFO L134 CoverageAnalysis]: Checked inductivity of 15625 backedges. 0 proven. 11719 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2019-09-03 21:09:26,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:26,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:09:26,488 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:09:26,488 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:09:26,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:26,488 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 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:09:26,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:26,499 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:09:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:26,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-03 21:09:26,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:09:29,467 INFO L134 CoverageAnalysis]: Checked inductivity of 15625 backedges. 7875 proven. 3906 refuted. 0 times theorem prover too weak. 3844 trivial. 0 not checked. [2019-09-03 21:09:29,468 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:09:35,005 INFO L134 CoverageAnalysis]: Checked inductivity of 15625 backedges. 7875 proven. 3906 refuted. 0 times theorem prover too weak. 3844 trivial. 0 not checked. [2019-09-03 21:09:35,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:09:35,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 65, 65] total 195 [2019-09-03 21:09:35,009 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:09:35,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-09-03 21:09:35,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-09-03 21:09:35,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10278, Invalid=27552, Unknown=0, NotChecked=0, Total=37830 [2019-09-03 21:09:35,011 INFO L87 Difference]: Start difference. First operand 262 states and 326 transitions. Second operand 132 states. [2019-09-03 21:09:37,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:09:37,826 INFO L93 Difference]: Finished difference Result 269 states and 334 transitions. [2019-09-03 21:09:37,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2019-09-03 21:09:37,826 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 260 [2019-09-03 21:09:37,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:09:37,827 INFO L225 Difference]: With dead ends: 269 [2019-09-03 21:09:37,827 INFO L226 Difference]: Without dead ends: 266 [2019-09-03 21:09:37,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10331 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=22382, Invalid=44958, Unknown=0, NotChecked=0, Total=67340 [2019-09-03 21:09:37,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-09-03 21:09:37,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2019-09-03 21:09:37,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-03 21:09:37,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 331 transitions. [2019-09-03 21:09:37,832 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 331 transitions. Word has length 260 [2019-09-03 21:09:37,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:09:37,832 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 331 transitions. [2019-09-03 21:09:37,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-09-03 21:09:37,832 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 331 transitions. [2019-09-03 21:09:37,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-03 21:09:37,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:09:37,834 INFO L399 BasicCegarLoop]: trace histogram [127, 64, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:09:37,834 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:09:37,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:37,834 INFO L82 PathProgramCache]: Analyzing trace with hash -348669318, now seen corresponding path program 65 times [2019-09-03 21:09:37,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:09:37,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:37,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:37,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:37,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:09:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:39,504 INFO L134 CoverageAnalysis]: Checked inductivity of 16129 backedges. 0 proven. 12097 refuted. 0 times theorem prover too weak. 4032 trivial. 0 not checked. [2019-09-03 21:09:39,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:39,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:09:39,505 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:09:39,505 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:09:39,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:39,505 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 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:09:39,514 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:09:39,514 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:09:39,717 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 128 check-sat command(s) [2019-09-03 21:09:39,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:09:39,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-03 21:09:39,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:09:42,900 INFO L134 CoverageAnalysis]: Checked inductivity of 16129 backedges. 8128 proven. 4032 refuted. 0 times theorem prover too weak. 3969 trivial. 0 not checked. [2019-09-03 21:09:42,900 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:09:48,647 INFO L134 CoverageAnalysis]: Checked inductivity of 16129 backedges. 8128 proven. 4032 refuted. 0 times theorem prover too weak. 3969 trivial. 0 not checked. [2019-09-03 21:09:48,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:09:48,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 66, 66] total 198 [2019-09-03 21:09:48,651 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:09:48,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-09-03 21:09:48,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-09-03 21:09:48,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10601, Invalid=28405, Unknown=0, NotChecked=0, Total=39006 [2019-09-03 21:09:48,653 INFO L87 Difference]: Start difference. First operand 266 states and 331 transitions. Second operand 134 states. [2019-09-03 21:09:51,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:09:51,511 INFO L93 Difference]: Finished difference Result 273 states and 339 transitions. [2019-09-03 21:09:51,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2019-09-03 21:09:51,511 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 264 [2019-09-03 21:09:51,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:09:51,512 INFO L225 Difference]: With dead ends: 273 [2019-09-03 21:09:51,513 INFO L226 Difference]: Without dead ends: 270 [2019-09-03 21:09:51,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10655 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=23089, Invalid=46343, Unknown=0, NotChecked=0, Total=69432 [2019-09-03 21:09:51,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-09-03 21:09:51,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2019-09-03 21:09:51,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-09-03 21:09:51,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 336 transitions. [2019-09-03 21:09:51,518 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 336 transitions. Word has length 264 [2019-09-03 21:09:51,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:09:51,518 INFO L475 AbstractCegarLoop]: Abstraction has 270 states and 336 transitions. [2019-09-03 21:09:51,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-09-03 21:09:51,519 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 336 transitions. [2019-09-03 21:09:51,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-03 21:09:51,520 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:09:51,520 INFO L399 BasicCegarLoop]: trace histogram [129, 65, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:09:51,520 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:09:51,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:51,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1301665038, now seen corresponding path program 66 times [2019-09-03 21:09:51,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:09:51,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:51,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:09:51,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:51,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:09:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:53,172 INFO L134 CoverageAnalysis]: Checked inductivity of 16641 backedges. 0 proven. 12481 refuted. 0 times theorem prover too weak. 4160 trivial. 0 not checked. [2019-09-03 21:09:53,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:53,172 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:09:53,172 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:09:53,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:09:53,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:53,172 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 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:09:53,184 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:09:53,184 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:09:53,263 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:09:53,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:09:53,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-03 21:09:53,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:09:56,304 INFO L134 CoverageAnalysis]: Checked inductivity of 16641 backedges. 8385 proven. 4160 refuted. 0 times theorem prover too weak. 4096 trivial. 0 not checked. [2019-09-03 21:09:56,304 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:10:02,124 INFO L134 CoverageAnalysis]: Checked inductivity of 16641 backedges. 8385 proven. 4160 refuted. 0 times theorem prover too weak. 4096 trivial. 0 not checked. [2019-09-03 21:10:02,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:10:02,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 67, 67] total 201 [2019-09-03 21:10:02,127 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:10:02,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-09-03 21:10:02,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-09-03 21:10:02,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10929, Invalid=29271, Unknown=0, NotChecked=0, Total=40200 [2019-09-03 21:10:02,130 INFO L87 Difference]: Start difference. First operand 270 states and 336 transitions. Second operand 136 states. [2019-09-03 21:10:05,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:10:05,111 INFO L93 Difference]: Finished difference Result 277 states and 344 transitions. [2019-09-03 21:10:05,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2019-09-03 21:10:05,112 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 268 [2019-09-03 21:10:05,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:10:05,113 INFO L225 Difference]: With dead ends: 277 [2019-09-03 21:10:05,113 INFO L226 Difference]: Without dead ends: 274 [2019-09-03 21:10:05,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 673 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10984 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=23807, Invalid=47749, Unknown=0, NotChecked=0, Total=71556 [2019-09-03 21:10:05,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-09-03 21:10:05,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2019-09-03 21:10:05,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-09-03 21:10:05,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 341 transitions. [2019-09-03 21:10:05,117 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 341 transitions. Word has length 268 [2019-09-03 21:10:05,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:10:05,117 INFO L475 AbstractCegarLoop]: Abstraction has 274 states and 341 transitions. [2019-09-03 21:10:05,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-09-03 21:10:05,117 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 341 transitions. [2019-09-03 21:10:05,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-09-03 21:10:05,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:10:05,119 INFO L399 BasicCegarLoop]: trace histogram [131, 66, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:10:05,119 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:10:05,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:10:05,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1505171178, now seen corresponding path program 67 times [2019-09-03 21:10:05,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:10:05,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:05,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:10:05,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:05,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:10:05,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:10:06,757 INFO L134 CoverageAnalysis]: Checked inductivity of 17161 backedges. 0 proven. 12871 refuted. 0 times theorem prover too weak. 4290 trivial. 0 not checked. [2019-09-03 21:10:06,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:10:06,757 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:10:06,757 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:10:06,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:10:06,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:10:06,758 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 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:10:06,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:10:06,767 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:10:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:10:06,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-03 21:10:06,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:10:10,008 INFO L134 CoverageAnalysis]: Checked inductivity of 17161 backedges. 8646 proven. 4290 refuted. 0 times theorem prover too weak. 4225 trivial. 0 not checked. [2019-09-03 21:10:10,008 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:10:16,095 INFO L134 CoverageAnalysis]: Checked inductivity of 17161 backedges. 8646 proven. 4290 refuted. 0 times theorem prover too weak. 4225 trivial. 0 not checked. [2019-09-03 21:10:16,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:10:16,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 68, 68] total 204 [2019-09-03 21:10:16,099 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:10:16,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-09-03 21:10:16,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-09-03 21:10:16,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11262, Invalid=30150, Unknown=0, NotChecked=0, Total=41412 [2019-09-03 21:10:16,102 INFO L87 Difference]: Start difference. First operand 274 states and 341 transitions. Second operand 138 states. [2019-09-03 21:10:19,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:10:19,180 INFO L93 Difference]: Finished difference Result 281 states and 349 transitions. [2019-09-03 21:10:19,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2019-09-03 21:10:19,181 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 272 [2019-09-03 21:10:19,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:10:19,182 INFO L225 Difference]: With dead ends: 281 [2019-09-03 21:10:19,182 INFO L226 Difference]: Without dead ends: 278 [2019-09-03 21:10:19,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 683 GetRequests, 413 SyntacticMatches, 0 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11318 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=24536, Invalid=49176, Unknown=0, NotChecked=0, Total=73712 [2019-09-03 21:10:19,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-09-03 21:10:19,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2019-09-03 21:10:19,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-09-03 21:10:19,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 346 transitions. [2019-09-03 21:10:19,187 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 346 transitions. Word has length 272 [2019-09-03 21:10:19,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:10:19,187 INFO L475 AbstractCegarLoop]: Abstraction has 278 states and 346 transitions. [2019-09-03 21:10:19,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-09-03 21:10:19,187 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 346 transitions. [2019-09-03 21:10:19,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-09-03 21:10:19,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:10:19,189 INFO L399 BasicCegarLoop]: trace histogram [133, 67, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:10:19,189 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:10:19,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:10:19,189 INFO L82 PathProgramCache]: Analyzing trace with hash -529211806, now seen corresponding path program 68 times [2019-09-03 21:10:19,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:10:19,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:19,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:10:19,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:19,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:10:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:10:20,926 INFO L134 CoverageAnalysis]: Checked inductivity of 17689 backedges. 0 proven. 13267 refuted. 0 times theorem prover too weak. 4422 trivial. 0 not checked. [2019-09-03 21:10:20,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:10:20,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:10:20,926 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:10:20,926 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:10:20,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:10:20,927 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 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:10:20,937 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:10:20,937 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:10:21,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 134 check-sat command(s) [2019-09-03 21:10:21,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:10:21,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-03 21:10:21,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:10:24,431 INFO L134 CoverageAnalysis]: Checked inductivity of 17689 backedges. 8911 proven. 4422 refuted. 0 times theorem prover too weak. 4356 trivial. 0 not checked. [2019-09-03 21:10:24,431 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:10:30,699 INFO L134 CoverageAnalysis]: Checked inductivity of 17689 backedges. 8911 proven. 4422 refuted. 0 times theorem prover too weak. 4356 trivial. 0 not checked. [2019-09-03 21:10:30,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:10:30,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 69, 69] total 207 [2019-09-03 21:10:30,703 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:10:30,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-09-03 21:10:30,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-09-03 21:10:30,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11600, Invalid=31042, Unknown=0, NotChecked=0, Total=42642 [2019-09-03 21:10:30,706 INFO L87 Difference]: Start difference. First operand 278 states and 346 transitions. Second operand 140 states. [2019-09-03 21:10:33,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:10:33,843 INFO L93 Difference]: Finished difference Result 285 states and 354 transitions. [2019-09-03 21:10:33,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2019-09-03 21:10:33,844 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 276 [2019-09-03 21:10:33,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:10:33,845 INFO L225 Difference]: With dead ends: 285 [2019-09-03 21:10:33,845 INFO L226 Difference]: Without dead ends: 282 [2019-09-03 21:10:33,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 693 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11657 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=25276, Invalid=50624, Unknown=0, NotChecked=0, Total=75900 [2019-09-03 21:10:33,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-03 21:10:33,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2019-09-03 21:10:33,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-09-03 21:10:33,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 351 transitions. [2019-09-03 21:10:33,849 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 351 transitions. Word has length 276 [2019-09-03 21:10:33,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:10:33,849 INFO L475 AbstractCegarLoop]: Abstraction has 282 states and 351 transitions. [2019-09-03 21:10:33,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-09-03 21:10:33,849 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 351 transitions. [2019-09-03 21:10:33,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-09-03 21:10:33,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:10:33,851 INFO L399 BasicCegarLoop]: trace histogram [135, 68, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:10:33,851 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:10:33,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:10:33,851 INFO L82 PathProgramCache]: Analyzing trace with hash -197009062, now seen corresponding path program 69 times [2019-09-03 21:10:33,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:10:33,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:33,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:10:33,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:33,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:10:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:10:35,629 INFO L134 CoverageAnalysis]: Checked inductivity of 18225 backedges. 0 proven. 13669 refuted. 0 times theorem prover too weak. 4556 trivial. 0 not checked. [2019-09-03 21:10:35,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:10:35,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:10:35,630 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:10:35,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:10:35,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:10:35,630 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 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:10:35,639 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:10:35,640 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:10:35,724 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:10:35,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:10:35,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 700 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-03 21:10:35,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:10:39,053 INFO L134 CoverageAnalysis]: Checked inductivity of 18225 backedges. 9180 proven. 4556 refuted. 0 times theorem prover too weak. 4489 trivial. 0 not checked. [2019-09-03 21:10:39,053 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:10:45,504 INFO L134 CoverageAnalysis]: Checked inductivity of 18225 backedges. 9180 proven. 4556 refuted. 0 times theorem prover too weak. 4489 trivial. 0 not checked. [2019-09-03 21:10:45,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:10:45,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 70, 70] total 210 [2019-09-03 21:10:45,507 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:10:45,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-09-03 21:10:45,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-09-03 21:10:45,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11943, Invalid=31947, Unknown=0, NotChecked=0, Total=43890 [2019-09-03 21:10:45,510 INFO L87 Difference]: Start difference. First operand 282 states and 351 transitions. Second operand 142 states. [2019-09-03 21:10:48,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:10:48,706 INFO L93 Difference]: Finished difference Result 289 states and 359 transitions. [2019-09-03 21:10:48,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2019-09-03 21:10:48,706 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 280 [2019-09-03 21:10:48,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:10:48,708 INFO L225 Difference]: With dead ends: 289 [2019-09-03 21:10:48,708 INFO L226 Difference]: Without dead ends: 286 [2019-09-03 21:10:48,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 703 GetRequests, 425 SyntacticMatches, 0 SemanticMatches, 278 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12001 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=26027, Invalid=52093, Unknown=0, NotChecked=0, Total=78120 [2019-09-03 21:10:48,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-09-03 21:10:48,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2019-09-03 21:10:48,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-09-03 21:10:48,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 356 transitions. [2019-09-03 21:10:48,714 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 356 transitions. Word has length 280 [2019-09-03 21:10:48,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:10:48,714 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 356 transitions. [2019-09-03 21:10:48,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-09-03 21:10:48,714 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 356 transitions. [2019-09-03 21:10:48,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-09-03 21:10:48,715 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:10:48,715 INFO L399 BasicCegarLoop]: trace histogram [137, 69, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:10:48,716 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:10:48,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:10:48,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1325694930, now seen corresponding path program 70 times [2019-09-03 21:10:48,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:10:48,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:48,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:10:48,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:48,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:10:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:10:50,548 INFO L134 CoverageAnalysis]: Checked inductivity of 18769 backedges. 0 proven. 14077 refuted. 0 times theorem prover too weak. 4692 trivial. 0 not checked. [2019-09-03 21:10:50,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:10:50,548 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:10:50,549 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:10:50,549 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:10:50,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:10:50,549 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 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:10:50,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:10:50,559 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:10:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:10:50,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 710 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-03 21:10:50,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:10:54,017 INFO L134 CoverageAnalysis]: Checked inductivity of 18769 backedges. 9453 proven. 4692 refuted. 0 times theorem prover too weak. 4624 trivial. 0 not checked. [2019-09-03 21:10:54,017 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:11:00,612 INFO L134 CoverageAnalysis]: Checked inductivity of 18769 backedges. 9453 proven. 4692 refuted. 0 times theorem prover too weak. 4624 trivial. 0 not checked. [2019-09-03 21:11:00,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:11:00,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 71, 71] total 213 [2019-09-03 21:11:00,617 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:11:00,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-09-03 21:11:00,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-09-03 21:11:00,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12291, Invalid=32865, Unknown=0, NotChecked=0, Total=45156 [2019-09-03 21:11:00,620 INFO L87 Difference]: Start difference. First operand 286 states and 356 transitions. Second operand 144 states. [2019-09-03 21:11:04,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:11:04,240 INFO L93 Difference]: Finished difference Result 293 states and 364 transitions. [2019-09-03 21:11:04,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2019-09-03 21:11:04,240 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 284 [2019-09-03 21:11:04,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:11:04,242 INFO L225 Difference]: With dead ends: 293 [2019-09-03 21:11:04,242 INFO L226 Difference]: Without dead ends: 290 [2019-09-03 21:11:04,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 713 GetRequests, 431 SyntacticMatches, 0 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12350 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=26789, Invalid=53583, Unknown=0, NotChecked=0, Total=80372 [2019-09-03 21:11:04,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-03 21:11:04,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2019-09-03 21:11:04,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-09-03 21:11:04,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 361 transitions. [2019-09-03 21:11:04,248 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 361 transitions. Word has length 284 [2019-09-03 21:11:04,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:11:04,248 INFO L475 AbstractCegarLoop]: Abstraction has 290 states and 361 transitions. [2019-09-03 21:11:04,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-09-03 21:11:04,248 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 361 transitions. [2019-09-03 21:11:04,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-09-03 21:11:04,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:11:04,249 INFO L399 BasicCegarLoop]: trace histogram [139, 70, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:11:04,250 INFO L418 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:11:04,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:11:04,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1796531766, now seen corresponding path program 71 times [2019-09-03 21:11:04,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:11:04,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:11:04,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:11:04,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:11:04,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:11:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:11:06,206 INFO L134 CoverageAnalysis]: Checked inductivity of 19321 backedges. 0 proven. 14491 refuted. 0 times theorem prover too weak. 4830 trivial. 0 not checked. [2019-09-03 21:11:06,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:11:06,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:11:06,207 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:11:06,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:11:06,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:11:06,207 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 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:11:06,216 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:11:06,217 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:11:06,447 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 140 check-sat command(s) [2019-09-03 21:11:06,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:11:06,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-03 21:11:06,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:11:09,922 INFO L134 CoverageAnalysis]: Checked inductivity of 19321 backedges. 9730 proven. 4830 refuted. 0 times theorem prover too weak. 4761 trivial. 0 not checked. [2019-09-03 21:11:09,923 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:11:16,723 INFO L134 CoverageAnalysis]: Checked inductivity of 19321 backedges. 9730 proven. 4830 refuted. 0 times theorem prover too weak. 4761 trivial. 0 not checked. [2019-09-03 21:11:16,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:11:16,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 72, 72] total 216 [2019-09-03 21:11:16,727 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:11:16,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-09-03 21:11:16,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-09-03 21:11:16,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12644, Invalid=33796, Unknown=0, NotChecked=0, Total=46440 [2019-09-03 21:11:16,730 INFO L87 Difference]: Start difference. First operand 290 states and 361 transitions. Second operand 146 states. [2019-09-03 21:11:20,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:11:20,433 INFO L93 Difference]: Finished difference Result 297 states and 369 transitions. [2019-09-03 21:11:20,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2019-09-03 21:11:20,434 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 288 [2019-09-03 21:11:20,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:11:20,435 INFO L225 Difference]: With dead ends: 297 [2019-09-03 21:11:20,435 INFO L226 Difference]: Without dead ends: 294 [2019-09-03 21:11:20,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 723 GetRequests, 437 SyntacticMatches, 0 SemanticMatches, 286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12704 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=27562, Invalid=55094, Unknown=0, NotChecked=0, Total=82656 [2019-09-03 21:11:20,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-03 21:11:20,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2019-09-03 21:11:20,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-03 21:11:20,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 366 transitions. [2019-09-03 21:11:20,441 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 366 transitions. Word has length 288 [2019-09-03 21:11:20,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:11:20,441 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 366 transitions. [2019-09-03 21:11:20,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-09-03 21:11:20,442 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 366 transitions. [2019-09-03 21:11:20,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-09-03 21:11:20,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:11:20,443 INFO L399 BasicCegarLoop]: trace histogram [141, 71, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:11:20,443 INFO L418 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:11:20,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:11:20,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1301541054, now seen corresponding path program 72 times [2019-09-03 21:11:20,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:11:20,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:11:20,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:11:20,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:11:20,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:11:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:11:22,350 INFO L134 CoverageAnalysis]: Checked inductivity of 19881 backedges. 0 proven. 14911 refuted. 0 times theorem prover too weak. 4970 trivial. 0 not checked. [2019-09-03 21:11:22,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:11:22,350 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:11:22,350 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:11:22,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:11:22,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:11:22,351 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 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:11:22,361 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:11:22,361 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:11:22,446 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:11:22,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:11:22,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 730 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-03 21:11:22,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:11:26,082 INFO L134 CoverageAnalysis]: Checked inductivity of 19881 backedges. 10011 proven. 4970 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2019-09-03 21:11:26,082 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:11:33,096 INFO L134 CoverageAnalysis]: Checked inductivity of 19881 backedges. 10011 proven. 4970 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2019-09-03 21:11:33,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:11:33,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 73, 73] total 219 [2019-09-03 21:11:33,099 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:11:33,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-09-03 21:11:33,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-09-03 21:11:33,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13002, Invalid=34740, Unknown=0, NotChecked=0, Total=47742 [2019-09-03 21:11:33,103 INFO L87 Difference]: Start difference. First operand 294 states and 366 transitions. Second operand 148 states. [2019-09-03 21:11:36,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:11:36,695 INFO L93 Difference]: Finished difference Result 301 states and 374 transitions. [2019-09-03 21:11:36,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2019-09-03 21:11:36,696 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 292 [2019-09-03 21:11:36,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:11:36,697 INFO L225 Difference]: With dead ends: 301 [2019-09-03 21:11:36,697 INFO L226 Difference]: Without dead ends: 298 [2019-09-03 21:11:36,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 733 GetRequests, 443 SyntacticMatches, 0 SemanticMatches, 290 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13063 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=28346, Invalid=56626, Unknown=0, NotChecked=0, Total=84972 [2019-09-03 21:11:36,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-09-03 21:11:36,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2019-09-03 21:11:36,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-09-03 21:11:36,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 371 transitions. [2019-09-03 21:11:36,703 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 371 transitions. Word has length 292 [2019-09-03 21:11:36,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:11:36,703 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 371 transitions. [2019-09-03 21:11:36,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-09-03 21:11:36,703 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 371 transitions. [2019-09-03 21:11:36,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-09-03 21:11:36,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:11:36,704 INFO L399 BasicCegarLoop]: trace histogram [143, 72, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:11:36,705 INFO L418 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:11:36,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:11:36,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1169833926, now seen corresponding path program 73 times [2019-09-03 21:11:36,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:11:36,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:11:36,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:11:36,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:11:36,706 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:11:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:11:38,715 INFO L134 CoverageAnalysis]: Checked inductivity of 20449 backedges. 0 proven. 15337 refuted. 0 times theorem prover too weak. 5112 trivial. 0 not checked. [2019-09-03 21:11:38,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:11:38,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:11:38,715 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:11:38,715 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:11:38,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:11:38,715 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 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:11:38,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:11:38,726 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:11:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:11:38,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 73 conjunts are in the unsatisfiable core [2019-09-03 21:11:38,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:11:42,551 INFO L134 CoverageAnalysis]: Checked inductivity of 20449 backedges. 10296 proven. 5112 refuted. 0 times theorem prover too weak. 5041 trivial. 0 not checked. [2019-09-03 21:11:42,551 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:11:49,741 INFO L134 CoverageAnalysis]: Checked inductivity of 20449 backedges. 10296 proven. 5112 refuted. 0 times theorem prover too weak. 5041 trivial. 0 not checked. [2019-09-03 21:11:49,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:11:49,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 74, 74] total 222 [2019-09-03 21:11:49,745 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:11:49,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-09-03 21:11:49,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-09-03 21:11:49,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13365, Invalid=35697, Unknown=0, NotChecked=0, Total=49062 [2019-09-03 21:11:49,747 INFO L87 Difference]: Start difference. First operand 298 states and 371 transitions. Second operand 150 states. [2019-09-03 21:11:53,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:11:53,815 INFO L93 Difference]: Finished difference Result 305 states and 379 transitions. [2019-09-03 21:11:53,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2019-09-03 21:11:53,815 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 296 [2019-09-03 21:11:53,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:11:53,816 INFO L225 Difference]: With dead ends: 305 [2019-09-03 21:11:53,817 INFO L226 Difference]: Without dead ends: 302 [2019-09-03 21:11:53,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 743 GetRequests, 449 SyntacticMatches, 0 SemanticMatches, 294 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13427 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=29141, Invalid=58179, Unknown=0, NotChecked=0, Total=87320 [2019-09-03 21:11:53,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-09-03 21:11:53,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2019-09-03 21:11:53,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-09-03 21:11:53,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 376 transitions. [2019-09-03 21:11:53,823 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 376 transitions. Word has length 296 [2019-09-03 21:11:53,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:11:53,823 INFO L475 AbstractCegarLoop]: Abstraction has 302 states and 376 transitions. [2019-09-03 21:11:53,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-09-03 21:11:53,823 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 376 transitions. [2019-09-03 21:11:53,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-03 21:11:53,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:11:53,824 INFO L399 BasicCegarLoop]: trace histogram [145, 73, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:11:53,825 INFO L418 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:11:53,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:11:53,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1132367026, now seen corresponding path program 74 times [2019-09-03 21:11:53,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:11:53,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:11:53,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:11:53,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:11:53,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:11:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:11:55,883 INFO L134 CoverageAnalysis]: Checked inductivity of 21025 backedges. 0 proven. 15769 refuted. 0 times theorem prover too weak. 5256 trivial. 0 not checked. [2019-09-03 21:11:55,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:11:55,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:11:55,883 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:11:55,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:11:55,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:11:55,883 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 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:11:55,893 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:11:55,893 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:11:56,141 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 146 check-sat command(s) [2019-09-03 21:11:56,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:11:56,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-03 21:11:56,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:11:59,945 INFO L134 CoverageAnalysis]: Checked inductivity of 21025 backedges. 10585 proven. 5256 refuted. 0 times theorem prover too weak. 5184 trivial. 0 not checked. [2019-09-03 21:11:59,945 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:12:07,315 INFO L134 CoverageAnalysis]: Checked inductivity of 21025 backedges. 10585 proven. 5256 refuted. 0 times theorem prover too weak. 5184 trivial. 0 not checked. [2019-09-03 21:12:07,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:12:07,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 75, 75] total 225 [2019-09-03 21:12:07,319 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:12:07,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-09-03 21:12:07,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-09-03 21:12:07,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13733, Invalid=36667, Unknown=0, NotChecked=0, Total=50400 [2019-09-03 21:12:07,322 INFO L87 Difference]: Start difference. First operand 302 states and 376 transitions. Second operand 152 states. [2019-09-03 21:12:11,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:12:11,284 INFO L93 Difference]: Finished difference Result 309 states and 384 transitions. [2019-09-03 21:12:11,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2019-09-03 21:12:11,285 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 300 [2019-09-03 21:12:11,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:12:11,286 INFO L225 Difference]: With dead ends: 309 [2019-09-03 21:12:11,286 INFO L226 Difference]: Without dead ends: 306 [2019-09-03 21:12:11,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 753 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 298 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13796 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=29947, Invalid=59753, Unknown=0, NotChecked=0, Total=89700 [2019-09-03 21:12:11,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-09-03 21:12:11,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2019-09-03 21:12:11,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-09-03 21:12:11,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 381 transitions. [2019-09-03 21:12:11,292 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 381 transitions. Word has length 300 [2019-09-03 21:12:11,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:12:11,292 INFO L475 AbstractCegarLoop]: Abstraction has 306 states and 381 transitions. [2019-09-03 21:12:11,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-09-03 21:12:11,292 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 381 transitions. [2019-09-03 21:12:11,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-03 21:12:11,294 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:12:11,294 INFO L399 BasicCegarLoop]: trace histogram [147, 74, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:12:11,294 INFO L418 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:12:11,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:12:11,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1197790378, now seen corresponding path program 75 times [2019-09-03 21:12:11,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:12:11,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:12:11,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:12:11,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:12:11,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:12:11,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:12:13,474 INFO L134 CoverageAnalysis]: Checked inductivity of 21609 backedges. 0 proven. 16207 refuted. 0 times theorem prover too weak. 5402 trivial. 0 not checked. [2019-09-03 21:12:13,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:12:13,474 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:12:13,474 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:12:13,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:12:13,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:12:13,475 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 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:12:13,485 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:12:13,485 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:12:13,574 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:12:13,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:12:13,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 75 conjunts are in the unsatisfiable core [2019-09-03 21:12:13,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:12:17,472 INFO L134 CoverageAnalysis]: Checked inductivity of 21609 backedges. 10878 proven. 5402 refuted. 0 times theorem prover too weak. 5329 trivial. 0 not checked. [2019-09-03 21:12:17,472 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:12:25,025 INFO L134 CoverageAnalysis]: Checked inductivity of 21609 backedges. 10878 proven. 5402 refuted. 0 times theorem prover too weak. 5329 trivial. 0 not checked. [2019-09-03 21:12:25,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:12:25,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 76, 76] total 228 [2019-09-03 21:12:25,028 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:12:25,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-09-03 21:12:25,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-09-03 21:12:25,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14106, Invalid=37650, Unknown=0, NotChecked=0, Total=51756 [2019-09-03 21:12:25,032 INFO L87 Difference]: Start difference. First operand 306 states and 381 transitions. Second operand 154 states. [2019-09-03 21:12:29,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:12:29,012 INFO L93 Difference]: Finished difference Result 313 states and 389 transitions. [2019-09-03 21:12:29,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2019-09-03 21:12:29,013 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 304 [2019-09-03 21:12:29,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:12:29,014 INFO L225 Difference]: With dead ends: 313 [2019-09-03 21:12:29,014 INFO L226 Difference]: Without dead ends: 310 [2019-09-03 21:12:29,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 763 GetRequests, 461 SyntacticMatches, 0 SemanticMatches, 302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14170 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=30764, Invalid=61348, Unknown=0, NotChecked=0, Total=92112 [2019-09-03 21:12:29,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-03 21:12:29,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2019-09-03 21:12:29,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-03 21:12:29,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 386 transitions. [2019-09-03 21:12:29,019 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 386 transitions. Word has length 304 [2019-09-03 21:12:29,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:12:29,019 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 386 transitions. [2019-09-03 21:12:29,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-09-03 21:12:29,019 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 386 transitions. [2019-09-03 21:12:29,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-03 21:12:29,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:12:29,021 INFO L399 BasicCegarLoop]: trace histogram [149, 75, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:12:29,021 INFO L418 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:12:29,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:12:29,021 INFO L82 PathProgramCache]: Analyzing trace with hash 2140076066, now seen corresponding path program 76 times [2019-09-03 21:12:29,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:12:29,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:12:29,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:12:29,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:12:29,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:12:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:12:31,192 INFO L134 CoverageAnalysis]: Checked inductivity of 22201 backedges. 0 proven. 16651 refuted. 0 times theorem prover too weak. 5550 trivial. 0 not checked. [2019-09-03 21:12:31,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:12:31,192 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:12:31,192 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:12:31,192 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:12:31,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:12:31,193 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 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:12:31,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:12:31,202 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:12:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:12:31,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-03 21:12:31,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:12:35,302 INFO L134 CoverageAnalysis]: Checked inductivity of 22201 backedges. 11175 proven. 5550 refuted. 0 times theorem prover too weak. 5476 trivial. 0 not checked. [2019-09-03 21:12:35,302 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:12:43,125 INFO L134 CoverageAnalysis]: Checked inductivity of 22201 backedges. 11175 proven. 5550 refuted. 0 times theorem prover too weak. 5476 trivial. 0 not checked. [2019-09-03 21:12:43,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:12:43,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 77, 77] total 231 [2019-09-03 21:12:43,129 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:12:43,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-09-03 21:12:43,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-09-03 21:12:43,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14484, Invalid=38646, Unknown=0, NotChecked=0, Total=53130 [2019-09-03 21:12:43,132 INFO L87 Difference]: Start difference. First operand 310 states and 386 transitions. Second operand 156 states. [2019-09-03 21:12:47,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:12:47,376 INFO L93 Difference]: Finished difference Result 317 states and 394 transitions. [2019-09-03 21:12:47,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2019-09-03 21:12:47,377 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 308 [2019-09-03 21:12:47,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:12:47,378 INFO L225 Difference]: With dead ends: 317 [2019-09-03 21:12:47,378 INFO L226 Difference]: Without dead ends: 314 [2019-09-03 21:12:47,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 773 GetRequests, 467 SyntacticMatches, 0 SemanticMatches, 306 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14549 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=31592, Invalid=62964, Unknown=0, NotChecked=0, Total=94556 [2019-09-03 21:12:47,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-03 21:12:47,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2019-09-03 21:12:47,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-09-03 21:12:47,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 391 transitions. [2019-09-03 21:12:47,384 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 391 transitions. Word has length 308 [2019-09-03 21:12:47,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:12:47,384 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 391 transitions. [2019-09-03 21:12:47,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-09-03 21:12:47,384 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 391 transitions. [2019-09-03 21:12:47,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-03 21:12:47,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:12:47,385 INFO L399 BasicCegarLoop]: trace histogram [151, 76, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:12:47,386 INFO L418 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:12:47,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:12:47,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1138448154, now seen corresponding path program 77 times [2019-09-03 21:12:47,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:12:47,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:12:47,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:12:47,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:12:47,387 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:12:47,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:12:49,569 INFO L134 CoverageAnalysis]: Checked inductivity of 22801 backedges. 0 proven. 17101 refuted. 0 times theorem prover too weak. 5700 trivial. 0 not checked. [2019-09-03 21:12:49,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:12:49,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:12:49,569 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:12:49,569 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:12:49,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:12:49,569 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 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:12:49,580 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:12:49,580 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:12:49,843 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 152 check-sat command(s) [2019-09-03 21:12:49,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:12:49,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 780 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-03 21:12:49,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:12:53,974 INFO L134 CoverageAnalysis]: Checked inductivity of 22801 backedges. 11476 proven. 5700 refuted. 0 times theorem prover too weak. 5625 trivial. 0 not checked. [2019-09-03 21:12:53,974 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:13:01,949 INFO L134 CoverageAnalysis]: Checked inductivity of 22801 backedges. 11476 proven. 5700 refuted. 0 times theorem prover too weak. 5625 trivial. 0 not checked. [2019-09-03 21:13:01,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:13:01,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 78, 78] total 234 [2019-09-03 21:13:01,953 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:13:01,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-09-03 21:13:01,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-09-03 21:13:01,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14867, Invalid=39655, Unknown=0, NotChecked=0, Total=54522 [2019-09-03 21:13:01,955 INFO L87 Difference]: Start difference. First operand 314 states and 391 transitions. Second operand 158 states. [2019-09-03 21:13:06,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:13:06,395 INFO L93 Difference]: Finished difference Result 321 states and 399 transitions. [2019-09-03 21:13:06,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2019-09-03 21:13:06,396 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 312 [2019-09-03 21:13:06,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:13:06,398 INFO L225 Difference]: With dead ends: 321 [2019-09-03 21:13:06,398 INFO L226 Difference]: Without dead ends: 318 [2019-09-03 21:13:06,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 783 GetRequests, 473 SyntacticMatches, 0 SemanticMatches, 310 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14933 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=32431, Invalid=64601, Unknown=0, NotChecked=0, Total=97032 [2019-09-03 21:13:06,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-03 21:13:06,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2019-09-03 21:13:06,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-09-03 21:13:06,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 396 transitions. [2019-09-03 21:13:06,405 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 396 transitions. Word has length 312 [2019-09-03 21:13:06,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:13:06,405 INFO L475 AbstractCegarLoop]: Abstraction has 318 states and 396 transitions. [2019-09-03 21:13:06,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-09-03 21:13:06,405 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 396 transitions. [2019-09-03 21:13:06,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-03 21:13:06,406 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:13:06,406 INFO L399 BasicCegarLoop]: trace histogram [153, 77, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:13:06,407 INFO L418 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:13:06,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:13:06,407 INFO L82 PathProgramCache]: Analyzing trace with hash -395292270, now seen corresponding path program 78 times [2019-09-03 21:13:06,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:13:06,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:13:06,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:13:06,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:13:06,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:13:06,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:13:08,672 INFO L134 CoverageAnalysis]: Checked inductivity of 23409 backedges. 0 proven. 17557 refuted. 0 times theorem prover too weak. 5852 trivial. 0 not checked. [2019-09-03 21:13:08,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:13:08,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:13:08,673 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:13:08,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:13:08,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:13:08,673 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 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:13:08,682 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:13:08,682 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:13:08,774 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:13:08,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:13:08,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-03 21:13:08,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:13:12,983 INFO L134 CoverageAnalysis]: Checked inductivity of 23409 backedges. 11781 proven. 5852 refuted. 0 times theorem prover too weak. 5776 trivial. 0 not checked. [2019-09-03 21:13:12,983 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:13:21,207 INFO L134 CoverageAnalysis]: Checked inductivity of 23409 backedges. 11781 proven. 5852 refuted. 0 times theorem prover too weak. 5776 trivial. 0 not checked. [2019-09-03 21:13:21,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:13:21,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 79, 79] total 237 [2019-09-03 21:13:21,211 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:13:21,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-09-03 21:13:21,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-09-03 21:13:21,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15255, Invalid=40677, Unknown=0, NotChecked=0, Total=55932 [2019-09-03 21:13:21,213 INFO L87 Difference]: Start difference. First operand 318 states and 396 transitions. Second operand 160 states. [2019-09-03 21:13:25,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:13:25,635 INFO L93 Difference]: Finished difference Result 325 states and 404 transitions. [2019-09-03 21:13:25,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2019-09-03 21:13:25,635 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 316 [2019-09-03 21:13:25,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:13:25,636 INFO L225 Difference]: With dead ends: 325 [2019-09-03 21:13:25,637 INFO L226 Difference]: Without dead ends: 322 [2019-09-03 21:13:25,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 793 GetRequests, 479 SyntacticMatches, 0 SemanticMatches, 314 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15322 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=33281, Invalid=66259, Unknown=0, NotChecked=0, Total=99540 [2019-09-03 21:13:25,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-03 21:13:25,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2019-09-03 21:13:25,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-09-03 21:13:25,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 401 transitions. [2019-09-03 21:13:25,643 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 401 transitions. Word has length 316 [2019-09-03 21:13:25,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:13:25,643 INFO L475 AbstractCegarLoop]: Abstraction has 322 states and 401 transitions. [2019-09-03 21:13:25,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-09-03 21:13:25,643 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 401 transitions. [2019-09-03 21:13:25,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-03 21:13:25,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:13:25,644 INFO L399 BasicCegarLoop]: trace histogram [155, 78, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:13:25,644 INFO L418 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:13:25,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:13:25,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1682159734, now seen corresponding path program 79 times [2019-09-03 21:13:25,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:13:25,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:13:25,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:13:25,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:13:25,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:13:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:13:27,972 INFO L134 CoverageAnalysis]: Checked inductivity of 24025 backedges. 0 proven. 18019 refuted. 0 times theorem prover too weak. 6006 trivial. 0 not checked. [2019-09-03 21:13:27,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:13:27,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:13:27,972 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:13:27,972 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:13:27,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:13:27,973 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 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:13:27,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:13:27,982 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:13:28,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:13:28,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 800 conjuncts, 79 conjunts are in the unsatisfiable core [2019-09-03 21:13:28,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:13:32,374 INFO L134 CoverageAnalysis]: Checked inductivity of 24025 backedges. 12090 proven. 6006 refuted. 0 times theorem prover too weak. 5929 trivial. 0 not checked. [2019-09-03 21:13:32,374 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:13:40,846 INFO L134 CoverageAnalysis]: Checked inductivity of 24025 backedges. 12090 proven. 6006 refuted. 0 times theorem prover too weak. 5929 trivial. 0 not checked. [2019-09-03 21:13:40,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:13:40,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 80, 80] total 240 [2019-09-03 21:13:40,850 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:13:40,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-09-03 21:13:40,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-09-03 21:13:40,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15648, Invalid=41712, Unknown=0, NotChecked=0, Total=57360 [2019-09-03 21:13:40,854 INFO L87 Difference]: Start difference. First operand 322 states and 401 transitions. Second operand 162 states. [2019-09-03 21:13:45,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:13:45,444 INFO L93 Difference]: Finished difference Result 329 states and 409 transitions. [2019-09-03 21:13:45,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2019-09-03 21:13:45,444 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 320 [2019-09-03 21:13:45,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:13:45,446 INFO L225 Difference]: With dead ends: 329 [2019-09-03 21:13:45,446 INFO L226 Difference]: Without dead ends: 326 [2019-09-03 21:13:45,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 803 GetRequests, 485 SyntacticMatches, 0 SemanticMatches, 318 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15716 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=34142, Invalid=67938, Unknown=0, NotChecked=0, Total=102080 [2019-09-03 21:13:45,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-09-03 21:13:45,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2019-09-03 21:13:45,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-09-03 21:13:45,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 406 transitions. [2019-09-03 21:13:45,453 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 406 transitions. Word has length 320 [2019-09-03 21:13:45,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:13:45,453 INFO L475 AbstractCegarLoop]: Abstraction has 326 states and 406 transitions. [2019-09-03 21:13:45,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-09-03 21:13:45,454 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 406 transitions. [2019-09-03 21:13:45,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-03 21:13:45,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:13:45,455 INFO L399 BasicCegarLoop]: trace histogram [157, 79, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:13:45,455 INFO L418 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:13:45,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:13:45,455 INFO L82 PathProgramCache]: Analyzing trace with hash -998926078, now seen corresponding path program 80 times [2019-09-03 21:13:45,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:13:45,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:13:45,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:13:45,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:13:45,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:13:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:13:47,927 INFO L134 CoverageAnalysis]: Checked inductivity of 24649 backedges. 0 proven. 18487 refuted. 0 times theorem prover too weak. 6162 trivial. 0 not checked. [2019-09-03 21:13:47,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:13:47,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:13:47,927 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:13:47,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:13:47,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:13:47,927 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 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:13:47,939 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:13:47,939 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:13:48,223 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 158 check-sat command(s) [2019-09-03 21:13:48,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:13:48,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-03 21:13:48,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:13:52,604 INFO L134 CoverageAnalysis]: Checked inductivity of 24649 backedges. 12403 proven. 6162 refuted. 0 times theorem prover too weak. 6084 trivial. 0 not checked. [2019-09-03 21:13:52,604 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:14:01,127 INFO L134 CoverageAnalysis]: Checked inductivity of 24649 backedges. 12403 proven. 6162 refuted. 0 times theorem prover too weak. 6084 trivial. 0 not checked. [2019-09-03 21:14:01,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:14:01,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 81, 81] total 243 [2019-09-03 21:14:01,131 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:14:01,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-09-03 21:14:01,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-09-03 21:14:01,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16046, Invalid=42760, Unknown=0, NotChecked=0, Total=58806 [2019-09-03 21:14:01,135 INFO L87 Difference]: Start difference. First operand 326 states and 406 transitions. Second operand 164 states. [2019-09-03 21:14:05,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:14:05,674 INFO L93 Difference]: Finished difference Result 333 states and 414 transitions. [2019-09-03 21:14:05,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2019-09-03 21:14:05,674 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 324 [2019-09-03 21:14:05,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:14:05,675 INFO L225 Difference]: With dead ends: 333 [2019-09-03 21:14:05,675 INFO L226 Difference]: Without dead ends: 330 [2019-09-03 21:14:05,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 813 GetRequests, 491 SyntacticMatches, 0 SemanticMatches, 322 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16115 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=35014, Invalid=69638, Unknown=0, NotChecked=0, Total=104652 [2019-09-03 21:14:05,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-03 21:14:05,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2019-09-03 21:14:05,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-09-03 21:14:05,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 411 transitions. [2019-09-03 21:14:05,682 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 411 transitions. Word has length 324 [2019-09-03 21:14:05,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:14:05,683 INFO L475 AbstractCegarLoop]: Abstraction has 330 states and 411 transitions. [2019-09-03 21:14:05,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-09-03 21:14:05,683 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 411 transitions. [2019-09-03 21:14:05,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-03 21:14:05,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:14:05,684 INFO L399 BasicCegarLoop]: trace histogram [159, 80, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:14:05,684 INFO L418 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:14:05,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:14:05,685 INFO L82 PathProgramCache]: Analyzing trace with hash -543513094, now seen corresponding path program 81 times [2019-09-03 21:14:05,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:14:05,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:14:05,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:14:05,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:14:05,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:14:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:14:08,090 INFO L134 CoverageAnalysis]: Checked inductivity of 25281 backedges. 0 proven. 18961 refuted. 0 times theorem prover too weak. 6320 trivial. 0 not checked. [2019-09-03 21:14:08,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:14:08,090 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:14:08,090 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:14:08,090 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:14:08,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:14:08,090 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 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:14:08,125 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:14:08,125 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:14:08,220 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:14:08,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:14:08,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 820 conjuncts, 81 conjunts are in the unsatisfiable core [2019-09-03 21:14:08,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:14:12,727 INFO L134 CoverageAnalysis]: Checked inductivity of 25281 backedges. 12720 proven. 6320 refuted. 0 times theorem prover too weak. 6241 trivial. 0 not checked. [2019-09-03 21:14:12,727 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:14:21,445 INFO L134 CoverageAnalysis]: Checked inductivity of 25281 backedges. 12720 proven. 6320 refuted. 0 times theorem prover too weak. 6241 trivial. 0 not checked. [2019-09-03 21:14:21,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:14:21,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 82, 82] total 246 [2019-09-03 21:14:21,449 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:14:21,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-09-03 21:14:21,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-09-03 21:14:21,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16449, Invalid=43821, Unknown=0, NotChecked=0, Total=60270 [2019-09-03 21:14:21,451 INFO L87 Difference]: Start difference. First operand 330 states and 411 transitions. Second operand 166 states. [2019-09-03 21:14:26,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:14:26,562 INFO L93 Difference]: Finished difference Result 337 states and 419 transitions. [2019-09-03 21:14:26,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2019-09-03 21:14:26,563 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 328 [2019-09-03 21:14:26,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:14:26,564 INFO L225 Difference]: With dead ends: 337 [2019-09-03 21:14:26,564 INFO L226 Difference]: Without dead ends: 334 [2019-09-03 21:14:26,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 823 GetRequests, 497 SyntacticMatches, 0 SemanticMatches, 326 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16519 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=35897, Invalid=71359, Unknown=0, NotChecked=0, Total=107256 [2019-09-03 21:14:26,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-09-03 21:14:26,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2019-09-03 21:14:26,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-09-03 21:14:26,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 416 transitions. [2019-09-03 21:14:26,570 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 416 transitions. Word has length 328 [2019-09-03 21:14:26,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:14:26,571 INFO L475 AbstractCegarLoop]: Abstraction has 334 states and 416 transitions. [2019-09-03 21:14:26,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-09-03 21:14:26,571 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 416 transitions. [2019-09-03 21:14:26,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-03 21:14:26,572 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:14:26,572 INFO L399 BasicCegarLoop]: trace histogram [161, 81, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:14:26,572 INFO L418 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:14:26,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:14:26,573 INFO L82 PathProgramCache]: Analyzing trace with hash -562966926, now seen corresponding path program 82 times [2019-09-03 21:14:26,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:14:26,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:14:26,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:14:26,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:14:26,574 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:14:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:14:29,097 INFO L134 CoverageAnalysis]: Checked inductivity of 25921 backedges. 0 proven. 19441 refuted. 0 times theorem prover too weak. 6480 trivial. 0 not checked. [2019-09-03 21:14:29,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:14:29,097 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:14:29,097 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:14:29,097 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:14:29,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:14:29,097 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 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:14:29,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:14:29,107 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:14:29,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:14:29,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 830 conjuncts, 82 conjunts are in the unsatisfiable core [2019-09-03 21:14:29,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:14:33,826 INFO L134 CoverageAnalysis]: Checked inductivity of 25921 backedges. 13041 proven. 6480 refuted. 0 times theorem prover too weak. 6400 trivial. 0 not checked. [2019-09-03 21:14:33,827 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:14:42,787 INFO L134 CoverageAnalysis]: Checked inductivity of 25921 backedges. 13041 proven. 6480 refuted. 0 times theorem prover too weak. 6400 trivial. 0 not checked. [2019-09-03 21:14:42,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:14:42,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 83, 83] total 249 [2019-09-03 21:14:42,790 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:14:42,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-09-03 21:14:42,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-09-03 21:14:42,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16857, Invalid=44895, Unknown=0, NotChecked=0, Total=61752 [2019-09-03 21:14:42,794 INFO L87 Difference]: Start difference. First operand 334 states and 416 transitions. Second operand 168 states. [2019-09-03 21:14:47,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:14:47,976 INFO L93 Difference]: Finished difference Result 341 states and 424 transitions. [2019-09-03 21:14:47,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2019-09-03 21:14:47,976 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 332 [2019-09-03 21:14:47,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:14:47,977 INFO L225 Difference]: With dead ends: 341 [2019-09-03 21:14:47,977 INFO L226 Difference]: Without dead ends: 338 [2019-09-03 21:14:47,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 833 GetRequests, 503 SyntacticMatches, 0 SemanticMatches, 330 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16928 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=36791, Invalid=73101, Unknown=0, NotChecked=0, Total=109892 [2019-09-03 21:14:47,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-09-03 21:14:47,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2019-09-03 21:14:47,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2019-09-03 21:14:47,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 421 transitions. [2019-09-03 21:14:47,984 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 421 transitions. Word has length 332 [2019-09-03 21:14:47,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:14:47,985 INFO L475 AbstractCegarLoop]: Abstraction has 338 states and 421 transitions. [2019-09-03 21:14:47,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-09-03 21:14:47,985 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 421 transitions. [2019-09-03 21:14:47,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-03 21:14:47,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:14:47,986 INFO L399 BasicCegarLoop]: trace histogram [163, 82, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:14:47,987 INFO L418 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:14:47,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:14:47,987 INFO L82 PathProgramCache]: Analyzing trace with hash 76116586, now seen corresponding path program 83 times [2019-09-03 21:14:47,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:14:47,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:14:47,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:14:47,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:14:47,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:14:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:14:50,441 INFO L134 CoverageAnalysis]: Checked inductivity of 26569 backedges. 0 proven. 19927 refuted. 0 times theorem prover too weak. 6642 trivial. 0 not checked. [2019-09-03 21:14:50,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:14:50,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:14:50,442 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:14:50,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:14:50,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:14:50,442 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 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:14:50,452 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:14:50,452 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:14:50,757 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 164 check-sat command(s) [2019-09-03 21:14:50,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:14:50,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 840 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-03 21:14:50,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:14:55,506 INFO L134 CoverageAnalysis]: Checked inductivity of 26569 backedges. 13366 proven. 6642 refuted. 0 times theorem prover too weak. 6561 trivial. 0 not checked. [2019-09-03 21:14:55,506 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:15:04,654 INFO L134 CoverageAnalysis]: Checked inductivity of 26569 backedges. 13366 proven. 6642 refuted. 0 times theorem prover too weak. 6561 trivial. 0 not checked. [2019-09-03 21:15:04,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:15:04,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 84, 84] total 252 [2019-09-03 21:15:04,658 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:15:04,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-09-03 21:15:04,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-09-03 21:15:04,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17270, Invalid=45982, Unknown=0, NotChecked=0, Total=63252 [2019-09-03 21:15:04,663 INFO L87 Difference]: Start difference. First operand 338 states and 421 transitions. Second operand 170 states. [2019-09-03 21:15:10,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:15:10,631 INFO L93 Difference]: Finished difference Result 345 states and 429 transitions. [2019-09-03 21:15:10,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2019-09-03 21:15:10,632 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 336 [2019-09-03 21:15:10,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:15:10,633 INFO L225 Difference]: With dead ends: 345 [2019-09-03 21:15:10,633 INFO L226 Difference]: Without dead ends: 342 [2019-09-03 21:15:10,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 843 GetRequests, 509 SyntacticMatches, 0 SemanticMatches, 334 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17342 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=37696, Invalid=74864, Unknown=0, NotChecked=0, Total=112560 [2019-09-03 21:15:10,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-09-03 21:15:10,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2019-09-03 21:15:10,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-09-03 21:15:10,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 426 transitions. [2019-09-03 21:15:10,641 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 426 transitions. Word has length 336 [2019-09-03 21:15:10,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:15:10,641 INFO L475 AbstractCegarLoop]: Abstraction has 342 states and 426 transitions. [2019-09-03 21:15:10,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-09-03 21:15:10,641 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 426 transitions. [2019-09-03 21:15:10,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-09-03 21:15:10,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:15:10,643 INFO L399 BasicCegarLoop]: trace histogram [165, 83, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:15:10,643 INFO L418 AbstractCegarLoop]: === Iteration 87 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:15:10,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:15:10,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1169682914, now seen corresponding path program 84 times [2019-09-03 21:15:10,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:15:10,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:15:10,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:15:10,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:15:10,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:15:10,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:15:13,288 INFO L134 CoverageAnalysis]: Checked inductivity of 27225 backedges. 0 proven. 20419 refuted. 0 times theorem prover too weak. 6806 trivial. 0 not checked. [2019-09-03 21:15:13,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:15:13,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:15:13,289 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:15:13,289 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:15:13,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:15:13,289 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 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:15:13,300 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:15:13,300 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:15:13,401 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:15:13,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:15:13,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 850 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-03 21:15:13,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:15:18,361 INFO L134 CoverageAnalysis]: Checked inductivity of 27225 backedges. 13695 proven. 6806 refuted. 0 times theorem prover too weak. 6724 trivial. 0 not checked. [2019-09-03 21:15:18,361 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:15:27,871 INFO L134 CoverageAnalysis]: Checked inductivity of 27225 backedges. 13695 proven. 6806 refuted. 0 times theorem prover too weak. 6724 trivial. 0 not checked. [2019-09-03 21:15:27,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:15:27,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 85, 85] total 255 [2019-09-03 21:15:27,875 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:15:27,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-09-03 21:15:27,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-09-03 21:15:27,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17688, Invalid=47082, Unknown=0, NotChecked=0, Total=64770 [2019-09-03 21:15:27,880 INFO L87 Difference]: Start difference. First operand 342 states and 426 transitions. Second operand 172 states. [2019-09-03 21:15:33,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:15:33,505 INFO L93 Difference]: Finished difference Result 349 states and 434 transitions. [2019-09-03 21:15:33,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2019-09-03 21:15:33,505 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 340 [2019-09-03 21:15:33,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:15:33,507 INFO L225 Difference]: With dead ends: 349 [2019-09-03 21:15:33,507 INFO L226 Difference]: Without dead ends: 346 [2019-09-03 21:15:33,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 853 GetRequests, 515 SyntacticMatches, 0 SemanticMatches, 338 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17761 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=38612, Invalid=76648, Unknown=0, NotChecked=0, Total=115260 [2019-09-03 21:15:33,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-09-03 21:15:33,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2019-09-03 21:15:33,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-09-03 21:15:33,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 431 transitions. [2019-09-03 21:15:33,513 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 431 transitions. Word has length 340 [2019-09-03 21:15:33,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:15:33,513 INFO L475 AbstractCegarLoop]: Abstraction has 346 states and 431 transitions. [2019-09-03 21:15:33,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-09-03 21:15:33,513 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 431 transitions. [2019-09-03 21:15:33,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-09-03 21:15:33,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:15:33,515 INFO L399 BasicCegarLoop]: trace histogram [167, 84, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:15:33,515 INFO L418 AbstractCegarLoop]: === Iteration 88 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:15:33,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:15:33,515 INFO L82 PathProgramCache]: Analyzing trace with hash 605793498, now seen corresponding path program 85 times [2019-09-03 21:15:33,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:15:33,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:15:33,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:15:33,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:15:33,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:15:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:15:36,102 INFO L134 CoverageAnalysis]: Checked inductivity of 27889 backedges. 0 proven. 20917 refuted. 0 times theorem prover too weak. 6972 trivial. 0 not checked. [2019-09-03 21:15:36,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:15:36,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:15:36,103 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:15:36,103 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:15:36,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:15:36,103 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 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:15:36,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:15:36,112 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:15:36,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:15:36,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 860 conjuncts, 85 conjunts are in the unsatisfiable core [2019-09-03 21:15:36,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:15:41,235 INFO L134 CoverageAnalysis]: Checked inductivity of 27889 backedges. 14028 proven. 6972 refuted. 0 times theorem prover too weak. 6889 trivial. 0 not checked. [2019-09-03 21:15:41,236 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:15:50,833 INFO L134 CoverageAnalysis]: Checked inductivity of 27889 backedges. 14028 proven. 6972 refuted. 0 times theorem prover too weak. 6889 trivial. 0 not checked. [2019-09-03 21:15:50,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:15:50,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 86, 86] total 258 [2019-09-03 21:15:50,837 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:15:50,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 174 states [2019-09-03 21:15:50,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2019-09-03 21:15:50,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18111, Invalid=48195, Unknown=0, NotChecked=0, Total=66306 [2019-09-03 21:15:50,842 INFO L87 Difference]: Start difference. First operand 346 states and 431 transitions. Second operand 174 states. [2019-09-03 21:15:56,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:15:56,021 INFO L93 Difference]: Finished difference Result 353 states and 439 transitions. [2019-09-03 21:15:56,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2019-09-03 21:15:56,022 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 344 [2019-09-03 21:15:56,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:15:56,023 INFO L225 Difference]: With dead ends: 353 [2019-09-03 21:15:56,023 INFO L226 Difference]: Without dead ends: 350 [2019-09-03 21:15:56,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 863 GetRequests, 521 SyntacticMatches, 0 SemanticMatches, 342 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18185 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=39539, Invalid=78453, Unknown=0, NotChecked=0, Total=117992 [2019-09-03 21:15:56,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-09-03 21:15:56,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2019-09-03 21:15:56,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-09-03 21:15:56,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 436 transitions. [2019-09-03 21:15:56,030 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 436 transitions. Word has length 344 [2019-09-03 21:15:56,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:15:56,031 INFO L475 AbstractCegarLoop]: Abstraction has 350 states and 436 transitions. [2019-09-03 21:15:56,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 174 states. [2019-09-03 21:15:56,031 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 436 transitions. [2019-09-03 21:15:56,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-09-03 21:15:56,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:15:56,032 INFO L399 BasicCegarLoop]: trace histogram [169, 85, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:15:56,032 INFO L418 AbstractCegarLoop]: === Iteration 89 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:15:56,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:15:56,033 INFO L82 PathProgramCache]: Analyzing trace with hash 236651346, now seen corresponding path program 86 times [2019-09-03 21:15:56,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:15:56,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:15:56,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:15:56,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:15:56,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:15:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:15:58,833 INFO L134 CoverageAnalysis]: Checked inductivity of 28561 backedges. 0 proven. 21421 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2019-09-03 21:15:58,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:15:58,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:15:58,834 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:15:58,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:15:58,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:15:58,834 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 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:15:58,845 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:15:58,845 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:15:59,191 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 170 check-sat command(s) [2019-09-03 21:15:59,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:15:59,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 870 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-03 21:15:59,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:16:04,272 INFO L134 CoverageAnalysis]: Checked inductivity of 28561 backedges. 14365 proven. 7140 refuted. 0 times theorem prover too weak. 7056 trivial. 0 not checked. [2019-09-03 21:16:04,272 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:16:14,079 INFO L134 CoverageAnalysis]: Checked inductivity of 28561 backedges. 14365 proven. 7140 refuted. 0 times theorem prover too weak. 7056 trivial. 0 not checked. [2019-09-03 21:16:14,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:16:14,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 87, 87] total 261 [2019-09-03 21:16:14,083 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:16:14,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 176 states [2019-09-03 21:16:14,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2019-09-03 21:16:14,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18539, Invalid=49321, Unknown=0, NotChecked=0, Total=67860 [2019-09-03 21:16:14,086 INFO L87 Difference]: Start difference. First operand 350 states and 436 transitions. Second operand 176 states. [2019-09-03 21:16:19,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:16:19,660 INFO L93 Difference]: Finished difference Result 357 states and 444 transitions. [2019-09-03 21:16:19,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2019-09-03 21:16:19,660 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 348 [2019-09-03 21:16:19,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:16:19,661 INFO L225 Difference]: With dead ends: 357 [2019-09-03 21:16:19,662 INFO L226 Difference]: Without dead ends: 354 [2019-09-03 21:16:19,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 873 GetRequests, 527 SyntacticMatches, 0 SemanticMatches, 346 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18614 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=40477, Invalid=80279, Unknown=0, NotChecked=0, Total=120756 [2019-09-03 21:16:19,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-09-03 21:16:19,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2019-09-03 21:16:19,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-09-03 21:16:19,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 441 transitions. [2019-09-03 21:16:19,669 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 441 transitions. Word has length 348 [2019-09-03 21:16:19,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:16:19,669 INFO L475 AbstractCegarLoop]: Abstraction has 354 states and 441 transitions. [2019-09-03 21:16:19,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 176 states. [2019-09-03 21:16:19,670 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 441 transitions. [2019-09-03 21:16:19,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-09-03 21:16:19,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:16:19,671 INFO L399 BasicCegarLoop]: trace histogram [171, 86, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:16:19,671 INFO L418 AbstractCegarLoop]: === Iteration 90 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:16:19,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:16:19,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1013208394, now seen corresponding path program 87 times [2019-09-03 21:16:19,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:16:19,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:16:19,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:16:19,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:16:19,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:16:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:16:22,512 INFO L134 CoverageAnalysis]: Checked inductivity of 29241 backedges. 0 proven. 21931 refuted. 0 times theorem prover too weak. 7310 trivial. 0 not checked. [2019-09-03 21:16:22,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:16:22,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:16:22,513 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:16:22,513 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:16:22,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:16:22,513 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 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:16:22,524 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:16:22,524 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:16:22,630 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:16:22,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:16:22,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 880 conjuncts, 87 conjunts are in the unsatisfiable core [2019-09-03 21:16:22,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:16:27,854 INFO L134 CoverageAnalysis]: Checked inductivity of 29241 backedges. 14706 proven. 7310 refuted. 0 times theorem prover too weak. 7225 trivial. 0 not checked. [2019-09-03 21:16:27,854 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:16:37,977 INFO L134 CoverageAnalysis]: Checked inductivity of 29241 backedges. 14706 proven. 7310 refuted. 0 times theorem prover too weak. 7225 trivial. 0 not checked. [2019-09-03 21:16:37,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:16:37,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 88, 88] total 264 [2019-09-03 21:16:37,981 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:16:37,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 178 states [2019-09-03 21:16:37,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2019-09-03 21:16:37,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18972, Invalid=50460, Unknown=0, NotChecked=0, Total=69432 [2019-09-03 21:16:37,984 INFO L87 Difference]: Start difference. First operand 354 states and 441 transitions. Second operand 178 states. [2019-09-03 21:16:44,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:16:44,195 INFO L93 Difference]: Finished difference Result 361 states and 449 transitions. [2019-09-03 21:16:44,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2019-09-03 21:16:44,195 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 352 [2019-09-03 21:16:44,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:16:44,196 INFO L225 Difference]: With dead ends: 361 [2019-09-03 21:16:44,196 INFO L226 Difference]: Without dead ends: 358 [2019-09-03 21:16:44,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 883 GetRequests, 533 SyntacticMatches, 0 SemanticMatches, 350 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19048 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=41426, Invalid=82126, Unknown=0, NotChecked=0, Total=123552 [2019-09-03 21:16:44,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-09-03 21:16:44,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2019-09-03 21:16:44,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-09-03 21:16:44,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 446 transitions. [2019-09-03 21:16:44,203 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 446 transitions. Word has length 352 [2019-09-03 21:16:44,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:16:44,204 INFO L475 AbstractCegarLoop]: Abstraction has 358 states and 446 transitions. [2019-09-03 21:16:44,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 178 states. [2019-09-03 21:16:44,204 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 446 transitions. [2019-09-03 21:16:44,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-09-03 21:16:44,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:16:44,205 INFO L399 BasicCegarLoop]: trace histogram [173, 87, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:16:44,205 INFO L418 AbstractCegarLoop]: === Iteration 91 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:16:44,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:16:44,205 INFO L82 PathProgramCache]: Analyzing trace with hash 267256514, now seen corresponding path program 88 times [2019-09-03 21:16:44,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:16:44,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:16:44,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:16:44,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:16:44,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:16:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:16:47,092 INFO L134 CoverageAnalysis]: Checked inductivity of 29929 backedges. 0 proven. 22447 refuted. 0 times theorem prover too weak. 7482 trivial. 0 not checked. [2019-09-03 21:16:47,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:16:47,093 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:16:47,093 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:16:47,093 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:16:47,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:16:47,093 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 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:16:47,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:16:47,104 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:16:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:16:47,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-03 21:16:47,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:16:52,586 INFO L134 CoverageAnalysis]: Checked inductivity of 29929 backedges. 15051 proven. 7482 refuted. 0 times theorem prover too weak. 7396 trivial. 0 not checked. [2019-09-03 21:16:52,587 INFO L322 TraceCheckSpWp]: Computing backward predicates...