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/loop-invgen/up.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:52:29,226 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:52:29,228 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:52:29,240 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:52:29,241 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:52:29,242 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:52:29,243 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:52:29,245 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:52:29,247 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:52:29,248 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:52:29,249 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:52:29,250 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:52:29,251 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:52:29,252 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:52:29,253 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:52:29,254 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:52:29,255 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:52:29,256 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:52:29,258 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:52:29,260 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:52:29,261 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:52:29,262 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:52:29,263 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:52:29,264 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:52:29,267 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:52:29,267 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:52:29,267 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:52:29,268 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:52:29,269 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:52:29,270 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:52:29,270 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:52:29,271 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:52:29,272 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:52:29,272 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:52:29,273 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:52:29,273 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:52:29,274 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:52:29,274 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:52:29,275 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:52:29,276 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:52:29,276 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:52:29,277 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 20:52:29,293 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:52:29,294 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:52:29,294 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 20:52:29,294 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 20:52:29,297 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 20:52:29,297 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 20:52:29,297 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 20:52:29,297 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 20:52:29,297 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 20:52:29,298 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 20:52:29,298 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:52:29,299 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:52:29,299 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:52:29,299 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:52:29,299 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:52:29,299 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:52:29,299 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:52:29,300 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:52:29,300 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:52:29,301 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:52:29,301 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:52:29,302 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 20:52:29,302 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:52:29,302 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:52:29,303 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:52:29,303 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:52:29,303 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 20:52:29,303 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:52:29,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:52:29,304 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 20:52:29,335 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:52:29,350 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:52:29,354 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:52:29,356 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:52:29,356 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:52:29,357 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/up.i [2019-09-03 20:52:29,429 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a1447996/9f50ea50a15d4926b2443686f60b8513/FLAG2ffa45b49 [2019-09-03 20:52:29,891 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:52:29,891 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/up.i [2019-09-03 20:52:29,899 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a1447996/9f50ea50a15d4926b2443686f60b8513/FLAG2ffa45b49 [2019-09-03 20:52:30,285 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a1447996/9f50ea50a15d4926b2443686f60b8513 [2019-09-03 20:52:30,302 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:52:30,303 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:52:30,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:52:30,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:52:30,309 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:52:30,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:52:30" (1/1) ... [2019-09-03 20:52:30,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64a01335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:30, skipping insertion in model container [2019-09-03 20:52:30,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:52:30" (1/1) ... [2019-09-03 20:52:30,321 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:52:30,336 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:52:30,502 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:52:30,507 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:52:30,524 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:52:30,536 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:52:30,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:30 WrapperNode [2019-09-03 20:52:30,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:52:30,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:52:30,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:52:30,538 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:52:30,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:30" (1/1) ... [2019-09-03 20:52:30,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:30" (1/1) ... [2019-09-03 20:52:30,645 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:30" (1/1) ... [2019-09-03 20:52:30,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:30" (1/1) ... [2019-09-03 20:52:30,649 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:30" (1/1) ... [2019-09-03 20:52:30,653 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:30" (1/1) ... [2019-09-03 20:52:30,654 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:30" (1/1) ... [2019-09-03 20:52:30,656 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:52:30,656 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:52:30,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:52:30,657 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:52:30,658 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:30" (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 20:52:30,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:52:30,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:52:30,724 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:52:30,724 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:52:30,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:52:30,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 20:52:30,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:52:30,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 20:52:30,725 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:52:30,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:52:30,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:52:30,901 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:52:30,902 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-03 20:52:30,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:52:30 BoogieIcfgContainer [2019-09-03 20:52:30,903 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:52:30,904 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:52:30,904 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:52:30,907 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:52:30,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:52:30" (1/3) ... [2019-09-03 20:52:30,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6705f66f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:52:30, skipping insertion in model container [2019-09-03 20:52:30,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:30" (2/3) ... [2019-09-03 20:52:30,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6705f66f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:52:30, skipping insertion in model container [2019-09-03 20:52:30,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:52:30" (3/3) ... [2019-09-03 20:52:30,911 INFO L109 eAbstractionObserver]: Analyzing ICFG up.i [2019-09-03 20:52:30,921 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:52:30,927 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:52:30,945 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:52:30,972 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:52:30,973 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 20:52:30,973 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:52:30,973 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:52:30,973 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:52:30,973 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:52:30,973 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:52:30,974 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:52:30,989 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-09-03 20:52:30,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 20:52:30,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:31,000 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:31,002 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:31,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:31,007 INFO L82 PathProgramCache]: Analyzing trace with hash -634347879, now seen corresponding path program 1 times [2019-09-03 20:52:31,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:31,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:31,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:31,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:31,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:31,162 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 20:52:31,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:31,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:52:31,165 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:31,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:52:31,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:52:31,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:52:31,188 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2019-09-03 20:52:31,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:31,277 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-09-03 20:52:31,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:52:31,279 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-09-03 20:52:31,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:31,292 INFO L225 Difference]: With dead ends: 25 [2019-09-03 20:52:31,292 INFO L226 Difference]: Without dead ends: 17 [2019-09-03 20:52:31,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:52:31,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-03 20:52:31,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-03 20:52:31,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-03 20:52:31,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-09-03 20:52:31,341 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2019-09-03 20:52:31,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:31,342 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-09-03 20:52:31,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:52:31,342 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-09-03 20:52:31,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 20:52:31,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:31,343 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:31,344 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:31,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:31,345 INFO L82 PathProgramCache]: Analyzing trace with hash -306885048, now seen corresponding path program 1 times [2019-09-03 20:52:31,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:31,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:31,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:31,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:31,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:31,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:31,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:31,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 20:52:31,503 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:31,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:52:31,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:52:31,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:52:31,506 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 6 states. [2019-09-03 20:52:31,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:31,608 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2019-09-03 20:52:31,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:52:31,612 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-09-03 20:52:31,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:31,615 INFO L225 Difference]: With dead ends: 27 [2019-09-03 20:52:31,616 INFO L226 Difference]: Without dead ends: 27 [2019-09-03 20:52:31,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:52:31,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-03 20:52:31,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2019-09-03 20:52:31,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-03 20:52:31,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-09-03 20:52:31,639 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 13 [2019-09-03 20:52:31,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:31,639 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-09-03 20:52:31,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:52:31,640 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-09-03 20:52:31,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 20:52:31,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:31,643 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:31,645 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:31,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:31,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1036343866, now seen corresponding path program 1 times [2019-09-03 20:52:31,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:31,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:31,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:31,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:31,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:31,780 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:31,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:31,781 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:31,782 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2019-09-03 20:52:31,784 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [17], [26], [28], [33], [36], [38], [41], [43], [44], [45], [46], [48], [49] [2019-09-03 20:52:31,818 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:52:31,818 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:52:32,002 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:52:32,005 INFO L272 AbstractInterpreter]: Visited 17 different actions 85 times. Merged at 6 different actions 28 times. Widened at 2 different actions 4 times. Performed 175 root evaluator evaluations with a maximum evaluation depth of 6. Performed 175 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 5 fixpoints after 3 different actions. Largest state had 9 variables. [2019-09-03 20:52:32,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:32,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:52:32,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:32,011 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 20:52:32,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:32,041 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 20:52:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:32,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 20:52:32,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:32,149 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:32,149 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:32,197 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:32,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:32,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2019-09-03 20:52:32,205 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:32,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:52:32,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:52:32,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:52:32,207 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 9 states. [2019-09-03 20:52:32,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:32,303 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2019-09-03 20:52:32,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:52:32,304 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-09-03 20:52:32,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:32,306 INFO L225 Difference]: With dead ends: 29 [2019-09-03 20:52:32,307 INFO L226 Difference]: Without dead ends: 24 [2019-09-03 20:52:32,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:52:32,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-03 20:52:32,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-03 20:52:32,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-03 20:52:32,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-09-03 20:52:32,313 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 20 [2019-09-03 20:52:32,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:32,314 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-09-03 20:52:32,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:52:32,314 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-09-03 20:52:32,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 20:52:32,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:32,315 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:32,316 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:32,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:32,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1343034647, now seen corresponding path program 2 times [2019-09-03 20:52:32,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:32,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:32,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:32,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:32,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:32,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:32,401 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:32,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:32,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:32,412 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:32,413 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:32,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:32,413 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) [2019-09-03 20:52:32,429 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:32,429 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:32,453 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-03 20:52:32,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:32,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 20:52:32,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:32,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:32,503 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:32,503 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:32,547 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:32,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:32,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2019-09-03 20:52:32,552 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:32,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:52:32,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:52:32,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:52:32,554 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 9 states. [2019-09-03 20:52:32,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:32,632 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2019-09-03 20:52:32,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:52:32,634 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-09-03 20:52:32,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:32,635 INFO L225 Difference]: With dead ends: 35 [2019-09-03 20:52:32,636 INFO L226 Difference]: Without dead ends: 35 [2019-09-03 20:52:32,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:52:32,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-03 20:52:32,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2019-09-03 20:52:32,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 20:52:32,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-09-03 20:52:32,645 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 21 [2019-09-03 20:52:32,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:32,646 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-09-03 20:52:32,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:52:32,646 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-09-03 20:52:32,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 20:52:32,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:32,647 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:32,648 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:32,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:32,648 INFO L82 PathProgramCache]: Analyzing trace with hash 2027779705, now seen corresponding path program 3 times [2019-09-03 20:52:32,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:32,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:32,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:32,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:32,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:32,732 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:52:32,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:32,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:32,733 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:32,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:32,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:32,734 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 20:52:32,751 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:32,751 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:52:32,766 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:32,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:32,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 20:52:32,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:32,830 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:52:32,831 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:32,889 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:52:32,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:32,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2019-09-03 20:52:32,894 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:32,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 20:52:32,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 20:52:32,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:52:32,895 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 12 states. [2019-09-03 20:52:33,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:33,007 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-09-03 20:52:33,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:52:33,009 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-09-03 20:52:33,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:33,010 INFO L225 Difference]: With dead ends: 40 [2019-09-03 20:52:33,010 INFO L226 Difference]: Without dead ends: 32 [2019-09-03 20:52:33,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-09-03 20:52:33,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-03 20:52:33,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-09-03 20:52:33,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-03 20:52:33,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-09-03 20:52:33,024 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 28 [2019-09-03 20:52:33,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:33,024 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-09-03 20:52:33,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 20:52:33,024 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-09-03 20:52:33,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-03 20:52:33,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:33,029 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:33,029 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:33,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:33,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1195567144, now seen corresponding path program 4 times [2019-09-03 20:52:33,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:33,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:33,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:33,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:33,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:33,134 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:52:33,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:33,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:33,135 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:33,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:33,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:33,136 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) [2019-09-03 20:52:33,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:33,162 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:33,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 20:52:33,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:33,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:33,210 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:52:33,211 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:33,256 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:52:33,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:33,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2019-09-03 20:52:33,261 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:33,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:52:33,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:52:33,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:52:33,263 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 10 states. [2019-09-03 20:52:33,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:33,343 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2019-09-03 20:52:33,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:52:33,344 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-09-03 20:52:33,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:33,345 INFO L225 Difference]: With dead ends: 43 [2019-09-03 20:52:33,345 INFO L226 Difference]: Without dead ends: 43 [2019-09-03 20:52:33,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:52:33,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-03 20:52:33,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2019-09-03 20:52:33,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 20:52:33,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-09-03 20:52:33,360 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 29 [2019-09-03 20:52:33,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:33,361 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-09-03 20:52:33,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:52:33,361 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-09-03 20:52:33,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-03 20:52:33,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:33,362 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:33,363 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:33,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:33,363 INFO L82 PathProgramCache]: Analyzing trace with hash -193928102, now seen corresponding path program 5 times [2019-09-03 20:52:33,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:33,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:33,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:33,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:33,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:33,518 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:52:33,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:33,519 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:33,519 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:33,519 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:33,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:33,520 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 20:52:33,538 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:33,538 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:33,564 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 20:52:33,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:33,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 20:52:33,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:33,660 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:52:33,661 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:33,726 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:52:33,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:33,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 15 [2019-09-03 20:52:33,730 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:33,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 20:52:33,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 20:52:33,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:52:33,734 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 15 states. [2019-09-03 20:52:33,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:33,883 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2019-09-03 20:52:33,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 20:52:33,883 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2019-09-03 20:52:33,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:33,884 INFO L225 Difference]: With dead ends: 51 [2019-09-03 20:52:33,885 INFO L226 Difference]: Without dead ends: 40 [2019-09-03 20:52:33,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 61 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:52:33,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-03 20:52:33,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-03 20:52:33,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-03 20:52:33,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-09-03 20:52:33,891 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 36 [2019-09-03 20:52:33,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:33,891 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-09-03 20:52:33,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 20:52:33,891 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-09-03 20:52:33,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-03 20:52:33,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:33,892 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:33,893 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:33,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:33,893 INFO L82 PathProgramCache]: Analyzing trace with hash 496842505, now seen corresponding path program 6 times [2019-09-03 20:52:33,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:33,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:33,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:33,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:33,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:33,976 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:52:33,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:33,977 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:33,977 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:33,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:33,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:33,977 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) [2019-09-03 20:52:33,991 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:33,991 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:34,008 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:34,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:34,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 20:52:34,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:34,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:34,044 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:52:34,046 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:34,110 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:52:34,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:34,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2019-09-03 20:52:34,114 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:34,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 20:52:34,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 20:52:34,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:52:34,116 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 11 states. [2019-09-03 20:52:34,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:34,211 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2019-09-03 20:52:34,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:52:34,211 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2019-09-03 20:52:34,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:34,213 INFO L225 Difference]: With dead ends: 51 [2019-09-03 20:52:34,213 INFO L226 Difference]: Without dead ends: 51 [2019-09-03 20:52:34,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 68 SyntacticMatches, 8 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:52:34,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-03 20:52:34,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2019-09-03 20:52:34,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-03 20:52:34,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-09-03 20:52:34,226 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 37 [2019-09-03 20:52:34,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:34,226 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-09-03 20:52:34,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 20:52:34,227 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-09-03 20:52:34,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-03 20:52:34,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:34,228 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:34,228 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:34,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:34,229 INFO L82 PathProgramCache]: Analyzing trace with hash 225134169, now seen corresponding path program 7 times [2019-09-03 20:52:34,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:34,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:34,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:34,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:34,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:34,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:34,369 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:52:34,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:34,369 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:34,370 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:34,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:34,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:34,370 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 20:52:34,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:34,381 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:52:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:34,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 20:52:34,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:34,495 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:52:34,496 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:34,595 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:52:34,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:34,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2019-09-03 20:52:34,599 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:34,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 20:52:34,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 20:52:34,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2019-09-03 20:52:34,600 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 18 states. [2019-09-03 20:52:34,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:34,779 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2019-09-03 20:52:34,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 20:52:34,780 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 44 [2019-09-03 20:52:34,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:34,781 INFO L225 Difference]: With dead ends: 62 [2019-09-03 20:52:34,781 INFO L226 Difference]: Without dead ends: 48 [2019-09-03 20:52:34,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 74 SyntacticMatches, 10 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:52:34,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-03 20:52:34,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-09-03 20:52:34,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-03 20:52:34,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-09-03 20:52:34,787 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 44 [2019-09-03 20:52:34,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:34,787 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-09-03 20:52:34,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 20:52:34,788 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-09-03 20:52:34,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-03 20:52:34,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:34,789 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:34,789 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:34,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:34,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1863484920, now seen corresponding path program 8 times [2019-09-03 20:52:34,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:34,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:34,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:34,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:34,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:34,868 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:52:34,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:34,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:34,869 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:34,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:34,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:34,870 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 20:52:34,889 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:34,889 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:34,915 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-03 20:52:34,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:34,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 20:52:34,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:34,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:34,958 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:52:34,958 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:35,026 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:52:35,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:35,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 12 [2019-09-03 20:52:35,030 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:35,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 20:52:35,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 20:52:35,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:52:35,031 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 12 states. [2019-09-03 20:52:35,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:35,120 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2019-09-03 20:52:35,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 20:52:35,121 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2019-09-03 20:52:35,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:35,122 INFO L225 Difference]: With dead ends: 59 [2019-09-03 20:52:35,122 INFO L226 Difference]: Without dead ends: 59 [2019-09-03 20:52:35,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 83 SyntacticMatches, 10 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:52:35,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-03 20:52:35,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2019-09-03 20:52:35,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-03 20:52:35,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-09-03 20:52:35,128 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 45 [2019-09-03 20:52:35,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:35,129 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-09-03 20:52:35,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 20:52:35,129 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-09-03 20:52:35,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-03 20:52:35,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:35,130 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:35,131 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:35,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:35,131 INFO L82 PathProgramCache]: Analyzing trace with hash -956795270, now seen corresponding path program 9 times [2019-09-03 20:52:35,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:35,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:35,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:35,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:35,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:35,251 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:35,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:35,251 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:35,251 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:35,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 20:52:35,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:35,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 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 20:52:35,262 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:35,262 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:52:35,283 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:35,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:35,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 20:52:35,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:35,429 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:35,429 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:35,550 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:35,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:35,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 21 [2019-09-03 20:52:35,555 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:35,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 20:52:35,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 20:52:35,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:52:35,556 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 21 states. [2019-09-03 20:52:35,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:35,748 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2019-09-03 20:52:35,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 20:52:35,748 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 52 [2019-09-03 20:52:35,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:35,749 INFO L225 Difference]: With dead ends: 73 [2019-09-03 20:52:35,749 INFO L226 Difference]: Without dead ends: 56 [2019-09-03 20:52:35,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 87 SyntacticMatches, 12 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=202, Invalid=554, Unknown=0, NotChecked=0, Total=756 [2019-09-03 20:52:35,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-03 20:52:35,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-09-03 20:52:35,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-03 20:52:35,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-09-03 20:52:35,755 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 52 [2019-09-03 20:52:35,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:35,756 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-09-03 20:52:35,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 20:52:35,756 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-09-03 20:52:35,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-03 20:52:35,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:35,757 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:35,757 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:35,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:35,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1520465111, now seen corresponding path program 10 times [2019-09-03 20:52:35,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:35,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:35,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:35,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:35,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:35,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:35,842 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 31 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:35,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:35,843 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:35,843 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:35,843 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:35,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:35,843 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 20:52:35,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:35,855 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:52:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:35,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 20:52:35,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:35,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:35,947 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 31 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:35,947 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:36,025 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 31 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:36,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:36,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2019-09-03 20:52:36,029 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:36,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 20:52:36,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 20:52:36,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:52:36,030 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 13 states. [2019-09-03 20:52:36,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:36,192 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2019-09-03 20:52:36,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 20:52:36,193 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2019-09-03 20:52:36,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:36,194 INFO L225 Difference]: With dead ends: 67 [2019-09-03 20:52:36,196 INFO L226 Difference]: Without dead ends: 67 [2019-09-03 20:52:36,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 98 SyntacticMatches, 12 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-09-03 20:52:36,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-03 20:52:36,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2019-09-03 20:52:36,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-03 20:52:36,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-09-03 20:52:36,209 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 53 [2019-09-03 20:52:36,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:36,210 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-09-03 20:52:36,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 20:52:36,210 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-09-03 20:52:36,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-03 20:52:36,214 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:36,214 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:36,214 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:36,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:36,215 INFO L82 PathProgramCache]: Analyzing trace with hash -2042098119, now seen corresponding path program 11 times [2019-09-03 20:52:36,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:36,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:36,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:36,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:36,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:36,372 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:36,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:36,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:36,373 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:36,373 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:36,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:36,373 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 20:52:36,384 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:36,385 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:36,416 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-03 20:52:36,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:36,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 20:52:36,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:36,657 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:36,658 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:36,818 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:36,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:36,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 24 [2019-09-03 20:52:36,822 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:36,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 20:52:36,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 20:52:36,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:52:36,825 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 24 states. [2019-09-03 20:52:37,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:37,055 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2019-09-03 20:52:37,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 20:52:37,055 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 60 [2019-09-03 20:52:37,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:37,056 INFO L225 Difference]: With dead ends: 84 [2019-09-03 20:52:37,056 INFO L226 Difference]: Without dead ends: 64 [2019-09-03 20:52:37,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 100 SyntacticMatches, 14 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=259, Invalid=733, Unknown=0, NotChecked=0, Total=992 [2019-09-03 20:52:37,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-03 20:52:37,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-09-03 20:52:37,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-03 20:52:37,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2019-09-03 20:52:37,061 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 60 [2019-09-03 20:52:37,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:37,062 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2019-09-03 20:52:37,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 20:52:37,062 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2019-09-03 20:52:37,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-03 20:52:37,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:37,063 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:37,063 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:37,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:37,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1054669848, now seen corresponding path program 12 times [2019-09-03 20:52:37,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:37,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:37,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:37,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:37,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:37,153 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 40 proven. 57 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:37,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:37,153 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:37,153 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:37,153 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:37,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:37,154 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 20:52:37,165 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:37,165 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:52:37,192 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:37,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:37,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 20:52:37,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:37,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:37,225 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 40 proven. 57 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:37,225 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:37,311 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 40 proven. 57 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:37,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:37,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 14 [2019-09-03 20:52:37,315 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:37,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 20:52:37,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 20:52:37,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-09-03 20:52:37,317 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 14 states. [2019-09-03 20:52:37,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:37,418 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2019-09-03 20:52:37,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 20:52:37,418 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 61 [2019-09-03 20:52:37,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:37,419 INFO L225 Difference]: With dead ends: 75 [2019-09-03 20:52:37,420 INFO L226 Difference]: Without dead ends: 75 [2019-09-03 20:52:37,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 113 SyntacticMatches, 14 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:52:37,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-03 20:52:37,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2019-09-03 20:52:37,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-03 20:52:37,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-09-03 20:52:37,426 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 61 [2019-09-03 20:52:37,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:37,427 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-09-03 20:52:37,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 20:52:37,427 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-09-03 20:52:37,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-03 20:52:37,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:37,428 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:37,428 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:37,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:37,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1194201242, now seen corresponding path program 13 times [2019-09-03 20:52:37,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:37,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:37,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:37,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:37,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:37,626 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 91 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:52:37,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:37,626 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:37,627 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:37,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:37,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:37,627 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) [2019-09-03 20:52:37,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:37,641 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:37,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 20:52:37,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:37,841 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 91 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:52:37,842 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:37,962 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 91 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:52:37,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:37,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 27 [2019-09-03 20:52:37,966 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:37,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 20:52:37,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 20:52:37,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=523, Unknown=0, NotChecked=0, Total=702 [2019-09-03 20:52:37,968 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 27 states. [2019-09-03 20:52:38,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:38,249 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2019-09-03 20:52:38,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 20:52:38,250 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 68 [2019-09-03 20:52:38,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:38,251 INFO L225 Difference]: With dead ends: 95 [2019-09-03 20:52:38,252 INFO L226 Difference]: Without dead ends: 72 [2019-09-03 20:52:38,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 113 SyntacticMatches, 16 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=323, Invalid=937, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 20:52:38,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-03 20:52:38,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-09-03 20:52:38,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-03 20:52:38,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-09-03 20:52:38,258 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 68 [2019-09-03 20:52:38,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:38,259 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-09-03 20:52:38,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 20:52:38,259 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-09-03 20:52:38,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-03 20:52:38,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:38,260 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:38,260 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:38,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:38,260 INFO L82 PathProgramCache]: Analyzing trace with hash -519313591, now seen corresponding path program 14 times [2019-09-03 20:52:38,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:38,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:38,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:38,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:38,262 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:38,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:38,351 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 50 proven. 77 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:52:38,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:38,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:38,351 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:38,352 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:38,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:38,352 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:38,364 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:38,364 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:38,392 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-03 20:52:38,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:38,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 20:52:38,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:38,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:38,433 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 50 proven. 77 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:52:38,433 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:38,529 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 50 proven. 77 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:52:38,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:38,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 15 [2019-09-03 20:52:38,533 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:38,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 20:52:38,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 20:52:38,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:52:38,534 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 15 states. [2019-09-03 20:52:38,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:38,629 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2019-09-03 20:52:38,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 20:52:38,630 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 69 [2019-09-03 20:52:38,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:38,631 INFO L225 Difference]: With dead ends: 83 [2019-09-03 20:52:38,631 INFO L226 Difference]: Without dead ends: 83 [2019-09-03 20:52:38,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 128 SyntacticMatches, 16 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-09-03 20:52:38,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-09-03 20:52:38,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2019-09-03 20:52:38,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-03 20:52:38,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-09-03 20:52:38,635 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 69 [2019-09-03 20:52:38,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:38,636 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-09-03 20:52:38,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 20:52:38,636 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-09-03 20:52:38,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-03 20:52:38,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:38,637 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:38,637 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:38,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:38,637 INFO L82 PathProgramCache]: Analyzing trace with hash -111030759, now seen corresponding path program 15 times [2019-09-03 20:52:38,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:38,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:38,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:38,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:38,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:38,851 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 116 proven. 36 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:52:38,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:38,852 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:38,852 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:38,852 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:38,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:38,852 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 20:52:38,871 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:38,871 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:52:38,895 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:38,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:38,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 20:52:38,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:39,076 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 116 proven. 36 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:52:39,076 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:39,231 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 116 proven. 36 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:52:39,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:39,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 30 [2019-09-03 20:52:39,235 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:39,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 20:52:39,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 20:52:39,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=651, Unknown=0, NotChecked=0, Total=870 [2019-09-03 20:52:39,236 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 30 states. [2019-09-03 20:52:39,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:39,540 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2019-09-03 20:52:39,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 20:52:39,543 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 76 [2019-09-03 20:52:39,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:39,544 INFO L225 Difference]: With dead ends: 106 [2019-09-03 20:52:39,544 INFO L226 Difference]: Without dead ends: 80 [2019-09-03 20:52:39,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 126 SyntacticMatches, 18 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=394, Invalid=1166, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 20:52:39,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-03 20:52:39,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-09-03 20:52:39,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-03 20:52:39,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-09-03 20:52:39,555 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 76 [2019-09-03 20:52:39,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:39,556 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-09-03 20:52:39,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 20:52:39,556 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-09-03 20:52:39,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-03 20:52:39,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:39,557 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:39,557 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:39,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:39,560 INFO L82 PathProgramCache]: Analyzing trace with hash -170818104, now seen corresponding path program 16 times [2019-09-03 20:52:39,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:39,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:39,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:39,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:39,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:39,665 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 61 proven. 100 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:52:39,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:39,666 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:39,666 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:39,666 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:39,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:39,666 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) [2019-09-03 20:52:39,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:39,694 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:39,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 20:52:39,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:39,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:39,763 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 61 proven. 100 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:52:39,763 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:39,878 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 61 proven. 100 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:52:39,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:39,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 16 [2019-09-03 20:52:39,881 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:39,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 20:52:39,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 20:52:39,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-09-03 20:52:39,882 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 16 states. [2019-09-03 20:52:40,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:40,011 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2019-09-03 20:52:40,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 20:52:40,012 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 77 [2019-09-03 20:52:40,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:40,013 INFO L225 Difference]: With dead ends: 91 [2019-09-03 20:52:40,013 INFO L226 Difference]: Without dead ends: 91 [2019-09-03 20:52:40,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 143 SyntacticMatches, 18 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-09-03 20:52:40,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-03 20:52:40,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2019-09-03 20:52:40,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-03 20:52:40,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-09-03 20:52:40,020 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 77 [2019-09-03 20:52:40,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:40,021 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-09-03 20:52:40,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 20:52:40,021 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-09-03 20:52:40,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-03 20:52:40,022 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:40,023 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:40,023 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:40,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:40,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1868804794, now seen corresponding path program 17 times [2019-09-03 20:52:40,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:40,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:40,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:40,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:40,027 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:40,257 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 144 proven. 45 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:52:40,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:40,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:40,257 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:40,257 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:40,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:40,257 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 20:52:40,269 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:40,269 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:40,301 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-03 20:52:40,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:40,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 20:52:40,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:40,505 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 144 proven. 45 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:52:40,505 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:40,710 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 144 proven. 45 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:52:40,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:40,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 33 [2019-09-03 20:52:40,714 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:40,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 20:52:40,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 20:52:40,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=793, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 20:52:40,716 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 33 states. [2019-09-03 20:52:41,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:41,139 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2019-09-03 20:52:41,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 20:52:41,140 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 84 [2019-09-03 20:52:41,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:41,141 INFO L225 Difference]: With dead ends: 117 [2019-09-03 20:52:41,141 INFO L226 Difference]: Without dead ends: 88 [2019-09-03 20:52:41,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 139 SyntacticMatches, 20 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=472, Invalid=1420, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 20:52:41,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-03 20:52:41,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-09-03 20:52:41,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-03 20:52:41,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2019-09-03 20:52:41,147 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 84 [2019-09-03 20:52:41,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:41,147 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2019-09-03 20:52:41,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 20:52:41,148 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2019-09-03 20:52:41,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-03 20:52:41,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:41,149 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:41,149 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:41,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:41,149 INFO L82 PathProgramCache]: Analyzing trace with hash -755741847, now seen corresponding path program 18 times [2019-09-03 20:52:41,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:41,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:41,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:41,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:41,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:41,363 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 73 proven. 126 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:52:41,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:41,364 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:41,364 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:41,364 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:41,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:41,364 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 20:52:41,382 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:41,383 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:52:41,419 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:41,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:41,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 20:52:41,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:41,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:41,473 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 73 proven. 126 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:52:41,473 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:41,661 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 73 proven. 126 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:52:41,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:41,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 17 [2019-09-03 20:52:41,665 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:41,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 20:52:41,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 20:52:41,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-09-03 20:52:41,667 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 17 states. [2019-09-03 20:52:41,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:41,818 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2019-09-03 20:52:41,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 20:52:41,820 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2019-09-03 20:52:41,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:41,822 INFO L225 Difference]: With dead ends: 99 [2019-09-03 20:52:41,822 INFO L226 Difference]: Without dead ends: 99 [2019-09-03 20:52:41,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 158 SyntacticMatches, 20 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2019-09-03 20:52:41,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-03 20:52:41,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2019-09-03 20:52:41,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-03 20:52:41,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-09-03 20:52:41,827 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 85 [2019-09-03 20:52:41,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:41,827 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-09-03 20:52:41,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 20:52:41,827 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-09-03 20:52:41,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-03 20:52:41,828 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:41,828 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:41,829 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:41,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:41,829 INFO L82 PathProgramCache]: Analyzing trace with hash -2077850119, now seen corresponding path program 19 times [2019-09-03 20:52:41,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:41,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:41,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:41,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:41,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:42,134 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 175 proven. 55 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:52:42,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:42,134 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:42,135 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:42,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:42,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:42,135 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) [2019-09-03 20:52:42,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:42,157 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:42,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 20:52:42,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:42,474 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 175 proven. 55 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:52:42,487 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:42,765 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 175 proven. 55 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:52:42,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:42,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 36 [2019-09-03 20:52:42,770 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:42,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 20:52:42,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 20:52:42,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 20:52:42,772 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 36 states. [2019-09-03 20:52:43,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:43,265 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2019-09-03 20:52:43,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 20:52:43,269 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 92 [2019-09-03 20:52:43,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:43,270 INFO L225 Difference]: With dead ends: 128 [2019-09-03 20:52:43,270 INFO L226 Difference]: Without dead ends: 96 [2019-09-03 20:52:43,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 152 SyntacticMatches, 22 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=557, Invalid=1699, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 20:52:43,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-03 20:52:43,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-09-03 20:52:43,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-03 20:52:43,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2019-09-03 20:52:43,276 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 92 [2019-09-03 20:52:43,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:43,277 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2019-09-03 20:52:43,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 20:52:43,277 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2019-09-03 20:52:43,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-03 20:52:43,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:43,278 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:43,278 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:43,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:43,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1416036264, now seen corresponding path program 20 times [2019-09-03 20:52:43,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:43,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:43,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:43,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:43,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:43,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:43,422 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 86 proven. 155 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:52:43,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:43,422 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:43,422 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:43,423 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:43,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:43,423 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 20:52:43,440 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:43,440 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:43,481 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-03 20:52:43,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:43,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 20:52:43,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:43,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:43,512 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 86 proven. 155 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:52:43,512 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:43,694 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 86 proven. 155 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:52:43,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:43,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 18 [2019-09-03 20:52:43,700 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:43,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 20:52:43,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 20:52:43,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2019-09-03 20:52:43,702 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 18 states. [2019-09-03 20:52:43,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:43,824 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2019-09-03 20:52:43,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 20:52:43,826 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 93 [2019-09-03 20:52:43,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:43,828 INFO L225 Difference]: With dead ends: 107 [2019-09-03 20:52:43,828 INFO L226 Difference]: Without dead ends: 107 [2019-09-03 20:52:43,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 173 SyntacticMatches, 22 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:52:43,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-03 20:52:43,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2019-09-03 20:52:43,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-03 20:52:43,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-09-03 20:52:43,834 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 93 [2019-09-03 20:52:43,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:43,834 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-09-03 20:52:43,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 20:52:43,834 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-09-03 20:52:43,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-03 20:52:43,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:43,835 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:43,836 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:43,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:43,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1033151270, now seen corresponding path program 21 times [2019-09-03 20:52:43,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:43,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:43,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:43,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:43,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:44,201 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 209 proven. 66 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:52:44,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:44,201 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:44,202 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:44,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:44,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:44,202 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) [2019-09-03 20:52:44,222 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:44,222 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:44,261 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:44,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:44,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 20:52:44,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:44,607 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 209 proven. 66 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:52:44,607 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:44,843 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 209 proven. 66 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:52:44,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:44,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 39 [2019-09-03 20:52:44,847 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:44,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 20:52:44,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 20:52:44,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=1119, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 20:52:44,849 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 39 states. [2019-09-03 20:52:45,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:45,440 INFO L93 Difference]: Finished difference Result 139 states and 151 transitions. [2019-09-03 20:52:45,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 20:52:45,440 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 100 [2019-09-03 20:52:45,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:45,442 INFO L225 Difference]: With dead ends: 139 [2019-09-03 20:52:45,442 INFO L226 Difference]: Without dead ends: 104 [2019-09-03 20:52:45,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 165 SyntacticMatches, 24 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 959 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=649, Invalid=2003, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:52:45,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-03 20:52:45,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-09-03 20:52:45,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-03 20:52:45,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2019-09-03 20:52:45,448 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 100 [2019-09-03 20:52:45,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:45,448 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2019-09-03 20:52:45,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 20:52:45,448 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2019-09-03 20:52:45,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-03 20:52:45,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:45,449 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:45,449 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:45,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:45,450 INFO L82 PathProgramCache]: Analyzing trace with hash 99268489, now seen corresponding path program 22 times [2019-09-03 20:52:45,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:45,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:45,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:45,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:45,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:45,653 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 100 proven. 187 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:52:45,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:45,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:45,654 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:45,654 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:45,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:45,654 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 20:52:45,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:45,680 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:52:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:45,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:52:45,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:45,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:45,795 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 100 proven. 187 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:52:45,796 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:45,996 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 100 proven. 187 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:52:45,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:45,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 19 [2019-09-03 20:52:45,999 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:46,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 20:52:46,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 20:52:46,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:52:46,000 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 19 states. [2019-09-03 20:52:46,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:46,149 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2019-09-03 20:52:46,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 20:52:46,149 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 101 [2019-09-03 20:52:46,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:46,150 INFO L225 Difference]: With dead ends: 115 [2019-09-03 20:52:46,150 INFO L226 Difference]: Without dead ends: 115 [2019-09-03 20:52:46,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 188 SyntacticMatches, 24 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:52:46,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-09-03 20:52:46,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2019-09-03 20:52:46,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-03 20:52:46,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-09-03 20:52:46,155 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 101 [2019-09-03 20:52:46,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:46,156 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-09-03 20:52:46,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 20:52:46,156 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-09-03 20:52:46,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-03 20:52:46,157 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:46,157 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:46,157 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:46,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:46,158 INFO L82 PathProgramCache]: Analyzing trace with hash 730084825, now seen corresponding path program 23 times [2019-09-03 20:52:46,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:46,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:46,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:46,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:46,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:46,468 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 246 proven. 78 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:52:46,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:46,468 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:46,468 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:46,468 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:46,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:46,469 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 20:52:46,479 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:46,479 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:46,528 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-03 20:52:46,528 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:46,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 20:52:46,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:46,995 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 246 proven. 78 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:52:46,995 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:47,296 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 246 proven. 78 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:52:47,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:47,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 42 [2019-09-03 20:52:47,300 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:47,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-03 20:52:47,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-03 20:52:47,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1303, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 20:52:47,302 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 42 states. [2019-09-03 20:52:47,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:47,912 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2019-09-03 20:52:47,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 20:52:47,913 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 108 [2019-09-03 20:52:47,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:47,914 INFO L225 Difference]: With dead ends: 150 [2019-09-03 20:52:47,915 INFO L226 Difference]: Without dead ends: 112 [2019-09-03 20:52:47,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 178 SyntacticMatches, 26 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=748, Invalid=2332, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 20:52:47,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-03 20:52:47,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-09-03 20:52:47,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-03 20:52:47,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2019-09-03 20:52:47,921 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 108 [2019-09-03 20:52:47,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:47,921 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2019-09-03 20:52:47,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-03 20:52:47,921 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2019-09-03 20:52:47,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-03 20:52:47,922 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:47,923 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:47,923 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:47,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:47,923 INFO L82 PathProgramCache]: Analyzing trace with hash -372149880, now seen corresponding path program 24 times [2019-09-03 20:52:47,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:47,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:47,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:47,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:47,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:48,081 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 115 proven. 222 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:52:48,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:48,081 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:48,081 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:48,081 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:48,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:48,081 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 20:52:48,093 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:48,093 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:52:48,132 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:48,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:48,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 20:52:48,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:48,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:48,196 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 115 proven. 222 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:52:48,197 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:48,430 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 115 proven. 222 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:52:48,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:48,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 20 [2019-09-03 20:52:48,435 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:48,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 20:52:48,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 20:52:48,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:52:48,436 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 20 states. [2019-09-03 20:52:48,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:48,559 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2019-09-03 20:52:48,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 20:52:48,559 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 109 [2019-09-03 20:52:48,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:48,560 INFO L225 Difference]: With dead ends: 123 [2019-09-03 20:52:48,560 INFO L226 Difference]: Without dead ends: 123 [2019-09-03 20:52:48,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 203 SyntacticMatches, 26 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:52:48,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-09-03 20:52:48,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2019-09-03 20:52:48,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-03 20:52:48,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2019-09-03 20:52:48,567 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 109 [2019-09-03 20:52:48,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:48,567 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2019-09-03 20:52:48,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 20:52:48,567 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2019-09-03 20:52:48,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-03 20:52:48,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:48,568 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:48,569 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:48,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:48,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1805061882, now seen corresponding path program 25 times [2019-09-03 20:52:48,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:48,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:48,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:48,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:48,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:48,941 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 286 proven. 91 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:52:48,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:48,942 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:48,942 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:48,942 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:48,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:48,942 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) [2019-09-03 20:52:48,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:48,958 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:48,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:52:48,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:49,383 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 286 proven. 91 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:52:49,383 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:49,678 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 286 proven. 91 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:52:49,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:49,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 45 [2019-09-03 20:52:49,682 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:49,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 20:52:49,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 20:52:49,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=1501, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 20:52:49,684 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 45 states. [2019-09-03 20:52:50,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:50,473 INFO L93 Difference]: Finished difference Result 161 states and 175 transitions. [2019-09-03 20:52:50,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 20:52:50,474 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 116 [2019-09-03 20:52:50,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:50,475 INFO L225 Difference]: With dead ends: 161 [2019-09-03 20:52:50,475 INFO L226 Difference]: Without dead ends: 120 [2019-09-03 20:52:50,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 191 SyntacticMatches, 28 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1315 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=854, Invalid=2686, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 20:52:50,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-03 20:52:50,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-09-03 20:52:50,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-03 20:52:50,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2019-09-03 20:52:50,481 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 116 [2019-09-03 20:52:50,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:50,481 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2019-09-03 20:52:50,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 20:52:50,481 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2019-09-03 20:52:50,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-03 20:52:50,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:50,482 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:50,482 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:50,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:50,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1388237911, now seen corresponding path program 26 times [2019-09-03 20:52:50,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:50,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:50,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:50,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:50,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:50,720 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 131 proven. 260 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:52:50,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:50,721 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:50,721 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:50,721 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:50,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:50,722 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:50,747 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:50,747 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:50,841 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-03 20:52:50,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:50,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 20:52:50,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:50,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:50,915 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 131 proven. 260 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:52:50,916 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:51,255 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 131 proven. 260 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:52:51,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:51,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 21 [2019-09-03 20:52:51,260 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:51,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 20:52:51,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 20:52:51,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:52:51,262 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 21 states. [2019-09-03 20:52:51,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:51,585 INFO L93 Difference]: Finished difference Result 131 states and 133 transitions. [2019-09-03 20:52:51,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 20:52:51,585 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 117 [2019-09-03 20:52:51,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:51,587 INFO L225 Difference]: With dead ends: 131 [2019-09-03 20:52:51,587 INFO L226 Difference]: Without dead ends: 131 [2019-09-03 20:52:51,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 218 SyntacticMatches, 28 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=310, Unknown=0, NotChecked=0, Total=462 [2019-09-03 20:52:51,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-09-03 20:52:51,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2019-09-03 20:52:51,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-09-03 20:52:51,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2019-09-03 20:52:51,598 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 117 [2019-09-03 20:52:51,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:51,598 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2019-09-03 20:52:51,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 20:52:51,598 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2019-09-03 20:52:51,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-03 20:52:51,599 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:51,599 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:51,600 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:51,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:51,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1142366791, now seen corresponding path program 27 times [2019-09-03 20:52:51,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:51,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:51,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:51,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:51,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:52,046 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 329 proven. 105 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:52:52,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:52,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:52,046 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:52,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:52,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:52,047 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 20:52:52,058 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:52,058 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:52:52,105 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:52,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:52,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 20:52:52,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:52,505 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 329 proven. 105 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:52:52,505 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:52,852 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 329 proven. 105 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:52:52,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:52,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 48 [2019-09-03 20:52:52,855 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:52,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-03 20:52:52,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-03 20:52:52,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=543, Invalid=1713, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 20:52:52,857 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 48 states. [2019-09-03 20:52:53,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:53,710 INFO L93 Difference]: Finished difference Result 172 states and 187 transitions. [2019-09-03 20:52:53,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 20:52:53,712 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 124 [2019-09-03 20:52:53,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:53,712 INFO L225 Difference]: With dead ends: 172 [2019-09-03 20:52:53,713 INFO L226 Difference]: Without dead ends: 128 [2019-09-03 20:52:53,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 204 SyntacticMatches, 30 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1514 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=967, Invalid=3065, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 20:52:53,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-03 20:52:53,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-09-03 20:52:53,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-03 20:52:53,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 129 transitions. [2019-09-03 20:52:53,719 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 129 transitions. Word has length 124 [2019-09-03 20:52:53,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:53,720 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 129 transitions. [2019-09-03 20:52:53,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-03 20:52:53,720 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 129 transitions. [2019-09-03 20:52:53,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-03 20:52:53,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:53,721 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:53,721 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:53,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:53,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1971397784, now seen corresponding path program 28 times [2019-09-03 20:52:53,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:53,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:53,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:53,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:53,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:53,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:53,920 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 148 proven. 301 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:52:53,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:53,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:53,921 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:53,921 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:53,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:53,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:53,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:53,931 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:52:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:53,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 20:52:53,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:53,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:54,024 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 148 proven. 301 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:52:54,024 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:54,273 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 148 proven. 301 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:52:54,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:54,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 22 [2019-09-03 20:52:54,276 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:54,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 20:52:54,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 20:52:54,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=299, Unknown=0, NotChecked=0, Total=462 [2019-09-03 20:52:54,278 INFO L87 Difference]: Start difference. First operand 128 states and 129 transitions. Second operand 22 states. [2019-09-03 20:52:54,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:54,455 INFO L93 Difference]: Finished difference Result 139 states and 141 transitions. [2019-09-03 20:52:54,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 20:52:54,456 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 125 [2019-09-03 20:52:54,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:54,458 INFO L225 Difference]: With dead ends: 139 [2019-09-03 20:52:54,458 INFO L226 Difference]: Without dead ends: 139 [2019-09-03 20:52:54,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 233 SyntacticMatches, 30 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2019-09-03 20:52:54,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-09-03 20:52:54,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2019-09-03 20:52:54,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-03 20:52:54,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2019-09-03 20:52:54,463 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 125 [2019-09-03 20:52:54,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:54,464 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2019-09-03 20:52:54,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 20:52:54,464 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2019-09-03 20:52:54,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-03 20:52:54,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:54,465 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:54,465 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:54,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:54,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1589168410, now seen corresponding path program 29 times [2019-09-03 20:52:54,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:54,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:54,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:54,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:54,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:54,891 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 375 proven. 120 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:52:54,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:54,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:54,891 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:54,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:54,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:54,892 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 20:52:54,901 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:54,902 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:54,991 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-03 20:52:54,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:54,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 20:52:54,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:55,503 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 375 proven. 120 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:52:55,504 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:55,900 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 375 proven. 120 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:52:55,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:55,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 51 [2019-09-03 20:52:55,903 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:55,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-03 20:52:55,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-03 20:52:55,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=611, Invalid=1939, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 20:52:55,905 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 51 states. [2019-09-03 20:52:56,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:56,757 INFO L93 Difference]: Finished difference Result 183 states and 199 transitions. [2019-09-03 20:52:56,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 20:52:56,762 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 132 [2019-09-03 20:52:56,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:56,764 INFO L225 Difference]: With dead ends: 183 [2019-09-03 20:52:56,764 INFO L226 Difference]: Without dead ends: 136 [2019-09-03 20:52:56,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 217 SyntacticMatches, 32 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1727 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1087, Invalid=3469, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 20:52:56,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-03 20:52:56,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-09-03 20:52:56,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-03 20:52:56,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2019-09-03 20:52:56,776 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 132 [2019-09-03 20:52:56,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:56,776 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2019-09-03 20:52:56,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-03 20:52:56,777 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2019-09-03 20:52:56,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-03 20:52:56,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:56,778 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:56,778 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:56,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:56,778 INFO L82 PathProgramCache]: Analyzing trace with hash -993417271, now seen corresponding path program 30 times [2019-09-03 20:52:56,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:56,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:56,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:56,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:56,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:57,032 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 166 proven. 345 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:52:57,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:57,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:57,033 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:57,034 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:57,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:57,034 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) [2019-09-03 20:52:57,054 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:57,055 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:57,098 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:57,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:57,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 20:52:57,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:57,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:57,149 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 166 proven. 345 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:52:57,149 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:57,446 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 166 proven. 345 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:52:57,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:57,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 23 [2019-09-03 20:52:57,450 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:57,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 20:52:57,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 20:52:57,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=325, Unknown=0, NotChecked=0, Total=506 [2019-09-03 20:52:57,451 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand 23 states. [2019-09-03 20:52:57,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:57,669 INFO L93 Difference]: Finished difference Result 147 states and 149 transitions. [2019-09-03 20:52:57,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 20:52:57,670 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 133 [2019-09-03 20:52:57,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:57,671 INFO L225 Difference]: With dead ends: 147 [2019-09-03 20:52:57,671 INFO L226 Difference]: Without dead ends: 147 [2019-09-03 20:52:57,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 248 SyntacticMatches, 32 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=365, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:52:57,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-09-03 20:52:57,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2019-09-03 20:52:57,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-09-03 20:52:57,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2019-09-03 20:52:57,678 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 133 [2019-09-03 20:52:57,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:57,678 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2019-09-03 20:52:57,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 20:52:57,678 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2019-09-03 20:52:57,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-03 20:52:57,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:57,681 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:57,681 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:57,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:57,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1455260263, now seen corresponding path program 31 times [2019-09-03 20:52:57,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:57,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:57,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:57,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:57,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:58,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 424 proven. 136 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:52:58,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:58,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:58,311 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:58,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:58,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:58,312 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) [2019-09-03 20:52:58,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:58,332 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:58,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:58,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 20:52:58,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:59,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 424 proven. 136 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:52:59,008 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:59,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 424 proven. 136 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:52:59,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:59,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 54 [2019-09-03 20:52:59,412 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:59,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-03 20:52:59,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-03 20:52:59,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=683, Invalid=2179, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 20:52:59,414 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 54 states. [2019-09-03 20:53:00,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:00,353 INFO L93 Difference]: Finished difference Result 194 states and 211 transitions. [2019-09-03 20:53:00,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 20:53:00,353 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 140 [2019-09-03 20:53:00,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:00,355 INFO L225 Difference]: With dead ends: 194 [2019-09-03 20:53:00,355 INFO L226 Difference]: Without dead ends: 144 [2019-09-03 20:53:00,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 230 SyntacticMatches, 34 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1954 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1214, Invalid=3898, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 20:53:00,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-09-03 20:53:00,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-09-03 20:53:00,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-09-03 20:53:00,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2019-09-03 20:53:00,362 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 140 [2019-09-03 20:53:00,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:00,363 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2019-09-03 20:53:00,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-03 20:53:00,363 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2019-09-03 20:53:00,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-03 20:53:00,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:00,364 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:00,364 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:00,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:00,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1302512312, now seen corresponding path program 32 times [2019-09-03 20:53:00,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:00,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:00,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:00,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:00,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:00,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:00,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 185 proven. 392 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:53:00,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:00,653 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:00,654 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:00,654 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:00,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:00,654 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 20:53:00,668 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:00,668 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:00,729 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-03 20:53:00,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:00,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:53:00,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:00,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:00,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 185 proven. 392 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:53:00,773 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:01,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 185 proven. 392 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:53:01,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:01,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 24 [2019-09-03 20:53:01,179 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:01,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 20:53:01,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 20:53:01,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:53:01,180 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand 24 states. [2019-09-03 20:53:01,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:01,387 INFO L93 Difference]: Finished difference Result 155 states and 157 transitions. [2019-09-03 20:53:01,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 20:53:01,387 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 141 [2019-09-03 20:53:01,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:01,389 INFO L225 Difference]: With dead ends: 155 [2019-09-03 20:53:01,389 INFO L226 Difference]: Without dead ends: 155 [2019-09-03 20:53:01,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 263 SyntacticMatches, 34 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=206, Invalid=394, Unknown=0, NotChecked=0, Total=600 [2019-09-03 20:53:01,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-09-03 20:53:01,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2019-09-03 20:53:01,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-09-03 20:53:01,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2019-09-03 20:53:01,397 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 141 [2019-09-03 20:53:01,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:01,399 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2019-09-03 20:53:01,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 20:53:01,399 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2019-09-03 20:53:01,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-03 20:53:01,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:01,400 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:01,400 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:01,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:01,401 INFO L82 PathProgramCache]: Analyzing trace with hash 2015529786, now seen corresponding path program 33 times [2019-09-03 20:53:01,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:01,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:01,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:01,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:01,403 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:01,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 476 proven. 153 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:53:01,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:01,915 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:01,915 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:01,915 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:01,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:01,916 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 20:53:01,925 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:01,925 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:01,975 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:01,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:01,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 20:53:01,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:02,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 476 proven. 153 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:53:02,579 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:03,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 476 proven. 153 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:53:03,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:03,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 57 [2019-09-03 20:53:03,015 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:03,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-03 20:53:03,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-03 20:53:03,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=759, Invalid=2433, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 20:53:03,017 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 57 states. [2019-09-03 20:53:04,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:04,075 INFO L93 Difference]: Finished difference Result 205 states and 223 transitions. [2019-09-03 20:53:04,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 20:53:04,075 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 148 [2019-09-03 20:53:04,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:04,077 INFO L225 Difference]: With dead ends: 205 [2019-09-03 20:53:04,077 INFO L226 Difference]: Without dead ends: 152 [2019-09-03 20:53:04,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 243 SyntacticMatches, 36 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2195 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1348, Invalid=4352, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 20:53:04,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-03 20:53:04,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-09-03 20:53:04,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-03 20:53:04,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 153 transitions. [2019-09-03 20:53:04,084 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 153 transitions. Word has length 148 [2019-09-03 20:53:04,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:04,085 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 153 transitions. [2019-09-03 20:53:04,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-03 20:53:04,085 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 153 transitions. [2019-09-03 20:53:04,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-03 20:53:04,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:04,100 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:04,100 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:04,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:04,100 INFO L82 PathProgramCache]: Analyzing trace with hash 819342313, now seen corresponding path program 34 times [2019-09-03 20:53:04,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:04,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:04,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:04,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:04,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:04,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 205 proven. 442 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:53:04,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:04,361 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:04,361 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:04,361 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:04,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:04,362 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) [2019-09-03 20:53:04,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:04,379 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:04,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 20:53:04,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:04,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:04,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 205 proven. 442 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:53:04,486 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:04,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 205 proven. 442 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:53:04,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:04,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 25 [2019-09-03 20:53:04,814 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:04,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 20:53:04,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 20:53:04,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=380, Unknown=0, NotChecked=0, Total=600 [2019-09-03 20:53:04,816 INFO L87 Difference]: Start difference. First operand 152 states and 153 transitions. Second operand 25 states. [2019-09-03 20:53:05,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:05,050 INFO L93 Difference]: Finished difference Result 163 states and 165 transitions. [2019-09-03 20:53:05,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 20:53:05,051 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 149 [2019-09-03 20:53:05,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:05,053 INFO L225 Difference]: With dead ends: 163 [2019-09-03 20:53:05,053 INFO L226 Difference]: Without dead ends: 163 [2019-09-03 20:53:05,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 278 SyntacticMatches, 36 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=226, Invalid=424, Unknown=0, NotChecked=0, Total=650 [2019-09-03 20:53:05,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-03 20:53:05,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2019-09-03 20:53:05,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-09-03 20:53:05,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2019-09-03 20:53:05,059 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 149 [2019-09-03 20:53:05,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:05,059 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2019-09-03 20:53:05,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 20:53:05,059 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2019-09-03 20:53:05,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-03 20:53:05,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:05,060 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:05,061 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:05,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:05,061 INFO L82 PathProgramCache]: Analyzing trace with hash -285272711, now seen corresponding path program 35 times [2019-09-03 20:53:05,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:05,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:05,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:05,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:05,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:05,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1314 backedges. 531 proven. 171 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 20:53:05,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:05,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:05,759 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:05,760 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:05,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:05,760 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 20:53:05,770 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:05,770 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:05,833 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-09-03 20:53:05,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:05,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:53:05,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:06,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1314 backedges. 531 proven. 171 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 20:53:06,545 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:07,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1314 backedges. 531 proven. 171 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 20:53:07,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:07,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 60 [2019-09-03 20:53:07,033 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:07,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-03 20:53:07,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-03 20:53:07,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=839, Invalid=2701, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 20:53:07,035 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 60 states. [2019-09-03 20:53:08,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:08,223 INFO L93 Difference]: Finished difference Result 216 states and 235 transitions. [2019-09-03 20:53:08,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 20:53:08,228 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 156 [2019-09-03 20:53:08,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:08,229 INFO L225 Difference]: With dead ends: 216 [2019-09-03 20:53:08,229 INFO L226 Difference]: Without dead ends: 160 [2019-09-03 20:53:08,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 256 SyntacticMatches, 38 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2450 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1489, Invalid=4831, Unknown=0, NotChecked=0, Total=6320 [2019-09-03 20:53:08,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-03 20:53:08,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-09-03 20:53:08,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-03 20:53:08,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2019-09-03 20:53:08,236 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 156 [2019-09-03 20:53:08,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:08,236 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2019-09-03 20:53:08,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-03 20:53:08,236 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2019-09-03 20:53:08,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-03 20:53:08,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:08,237 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:08,237 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:08,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:08,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1692047144, now seen corresponding path program 36 times [2019-09-03 20:53:08,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:08,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:08,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:08,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:08,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:08,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:08,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 226 proven. 495 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 20:53:08,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:08,521 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:08,521 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:08,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:08,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:08,522 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) [2019-09-03 20:53:08,542 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:08,543 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:08,598 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:08,598 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:08,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 20:53:08,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:08,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:08,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 226 proven. 495 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 20:53:08,645 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:09,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 226 proven. 495 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 20:53:09,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:09,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 26 [2019-09-03 20:53:09,030 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:09,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 20:53:09,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 20:53:09,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=409, Unknown=0, NotChecked=0, Total=650 [2019-09-03 20:53:09,031 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand 26 states. [2019-09-03 20:53:09,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:09,264 INFO L93 Difference]: Finished difference Result 171 states and 173 transitions. [2019-09-03 20:53:09,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 20:53:09,265 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 157 [2019-09-03 20:53:09,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:09,266 INFO L225 Difference]: With dead ends: 171 [2019-09-03 20:53:09,267 INFO L226 Difference]: Without dead ends: 171 [2019-09-03 20:53:09,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 293 SyntacticMatches, 38 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=247, Invalid=455, Unknown=0, NotChecked=0, Total=702 [2019-09-03 20:53:09,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-03 20:53:09,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2019-09-03 20:53:09,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-03 20:53:09,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2019-09-03 20:53:09,271 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 157 [2019-09-03 20:53:09,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:09,272 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2019-09-03 20:53:09,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 20:53:09,272 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2019-09-03 20:53:09,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-03 20:53:09,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:09,273 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:09,273 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:09,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:09,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1666820774, now seen corresponding path program 37 times [2019-09-03 20:53:09,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:09,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:09,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:09,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:09,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:09,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:09,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1463 backedges. 589 proven. 190 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 20:53:09,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:09,909 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:09,910 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:09,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:09,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:09,910 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 20:53:09,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:09,922 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:09,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 20:53:09,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:10,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1463 backedges. 589 proven. 190 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 20:53:10,662 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:11,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1463 backedges. 589 proven. 190 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 20:53:11,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:11,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 63 [2019-09-03 20:53:11,243 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:11,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-03 20:53:11,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-03 20:53:11,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=923, Invalid=2983, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 20:53:11,244 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 63 states. [2019-09-03 20:53:12,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:12,238 INFO L93 Difference]: Finished difference Result 227 states and 247 transitions. [2019-09-03 20:53:12,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-03 20:53:12,238 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 164 [2019-09-03 20:53:12,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:12,240 INFO L225 Difference]: With dead ends: 227 [2019-09-03 20:53:12,240 INFO L226 Difference]: Without dead ends: 168 [2019-09-03 20:53:12,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 269 SyntacticMatches, 40 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2719 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1637, Invalid=5335, Unknown=0, NotChecked=0, Total=6972 [2019-09-03 20:53:12,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-03 20:53:12,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-09-03 20:53:12,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-09-03 20:53:12,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 169 transitions. [2019-09-03 20:53:12,247 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 169 transitions. Word has length 164 [2019-09-03 20:53:12,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:12,247 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 169 transitions. [2019-09-03 20:53:12,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-03 20:53:12,247 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 169 transitions. [2019-09-03 20:53:12,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-03 20:53:12,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:12,248 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:12,248 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:12,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:12,249 INFO L82 PathProgramCache]: Analyzing trace with hash -566708215, now seen corresponding path program 38 times [2019-09-03 20:53:12,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:12,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:12,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:12,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:12,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:12,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 248 proven. 551 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 20:53:12,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:12,545 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:12,545 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:12,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:12,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:12,546 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) [2019-09-03 20:53:12,564 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:12,564 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:12,644 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-03 20:53:12,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:12,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 20:53:12,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:12,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:12,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 248 proven. 551 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 20:53:12,708 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:13,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 248 proven. 551 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 20:53:13,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:13,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 27 [2019-09-03 20:53:13,333 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:13,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 20:53:13,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 20:53:13,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=439, Unknown=0, NotChecked=0, Total=702 [2019-09-03 20:53:13,334 INFO L87 Difference]: Start difference. First operand 168 states and 169 transitions. Second operand 27 states. [2019-09-03 20:53:13,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:13,550 INFO L93 Difference]: Finished difference Result 179 states and 181 transitions. [2019-09-03 20:53:13,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 20:53:13,551 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 165 [2019-09-03 20:53:13,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:13,552 INFO L225 Difference]: With dead ends: 179 [2019-09-03 20:53:13,552 INFO L226 Difference]: Without dead ends: 179 [2019-09-03 20:53:13,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 308 SyntacticMatches, 40 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=269, Invalid=487, Unknown=0, NotChecked=0, Total=756 [2019-09-03 20:53:13,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-03 20:53:13,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 175. [2019-09-03 20:53:13,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-03 20:53:13,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2019-09-03 20:53:13,558 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 165 [2019-09-03 20:53:13,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:13,558 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2019-09-03 20:53:13,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 20:53:13,559 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2019-09-03 20:53:13,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-03 20:53:13,560 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:13,560 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:13,560 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:13,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:13,560 INFO L82 PathProgramCache]: Analyzing trace with hash -267606695, now seen corresponding path program 39 times [2019-09-03 20:53:13,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:13,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:13,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:13,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:13,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:14,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1620 backedges. 650 proven. 210 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 20:53:14,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:14,364 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:14,364 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:14,364 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:14,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:14,364 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 20:53:14,375 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:14,375 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:14,428 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:14,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:14,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 20:53:14,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:15,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1620 backedges. 650 proven. 210 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 20:53:15,161 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:15,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1620 backedges. 650 proven. 210 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 20:53:15,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:15,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 66 [2019-09-03 20:53:15,748 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:15,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-03 20:53:15,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-03 20:53:15,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1011, Invalid=3279, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 20:53:15,749 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 66 states. [2019-09-03 20:53:17,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:17,122 INFO L93 Difference]: Finished difference Result 238 states and 259 transitions. [2019-09-03 20:53:17,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-03 20:53:17,128 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 172 [2019-09-03 20:53:17,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:17,130 INFO L225 Difference]: With dead ends: 238 [2019-09-03 20:53:17,130 INFO L226 Difference]: Without dead ends: 176 [2019-09-03 20:53:17,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 282 SyntacticMatches, 42 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3002 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1792, Invalid=5864, Unknown=0, NotChecked=0, Total=7656 [2019-09-03 20:53:17,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-03 20:53:17,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2019-09-03 20:53:17,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-09-03 20:53:17,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 177 transitions. [2019-09-03 20:53:17,137 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 177 transitions. Word has length 172 [2019-09-03 20:53:17,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:17,138 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 177 transitions. [2019-09-03 20:53:17,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-03 20:53:17,138 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 177 transitions. [2019-09-03 20:53:17,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-03 20:53:17,139 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:17,139 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:17,140 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:17,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:17,140 INFO L82 PathProgramCache]: Analyzing trace with hash 216328456, now seen corresponding path program 40 times [2019-09-03 20:53:17,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:17,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:17,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:17,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:17,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:17,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:17,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1641 backedges. 271 proven. 610 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 20:53:17,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:17,483 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:17,483 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:17,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:17,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:17,483 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) [2019-09-03 20:53:17,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:17,496 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:17,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-03 20:53:17,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:17,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:17,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1641 backedges. 271 proven. 610 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 20:53:17,602 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:18,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1641 backedges. 271 proven. 610 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 20:53:18,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:18,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 28 [2019-09-03 20:53:18,127 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:18,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 20:53:18,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 20:53:18,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=470, Unknown=0, NotChecked=0, Total=756 [2019-09-03 20:53:18,129 INFO L87 Difference]: Start difference. First operand 176 states and 177 transitions. Second operand 28 states. [2019-09-03 20:53:18,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:18,390 INFO L93 Difference]: Finished difference Result 187 states and 189 transitions. [2019-09-03 20:53:18,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 20:53:18,391 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 173 [2019-09-03 20:53:18,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:18,392 INFO L225 Difference]: With dead ends: 187 [2019-09-03 20:53:18,392 INFO L226 Difference]: Without dead ends: 187 [2019-09-03 20:53:18,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 323 SyntacticMatches, 42 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=292, Invalid=520, Unknown=0, NotChecked=0, Total=812 [2019-09-03 20:53:18,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-03 20:53:18,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2019-09-03 20:53:18,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-09-03 20:53:18,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2019-09-03 20:53:18,398 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 173 [2019-09-03 20:53:18,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:18,399 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2019-09-03 20:53:18,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 20:53:18,399 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2019-09-03 20:53:18,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-03 20:53:18,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:18,400 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:18,400 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:18,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:18,401 INFO L82 PathProgramCache]: Analyzing trace with hash -644470918, now seen corresponding path program 41 times [2019-09-03 20:53:18,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:18,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:18,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:18,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:18,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:19,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 714 proven. 231 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-09-03 20:53:19,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:19,107 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:19,107 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:19,107 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:19,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:19,107 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 20:53:19,118 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:19,118 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:19,186 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-09-03 20:53:19,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:19,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 20:53:19,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:19,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 714 proven. 231 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-09-03 20:53:19,999 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:20,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 714 proven. 231 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-09-03 20:53:20,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:20,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 69 [2019-09-03 20:53:20,680 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:20,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-03 20:53:20,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-03 20:53:20,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1103, Invalid=3589, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 20:53:20,682 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 69 states. [2019-09-03 20:53:22,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:22,217 INFO L93 Difference]: Finished difference Result 249 states and 271 transitions. [2019-09-03 20:53:22,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 20:53:22,217 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 180 [2019-09-03 20:53:22,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:22,218 INFO L225 Difference]: With dead ends: 249 [2019-09-03 20:53:22,218 INFO L226 Difference]: Without dead ends: 184 [2019-09-03 20:53:22,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 295 SyntacticMatches, 44 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3299 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1954, Invalid=6418, Unknown=0, NotChecked=0, Total=8372 [2019-09-03 20:53:22,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-09-03 20:53:22,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-09-03 20:53:22,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-03 20:53:22,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 185 transitions. [2019-09-03 20:53:22,225 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 185 transitions. Word has length 180 [2019-09-03 20:53:22,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:22,225 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 185 transitions. [2019-09-03 20:53:22,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-03 20:53:22,225 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 185 transitions. [2019-09-03 20:53:22,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-03 20:53:22,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:22,227 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:22,227 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:22,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:22,227 INFO L82 PathProgramCache]: Analyzing trace with hash -498906071, now seen corresponding path program 42 times [2019-09-03 20:53:22,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:22,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:22,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:22,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:22,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:22,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1807 backedges. 295 proven. 672 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-09-03 20:53:22,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:22,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:22,609 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:22,609 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:22,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:22,609 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 20:53:22,621 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:22,621 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:22,689 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:22,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:22,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-03 20:53:22,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:22,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:22,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1807 backedges. 295 proven. 672 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-09-03 20:53:22,775 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:23,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1807 backedges. 295 proven. 672 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (43)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:53:23,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:23,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 29 [2019-09-03 20:53:23,322 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:23,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 20:53:23,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 20:53:23,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=502, Unknown=0, NotChecked=0, Total=812 [2019-09-03 20:53:23,324 INFO L87 Difference]: Start difference. First operand 184 states and 185 transitions. Second operand 29 states. [2019-09-03 20:53:23,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:23,603 INFO L93 Difference]: Finished difference Result 195 states and 197 transitions. [2019-09-03 20:53:23,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 20:53:23,603 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 181 [2019-09-03 20:53:23,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:23,605 INFO L225 Difference]: With dead ends: 195 [2019-09-03 20:53:23,605 INFO L226 Difference]: Without dead ends: 195 [2019-09-03 20:53:23,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 338 SyntacticMatches, 44 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=316, Invalid=554, Unknown=0, NotChecked=0, Total=870 [2019-09-03 20:53:23,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-03 20:53:23,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 191. [2019-09-03 20:53:23,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-03 20:53:23,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2019-09-03 20:53:23,611 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 181 [2019-09-03 20:53:23,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:23,611 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2019-09-03 20:53:23,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 20:53:23,612 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2019-09-03 20:53:23,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-03 20:53:23,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:23,613 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:23,613 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:23,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:23,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1457073465, now seen corresponding path program 43 times [2019-09-03 20:53:23,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:23,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:23,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:23,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:23,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:24,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1958 backedges. 781 proven. 253 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-03 20:53:24,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:24,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:24,379 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:24,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:24,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:24,379 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) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:24,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:24,390 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:24,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-03 20:53:24,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:25,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1958 backedges. 781 proven. 253 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-03 20:53:25,379 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:26,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1958 backedges. 781 proven. 253 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-03 20:53:26,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:26,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 72 [2019-09-03 20:53:26,156 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:26,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-03 20:53:26,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-03 20:53:26,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1199, Invalid=3913, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 20:53:26,157 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 72 states. [2019-09-03 20:53:27,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:27,644 INFO L93 Difference]: Finished difference Result 260 states and 283 transitions. [2019-09-03 20:53:27,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-03 20:53:27,646 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 188 [2019-09-03 20:53:27,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:27,648 INFO L225 Difference]: With dead ends: 260 [2019-09-03 20:53:27,648 INFO L226 Difference]: Without dead ends: 192 [2019-09-03 20:53:27,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 308 SyntacticMatches, 46 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3610 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2123, Invalid=6997, Unknown=0, NotChecked=0, Total=9120 [2019-09-03 20:53:27,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-09-03 20:53:27,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2019-09-03 20:53:27,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-03 20:53:27,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 193 transitions. [2019-09-03 20:53:27,654 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 193 transitions. Word has length 188 [2019-09-03 20:53:27,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:27,655 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 193 transitions. [2019-09-03 20:53:27,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-03 20:53:27,655 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 193 transitions. [2019-09-03 20:53:27,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-03 20:53:27,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:27,656 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:27,657 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:27,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:27,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1558852328, now seen corresponding path program 44 times [2019-09-03 20:53:27,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:27,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:27,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:27,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:27,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:28,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1981 backedges. 320 proven. 737 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-03 20:53:28,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:28,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:28,231 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:28,231 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:28,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:28,232 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 20:53:28,256 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:28,256 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:28,409 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-09-03 20:53:28,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:28,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-03 20:53:28,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:28,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:28,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1981 backedges. 320 proven. 737 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-03 20:53:28,532 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:29,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1981 backedges. 320 proven. 737 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (45)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:53:29,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:29,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 30 [2019-09-03 20:53:29,470 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:29,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 20:53:29,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 20:53:29,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=535, Unknown=0, NotChecked=0, Total=870 [2019-09-03 20:53:29,472 INFO L87 Difference]: Start difference. First operand 192 states and 193 transitions. Second operand 30 states. [2019-09-03 20:53:29,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:29,861 INFO L93 Difference]: Finished difference Result 203 states and 205 transitions. [2019-09-03 20:53:29,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 20:53:29,861 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 189 [2019-09-03 20:53:29,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:29,863 INFO L225 Difference]: With dead ends: 203 [2019-09-03 20:53:29,863 INFO L226 Difference]: Without dead ends: 203 [2019-09-03 20:53:29,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 353 SyntacticMatches, 46 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=341, Invalid=589, Unknown=0, NotChecked=0, Total=930 [2019-09-03 20:53:29,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-09-03 20:53:29,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 199. [2019-09-03 20:53:29,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-03 20:53:29,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2019-09-03 20:53:29,871 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 189 [2019-09-03 20:53:29,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:29,872 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2019-09-03 20:53:29,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 20:53:29,872 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2019-09-03 20:53:29,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-03 20:53:29,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:29,874 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:29,876 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:29,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:29,877 INFO L82 PathProgramCache]: Analyzing trace with hash -2067529318, now seen corresponding path program 45 times [2019-09-03 20:53:29,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:29,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:29,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:29,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:29,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:31,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 851 proven. 276 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2019-09-03 20:53:31,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:31,314 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:31,314 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:31,314 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:31,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:31,315 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 20:53:31,337 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:31,337 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:31,426 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:31,427 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:31,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-03 20:53:31,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:32,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 851 proven. 276 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2019-09-03 20:53:32,613 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:33,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 851 proven. 276 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2019-09-03 20:53:33,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:33,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 75 [2019-09-03 20:53:33,435 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:33,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-03 20:53:33,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-03 20:53:33,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1299, Invalid=4251, Unknown=0, NotChecked=0, Total=5550 [2019-09-03 20:53:33,436 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 75 states. [2019-09-03 20:53:35,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:35,199 INFO L93 Difference]: Finished difference Result 271 states and 295 transitions. [2019-09-03 20:53:35,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-03 20:53:35,199 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 196 [2019-09-03 20:53:35,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:35,201 INFO L225 Difference]: With dead ends: 271 [2019-09-03 20:53:35,201 INFO L226 Difference]: Without dead ends: 200 [2019-09-03 20:53:35,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 321 SyntacticMatches, 48 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3935 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2299, Invalid=7601, Unknown=0, NotChecked=0, Total=9900 [2019-09-03 20:53:35,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-09-03 20:53:35,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2019-09-03 20:53:35,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-03 20:53:35,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 201 transitions. [2019-09-03 20:53:35,208 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 201 transitions. Word has length 196 [2019-09-03 20:53:35,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:35,208 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 201 transitions. [2019-09-03 20:53:35,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-03 20:53:35,209 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 201 transitions. [2019-09-03 20:53:35,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-03 20:53:35,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:35,210 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:35,210 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:35,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:35,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1698174903, now seen corresponding path program 46 times [2019-09-03 20:53:35,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:35,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:35,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:35,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:35,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:35,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:35,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2163 backedges. 346 proven. 805 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2019-09-03 20:53:35,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:35,645 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:35,645 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:35,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:35,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:35,645 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) [2019-09-03 20:53:35,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:35,658 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:35,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-03 20:53:35,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:35,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:35,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2163 backedges. 346 proven. 805 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2019-09-03 20:53:35,796 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:36,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2163 backedges. 346 proven. 805 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2019-09-03 20:53:36,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:36,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 31 [2019-09-03 20:53:36,713 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:36,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 20:53:36,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 20:53:36,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=569, Unknown=0, NotChecked=0, Total=930 [2019-09-03 20:53:36,714 INFO L87 Difference]: Start difference. First operand 200 states and 201 transitions. Second operand 31 states. [2019-09-03 20:53:36,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:36,984 INFO L93 Difference]: Finished difference Result 211 states and 213 transitions. [2019-09-03 20:53:36,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 20:53:36,984 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 197 [2019-09-03 20:53:36,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:36,986 INFO L225 Difference]: With dead ends: 211 [2019-09-03 20:53:36,986 INFO L226 Difference]: Without dead ends: 211 [2019-09-03 20:53:36,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 368 SyntacticMatches, 48 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=367, Invalid=625, Unknown=0, NotChecked=0, Total=992 [2019-09-03 20:53:36,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-03 20:53:36,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 207. [2019-09-03 20:53:36,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-09-03 20:53:36,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2019-09-03 20:53:36,994 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 197 [2019-09-03 20:53:36,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:36,994 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2019-09-03 20:53:36,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 20:53:36,994 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2019-09-03 20:53:36,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-03 20:53:36,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:36,996 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:36,996 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:36,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:36,997 INFO L82 PathProgramCache]: Analyzing trace with hash -179131111, now seen corresponding path program 47 times [2019-09-03 20:53:36,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:36,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:36,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:36,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:36,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:37,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2328 backedges. 924 proven. 300 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-09-03 20:53:37,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:37,981 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:37,982 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:37,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 20:53:37,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:37,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 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 20:53:37,992 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:37,993 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:38,077 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-09-03 20:53:38,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:38,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-03 20:53:38,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:39,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2328 backedges. 924 proven. 300 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-09-03 20:53:39,101 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:40,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2328 backedges. 924 proven. 300 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-09-03 20:53:40,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:40,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 78 [2019-09-03 20:53:40,135 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:40,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-03 20:53:40,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-03 20:53:40,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1403, Invalid=4603, Unknown=0, NotChecked=0, Total=6006 [2019-09-03 20:53:40,137 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 78 states. [2019-09-03 20:53:41,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:41,994 INFO L93 Difference]: Finished difference Result 282 states and 307 transitions. [2019-09-03 20:53:41,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-03 20:53:41,997 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 204 [2019-09-03 20:53:41,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:41,999 INFO L225 Difference]: With dead ends: 282 [2019-09-03 20:53:41,999 INFO L226 Difference]: Without dead ends: 208 [2019-09-03 20:53:42,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 334 SyntacticMatches, 50 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4274 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2482, Invalid=8230, Unknown=0, NotChecked=0, Total=10712 [2019-09-03 20:53:42,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-03 20:53:42,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2019-09-03 20:53:42,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-09-03 20:53:42,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 209 transitions. [2019-09-03 20:53:42,005 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 209 transitions. Word has length 204 [2019-09-03 20:53:42,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:42,006 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 209 transitions. [2019-09-03 20:53:42,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-03 20:53:42,006 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 209 transitions. [2019-09-03 20:53:42,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-03 20:53:42,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:42,007 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:42,007 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:42,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:42,008 INFO L82 PathProgramCache]: Analyzing trace with hash 785937608, now seen corresponding path program 48 times [2019-09-03 20:53:42,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:42,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:42,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:42,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:42,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:42,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2353 backedges. 373 proven. 876 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-09-03 20:53:42,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:42,573 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:42,573 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:42,573 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:42,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:42,573 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) [2019-09-03 20:53:42,591 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:42,592 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:42,673 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:42,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:42,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-03 20:53:42,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:42,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:42,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2353 backedges. 373 proven. 876 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-09-03 20:53:42,762 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:43,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2353 backedges. 373 proven. 876 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-09-03 20:53:43,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:43,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 32 [2019-09-03 20:53:43,340 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:43,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 20:53:43,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 20:53:43,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=604, Unknown=0, NotChecked=0, Total=992 [2019-09-03 20:53:43,341 INFO L87 Difference]: Start difference. First operand 208 states and 209 transitions. Second operand 32 states. [2019-09-03 20:53:43,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:43,607 INFO L93 Difference]: Finished difference Result 219 states and 221 transitions. [2019-09-03 20:53:43,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 20:53:43,607 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 205 [2019-09-03 20:53:43,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:43,609 INFO L225 Difference]: With dead ends: 219 [2019-09-03 20:53:43,609 INFO L226 Difference]: Without dead ends: 219 [2019-09-03 20:53:43,610 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 383 SyntacticMatches, 50 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=394, Invalid=662, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 20:53:43,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-03 20:53:43,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 215. [2019-09-03 20:53:43,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-09-03 20:53:43,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2019-09-03 20:53:43,616 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 205 [2019-09-03 20:53:43,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:43,616 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2019-09-03 20:53:43,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 20:53:43,616 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2019-09-03 20:53:43,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-03 20:53:43,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:43,618 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:43,618 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:43,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:43,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1552016314, now seen corresponding path program 49 times [2019-09-03 20:53:43,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:43,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:43,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:43,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:43,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:44,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2525 backedges. 1000 proven. 325 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2019-09-03 20:53:44,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:44,594 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:44,594 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:44,595 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:44,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:44,595 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 20:53:44,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:44,607 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:44,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-03 20:53:44,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:45,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2525 backedges. 1000 proven. 325 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2019-09-03 20:53:45,796 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:46,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2525 backedges. 1000 proven. 325 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2019-09-03 20:53:46,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:46,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 81 [2019-09-03 20:53:46,651 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:46,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-03 20:53:46,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-03 20:53:46,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1511, Invalid=4969, Unknown=0, NotChecked=0, Total=6480 [2019-09-03 20:53:46,652 INFO L87 Difference]: Start difference. First operand 215 states and 216 transitions. Second operand 81 states. [2019-09-03 20:53:48,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:48,724 INFO L93 Difference]: Finished difference Result 293 states and 319 transitions. [2019-09-03 20:53:48,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-03 20:53:48,724 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 212 [2019-09-03 20:53:48,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:48,727 INFO L225 Difference]: With dead ends: 293 [2019-09-03 20:53:48,727 INFO L226 Difference]: Without dead ends: 216 [2019-09-03 20:53:48,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 347 SyntacticMatches, 52 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4627 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2672, Invalid=8884, Unknown=0, NotChecked=0, Total=11556 [2019-09-03 20:53:48,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-03 20:53:48,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-09-03 20:53:48,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-09-03 20:53:48,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 217 transitions. [2019-09-03 20:53:48,734 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 217 transitions. Word has length 212 [2019-09-03 20:53:48,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:48,734 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 217 transitions. [2019-09-03 20:53:48,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-03 20:53:48,734 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 217 transitions. [2019-09-03 20:53:48,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-03 20:53:48,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:48,736 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:48,736 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:48,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:48,737 INFO L82 PathProgramCache]: Analyzing trace with hash -837251991, now seen corresponding path program 50 times [2019-09-03 20:53:48,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:48,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:48,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:48,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:48,738 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:49,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 401 proven. 950 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2019-09-03 20:53:49,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:49,199 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:49,200 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:49,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:49,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:49,200 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) [2019-09-03 20:53:49,219 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:49,219 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:49,337 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-09-03 20:53:49,338 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:49,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-03 20:53:49,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:49,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:49,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 401 proven. 950 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2019-09-03 20:53:49,434 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:50,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 401 proven. 950 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2019-09-03 20:53:50,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:50,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 33 [2019-09-03 20:53:50,009 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:50,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 20:53:50,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 20:53:50,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=416, Invalid=640, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 20:53:50,010 INFO L87 Difference]: Start difference. First operand 216 states and 217 transitions. Second operand 33 states. [2019-09-03 20:53:50,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:50,342 INFO L93 Difference]: Finished difference Result 227 states and 229 transitions. [2019-09-03 20:53:50,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 20:53:50,342 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 213 [2019-09-03 20:53:50,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:50,344 INFO L225 Difference]: With dead ends: 227 [2019-09-03 20:53:50,345 INFO L226 Difference]: Without dead ends: 227 [2019-09-03 20:53:50,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 398 SyntacticMatches, 52 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=422, Invalid=700, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 20:53:50,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-09-03 20:53:50,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 223. [2019-09-03 20:53:50,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-03 20:53:50,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 224 transitions. [2019-09-03 20:53:50,351 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 224 transitions. Word has length 213 [2019-09-03 20:53:50,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:50,351 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 224 transitions. [2019-09-03 20:53:50,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 20:53:50,351 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 224 transitions. [2019-09-03 20:53:50,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-03 20:53:50,353 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:50,353 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:50,353 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:50,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:50,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1528355591, now seen corresponding path program 51 times [2019-09-03 20:53:50,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:50,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:50,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:50,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:50,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:51,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2730 backedges. 1079 proven. 351 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2019-09-03 20:53:51,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:51,360 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:51,361 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:51,361 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:51,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:51,361 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 20:53:51,374 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:51,374 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:51,445 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:51,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:51,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-03 20:53:51,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:52,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2730 backedges. 1079 proven. 351 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2019-09-03 20:53:52,608 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:53,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2730 backedges. 1079 proven. 351 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (52)] Exception during sending of exit command (exit): Stream closed [2019-09-03 20:53:53,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:53,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 84 [2019-09-03 20:53:53,491 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:53,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-09-03 20:53:53,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-09-03 20:53:53,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1623, Invalid=5349, Unknown=0, NotChecked=0, Total=6972 [2019-09-03 20:53:53,492 INFO L87 Difference]: Start difference. First operand 223 states and 224 transitions. Second operand 84 states. [2019-09-03 20:53:55,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:55,706 INFO L93 Difference]: Finished difference Result 304 states and 331 transitions. [2019-09-03 20:53:55,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-03 20:53:55,707 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 220 [2019-09-03 20:53:55,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:55,708 INFO L225 Difference]: With dead ends: 304 [2019-09-03 20:53:55,709 INFO L226 Difference]: Without dead ends: 224 [2019-09-03 20:53:55,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 360 SyntacticMatches, 54 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4994 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2869, Invalid=9563, Unknown=0, NotChecked=0, Total=12432 [2019-09-03 20:53:55,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-09-03 20:53:55,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2019-09-03 20:53:55,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-09-03 20:53:55,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 225 transitions. [2019-09-03 20:53:55,716 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 225 transitions. Word has length 220 [2019-09-03 20:53:55,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:55,716 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 225 transitions. [2019-09-03 20:53:55,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-09-03 20:53:55,716 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 225 transitions. [2019-09-03 20:53:55,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-03 20:53:55,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:55,718 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:55,718 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:55,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:55,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1679666856, now seen corresponding path program 52 times [2019-09-03 20:53:55,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:55,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:55,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:55,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:55,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:56,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2757 backedges. 430 proven. 1027 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2019-09-03 20:53:56,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:56,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:56,155 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:56,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:56,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:56,156 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 20:53:56,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:56,166 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:56,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-03 20:53:56,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:56,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:56,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2757 backedges. 430 proven. 1027 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2019-09-03 20:53:56,349 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:57,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2757 backedges. 430 proven. 1027 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2019-09-03 20:53:57,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:57,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 34 [2019-09-03 20:53:57,113 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:57,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 20:53:57,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 20:53:57,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=677, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 20:53:57,115 INFO L87 Difference]: Start difference. First operand 224 states and 225 transitions. Second operand 34 states. [2019-09-03 20:53:57,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:57,407 INFO L93 Difference]: Finished difference Result 235 states and 237 transitions. [2019-09-03 20:53:57,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 20:53:57,407 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 221 [2019-09-03 20:53:57,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:57,409 INFO L225 Difference]: With dead ends: 235 [2019-09-03 20:53:57,409 INFO L226 Difference]: Without dead ends: 235 [2019-09-03 20:53:57,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 413 SyntacticMatches, 54 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=451, Invalid=739, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 20:53:57,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-09-03 20:53:57,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 231. [2019-09-03 20:53:57,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-09-03 20:53:57,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 232 transitions. [2019-09-03 20:53:57,414 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 232 transitions. Word has length 221 [2019-09-03 20:53:57,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:57,415 INFO L475 AbstractCegarLoop]: Abstraction has 231 states and 232 transitions. [2019-09-03 20:53:57,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 20:53:57,415 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 232 transitions. [2019-09-03 20:53:57,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-03 20:53:57,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:57,416 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:57,417 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:57,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:57,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1482568230, now seen corresponding path program 53 times [2019-09-03 20:53:57,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:57,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:57,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:57,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:57,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:58,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2943 backedges. 1161 proven. 378 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-09-03 20:53:58,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:58,658 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:58,658 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:58,659 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:58,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:58,659 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 20:53:58,668 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:58,669 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:58,767 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-09-03 20:53:58,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:58,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-03 20:53:58,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:00,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2943 backedges. 1161 proven. 378 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-09-03 20:54:00,051 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:01,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2943 backedges. 1161 proven. 378 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-09-03 20:54:01,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:01,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 87 [2019-09-03 20:54:01,075 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:01,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-03 20:54:01,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-03 20:54:01,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1739, Invalid=5743, Unknown=0, NotChecked=0, Total=7482 [2019-09-03 20:54:01,076 INFO L87 Difference]: Start difference. First operand 231 states and 232 transitions. Second operand 87 states. [2019-09-03 20:54:03,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:03,429 INFO L93 Difference]: Finished difference Result 315 states and 343 transitions. [2019-09-03 20:54:03,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 20:54:03,430 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 228 [2019-09-03 20:54:03,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:03,432 INFO L225 Difference]: With dead ends: 315 [2019-09-03 20:54:03,432 INFO L226 Difference]: Without dead ends: 232 [2019-09-03 20:54:03,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 373 SyntacticMatches, 56 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5375 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3073, Invalid=10267, Unknown=0, NotChecked=0, Total=13340 [2019-09-03 20:54:03,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-09-03 20:54:03,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2019-09-03 20:54:03,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-09-03 20:54:03,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 233 transitions. [2019-09-03 20:54:03,443 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 233 transitions. Word has length 228 [2019-09-03 20:54:03,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:03,444 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 233 transitions. [2019-09-03 20:54:03,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-03 20:54:03,444 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 233 transitions. [2019-09-03 20:54:03,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-03 20:54:03,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:03,447 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:03,447 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:03,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:03,448 INFO L82 PathProgramCache]: Analyzing trace with hash -888719223, now seen corresponding path program 54 times [2019-09-03 20:54:03,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:03,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:03,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:03,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:03,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:04,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2971 backedges. 460 proven. 1107 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-09-03 20:54:04,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:04,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:04,110 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:04,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:04,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:04,111 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 20:54:04,120 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:04,121 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:54:04,195 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:04,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:04,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-03 20:54:04,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:04,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:04,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2971 backedges. 460 proven. 1107 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-09-03 20:54:04,259 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:04,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2971 backedges. 460 proven. 1107 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-09-03 20:54:04,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:04,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 35 [2019-09-03 20:54:04,912 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:04,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 20:54:04,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 20:54:04,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=715, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 20:54:04,913 INFO L87 Difference]: Start difference. First operand 232 states and 233 transitions. Second operand 35 states. [2019-09-03 20:54:05,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:05,258 INFO L93 Difference]: Finished difference Result 243 states and 245 transitions. [2019-09-03 20:54:05,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 20:54:05,258 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 229 [2019-09-03 20:54:05,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:05,260 INFO L225 Difference]: With dead ends: 243 [2019-09-03 20:54:05,260 INFO L226 Difference]: Without dead ends: 243 [2019-09-03 20:54:05,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 428 SyntacticMatches, 56 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 925 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=481, Invalid=779, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 20:54:05,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-09-03 20:54:05,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 239. [2019-09-03 20:54:05,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-09-03 20:54:05,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 240 transitions. [2019-09-03 20:54:05,267 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 240 transitions. Word has length 229 [2019-09-03 20:54:05,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:05,267 INFO L475 AbstractCegarLoop]: Abstraction has 239 states and 240 transitions. [2019-09-03 20:54:05,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 20:54:05,267 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 240 transitions. [2019-09-03 20:54:05,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-03 20:54:05,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:05,269 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:05,269 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:05,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:05,270 INFO L82 PathProgramCache]: Analyzing trace with hash 646223065, now seen corresponding path program 55 times [2019-09-03 20:54:05,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:05,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:05,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:05,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:05,271 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:06,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3164 backedges. 1246 proven. 406 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-09-03 20:54:06,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:06,520 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:06,520 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:06,520 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:06,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:06,520 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 20:54:06,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:06,533 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:54:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:06,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-03 20:54:06,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:07,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3164 backedges. 1246 proven. 406 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-09-03 20:54:07,953 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:09,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3164 backedges. 1246 proven. 406 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-09-03 20:54:09,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:09,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 90 [2019-09-03 20:54:09,054 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:09,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-09-03 20:54:09,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-09-03 20:54:09,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1859, Invalid=6151, Unknown=0, NotChecked=0, Total=8010 [2019-09-03 20:54:09,057 INFO L87 Difference]: Start difference. First operand 239 states and 240 transitions. Second operand 90 states. [2019-09-03 20:54:11,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:11,144 INFO L93 Difference]: Finished difference Result 326 states and 355 transitions. [2019-09-03 20:54:11,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-03 20:54:11,144 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 236 [2019-09-03 20:54:11,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:11,145 INFO L225 Difference]: With dead ends: 326 [2019-09-03 20:54:11,145 INFO L226 Difference]: Without dead ends: 240 [2019-09-03 20:54:11,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 562 GetRequests, 386 SyntacticMatches, 58 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5770 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3284, Invalid=10996, Unknown=0, NotChecked=0, Total=14280 [2019-09-03 20:54:11,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-09-03 20:54:11,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2019-09-03 20:54:11,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-09-03 20:54:11,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 241 transitions. [2019-09-03 20:54:11,152 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 241 transitions. Word has length 236 [2019-09-03 20:54:11,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:11,152 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 241 transitions. [2019-09-03 20:54:11,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-09-03 20:54:11,153 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 241 transitions. [2019-09-03 20:54:11,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-03 20:54:11,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:11,154 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:11,154 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:11,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:11,155 INFO L82 PathProgramCache]: Analyzing trace with hash -978853752, now seen corresponding path program 56 times [2019-09-03 20:54:11,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:11,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:11,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:11,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:11,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:11,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3193 backedges. 491 proven. 1190 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-09-03 20:54:11,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:11,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:11,629 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:11,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 20:54:11,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:11,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 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 20:54:11,641 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:11,641 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:54:11,742 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-09-03 20:54:11,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:11,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-03 20:54:11,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:11,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:11,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3193 backedges. 491 proven. 1190 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-09-03 20:54:11,811 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:12,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3193 backedges. 491 proven. 1190 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-09-03 20:54:12,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:12,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 36 [2019-09-03 20:54:12,543 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:12,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 20:54:12,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 20:54:12,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=506, Invalid=754, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 20:54:12,544 INFO L87 Difference]: Start difference. First operand 240 states and 241 transitions. Second operand 36 states. [2019-09-03 20:54:12,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:12,831 INFO L93 Difference]: Finished difference Result 251 states and 253 transitions. [2019-09-03 20:54:12,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 20:54:12,832 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 237 [2019-09-03 20:54:12,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:12,834 INFO L225 Difference]: With dead ends: 251 [2019-09-03 20:54:12,834 INFO L226 Difference]: Without dead ends: 251 [2019-09-03 20:54:12,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 443 SyntacticMatches, 58 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=512, Invalid=820, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 20:54:12,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-09-03 20:54:12,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 247. [2019-09-03 20:54:12,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-09-03 20:54:12,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 248 transitions. [2019-09-03 20:54:12,840 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 248 transitions. Word has length 237 [2019-09-03 20:54:12,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:12,840 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 248 transitions. [2019-09-03 20:54:12,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 20:54:12,840 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 248 transitions. [2019-09-03 20:54:12,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-03 20:54:12,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:12,842 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:12,842 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:12,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:12,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1433780218, now seen corresponding path program 57 times [2019-09-03 20:54:12,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:12,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:12,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:12,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:12,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:14,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3393 backedges. 1334 proven. 435 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2019-09-03 20:54:14,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:14,062 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:14,062 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:14,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:14,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:14,063 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 20:54:14,072 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:14,072 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:54:14,152 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:14,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:14,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-03 20:54:14,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:15,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3393 backedges. 1334 proven. 435 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2019-09-03 20:54:15,575 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:16,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3393 backedges. 1334 proven. 435 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2019-09-03 20:54:16,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:16,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 93 [2019-09-03 20:54:16,681 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:16,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-03 20:54:16,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-03 20:54:16,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1983, Invalid=6573, Unknown=0, NotChecked=0, Total=8556 [2019-09-03 20:54:16,682 INFO L87 Difference]: Start difference. First operand 247 states and 248 transitions. Second operand 93 states. [2019-09-03 20:54:18,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:18,241 INFO L93 Difference]: Finished difference Result 337 states and 367 transitions. [2019-09-03 20:54:18,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-03 20:54:18,241 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 244 [2019-09-03 20:54:18,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:18,243 INFO L225 Difference]: With dead ends: 337 [2019-09-03 20:54:18,243 INFO L226 Difference]: Without dead ends: 248 [2019-09-03 20:54:18,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 399 SyntacticMatches, 60 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6179 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=3502, Invalid=11750, Unknown=0, NotChecked=0, Total=15252 [2019-09-03 20:54:18,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-09-03 20:54:18,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2019-09-03 20:54:18,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-03 20:54:18,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 249 transitions. [2019-09-03 20:54:18,249 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 249 transitions. Word has length 244 [2019-09-03 20:54:18,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:18,250 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 249 transitions. [2019-09-03 20:54:18,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-09-03 20:54:18,250 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 249 transitions. [2019-09-03 20:54:18,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-03 20:54:18,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:18,252 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:18,252 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:18,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:18,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1998197591, now seen corresponding path program 58 times [2019-09-03 20:54:18,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:18,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:18,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:18,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:18,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:18,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:18,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3423 backedges. 523 proven. 1276 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2019-09-03 20:54:18,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:18,799 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:18,799 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:18,799 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:18,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:18,799 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 20:54:18,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:18,810 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:54:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:18,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-03 20:54:18,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:18,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:18,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3423 backedges. 523 proven. 1276 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2019-09-03 20:54:18,962 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:19,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3423 backedges. 523 proven. 1276 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2019-09-03 20:54:19,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:19,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 37 [2019-09-03 20:54:19,724 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:19,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 20:54:19,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 20:54:19,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=538, Invalid=794, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 20:54:19,725 INFO L87 Difference]: Start difference. First operand 248 states and 249 transitions. Second operand 37 states. [2019-09-03 20:54:20,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:20,066 INFO L93 Difference]: Finished difference Result 259 states and 261 transitions. [2019-09-03 20:54:20,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 20:54:20,067 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 245 [2019-09-03 20:54:20,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:20,069 INFO L225 Difference]: With dead ends: 259 [2019-09-03 20:54:20,069 INFO L226 Difference]: Without dead ends: 259 [2019-09-03 20:54:20,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 458 SyntacticMatches, 60 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1051 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=544, Invalid=862, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 20:54:20,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-09-03 20:54:20,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 255. [2019-09-03 20:54:20,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-03 20:54:20,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 256 transitions. [2019-09-03 20:54:20,074 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 256 transitions. Word has length 245 [2019-09-03 20:54:20,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:20,075 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 256 transitions. [2019-09-03 20:54:20,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 20:54:20,075 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 256 transitions. [2019-09-03 20:54:20,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-03 20:54:20,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:20,077 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:20,077 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:20,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:20,077 INFO L82 PathProgramCache]: Analyzing trace with hash 43580601, now seen corresponding path program 59 times [2019-09-03 20:54:20,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:20,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:20,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:20,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:20,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:21,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3630 backedges. 1425 proven. 465 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2019-09-03 20:54:21,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:21,371 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:21,371 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:21,371 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:21,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:21,371 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 20:54:21,382 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:21,382 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:54:21,489 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-09-03 20:54:21,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:21,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-03 20:54:21,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:23,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3630 backedges. 1425 proven. 465 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2019-09-03 20:54:23,028 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:24,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3630 backedges. 1425 proven. 465 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2019-09-03 20:54:24,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:24,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 96 [2019-09-03 20:54:24,188 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:24,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-09-03 20:54:24,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-09-03 20:54:24,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2111, Invalid=7009, Unknown=0, NotChecked=0, Total=9120 [2019-09-03 20:54:24,190 INFO L87 Difference]: Start difference. First operand 255 states and 256 transitions. Second operand 96 states. [2019-09-03 20:54:25,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:25,599 INFO L93 Difference]: Finished difference Result 348 states and 379 transitions. [2019-09-03 20:54:25,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-03 20:54:25,600 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 252 [2019-09-03 20:54:25,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:25,601 INFO L225 Difference]: With dead ends: 348 [2019-09-03 20:54:25,601 INFO L226 Difference]: Without dead ends: 256 [2019-09-03 20:54:25,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 412 SyntacticMatches, 62 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6602 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3727, Invalid=12529, Unknown=0, NotChecked=0, Total=16256 [2019-09-03 20:54:25,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-09-03 20:54:25,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2019-09-03 20:54:25,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-03 20:54:25,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 257 transitions. [2019-09-03 20:54:25,608 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 257 transitions. Word has length 252 [2019-09-03 20:54:25,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:25,608 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 257 transitions. [2019-09-03 20:54:25,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-09-03 20:54:25,608 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 257 transitions. [2019-09-03 20:54:25,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-03 20:54:25,609 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:25,610 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:25,610 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:25,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:25,610 INFO L82 PathProgramCache]: Analyzing trace with hash -471528856, now seen corresponding path program 60 times [2019-09-03 20:54:25,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:25,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:25,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:25,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:25,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:26,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3661 backedges. 556 proven. 1365 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2019-09-03 20:54:26,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:26,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:26,158 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:26,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:26,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:26,158 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 20:54:26,169 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:26,169 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:54:26,246 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:26,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:26,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-03 20:54:26,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:26,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:26,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3661 backedges. 556 proven. 1365 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2019-09-03 20:54:26,324 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:27,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3661 backedges. 556 proven. 1365 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2019-09-03 20:54:27,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:27,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 38 [2019-09-03 20:54:27,154 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:27,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 20:54:27,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 20:54:27,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=571, Invalid=835, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 20:54:27,155 INFO L87 Difference]: Start difference. First operand 256 states and 257 transitions. Second operand 38 states. [2019-09-03 20:54:27,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:27,551 INFO L93 Difference]: Finished difference Result 267 states and 269 transitions. [2019-09-03 20:54:27,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 20:54:27,552 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 253 [2019-09-03 20:54:27,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:27,554 INFO L225 Difference]: With dead ends: 267 [2019-09-03 20:54:27,554 INFO L226 Difference]: Without dead ends: 267 [2019-09-03 20:54:27,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 473 SyntacticMatches, 62 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1117 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=577, Invalid=905, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 20:54:27,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-09-03 20:54:27,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 263. [2019-09-03 20:54:27,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-03 20:54:27,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 264 transitions. [2019-09-03 20:54:27,559 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 264 transitions. Word has length 253 [2019-09-03 20:54:27,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:27,559 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 264 transitions. [2019-09-03 20:54:27,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 20:54:27,560 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 264 transitions. [2019-09-03 20:54:27,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-03 20:54:27,561 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:27,561 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:27,562 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:27,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:27,562 INFO L82 PathProgramCache]: Analyzing trace with hash 500152858, now seen corresponding path program 61 times [2019-09-03 20:54:27,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:27,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:27,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:27,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:27,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:28,946 INFO L134 CoverageAnalysis]: Checked inductivity of 3875 backedges. 1519 proven. 496 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-09-03 20:54:28,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:28,946 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:28,946 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:28,947 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:28,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:28,947 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 20:54:28,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:28,956 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:54:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:29,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-03 20:54:29,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:30,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3875 backedges. 1519 proven. 496 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-09-03 20:54:30,691 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:31,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3875 backedges. 1519 proven. 496 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-09-03 20:54:31,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:31,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 99 [2019-09-03 20:54:31,994 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:31,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-09-03 20:54:31,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-09-03 20:54:31,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2243, Invalid=7459, Unknown=0, NotChecked=0, Total=9702 [2019-09-03 20:54:31,996 INFO L87 Difference]: Start difference. First operand 263 states and 264 transitions. Second operand 99 states. [2019-09-03 20:54:34,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:34,192 INFO L93 Difference]: Finished difference Result 359 states and 391 transitions. [2019-09-03 20:54:34,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-03 20:54:34,193 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 260 [2019-09-03 20:54:34,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:34,195 INFO L225 Difference]: With dead ends: 359 [2019-09-03 20:54:34,195 INFO L226 Difference]: Without dead ends: 264 [2019-09-03 20:54:34,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 425 SyntacticMatches, 64 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7039 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=3959, Invalid=13333, Unknown=0, NotChecked=0, Total=17292 [2019-09-03 20:54:34,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-09-03 20:54:34,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2019-09-03 20:54:34,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-03 20:54:34,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 265 transitions. [2019-09-03 20:54:34,202 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 265 transitions. Word has length 260 [2019-09-03 20:54:34,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:34,202 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 265 transitions. [2019-09-03 20:54:34,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-09-03 20:54:34,202 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 265 transitions. [2019-09-03 20:54:34,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-03 20:54:34,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:34,204 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:34,204 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:34,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:34,205 INFO L82 PathProgramCache]: Analyzing trace with hash -947476279, now seen corresponding path program 62 times [2019-09-03 20:54:34,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:34,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:34,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:34,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:34,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:34,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3907 backedges. 590 proven. 1457 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-09-03 20:54:34,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:34,775 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:34,775 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:34,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:34,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:34,776 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 20:54:34,786 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:34,787 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:54:34,922 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-09-03 20:54:34,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:34,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-03 20:54:34,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:34,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:35,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3907 backedges. 590 proven. 1457 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-09-03 20:54:35,000 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:35,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3907 backedges. 590 proven. 1457 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-09-03 20:54:35,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:35,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 39 [2019-09-03 20:54:35,841 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:35,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 20:54:35,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 20:54:35,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=605, Invalid=877, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 20:54:35,843 INFO L87 Difference]: Start difference. First operand 264 states and 265 transitions. Second operand 39 states. [2019-09-03 20:54:36,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:36,244 INFO L93 Difference]: Finished difference Result 275 states and 277 transitions. [2019-09-03 20:54:36,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-03 20:54:36,245 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 261 [2019-09-03 20:54:36,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:36,246 INFO L225 Difference]: With dead ends: 275 [2019-09-03 20:54:36,247 INFO L226 Difference]: Without dead ends: 275 [2019-09-03 20:54:36,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 488 SyntacticMatches, 64 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=611, Invalid=949, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 20:54:36,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-09-03 20:54:36,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 271. [2019-09-03 20:54:36,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-03 20:54:36,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 272 transitions. [2019-09-03 20:54:36,252 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 272 transitions. Word has length 261 [2019-09-03 20:54:36,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:36,252 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 272 transitions. [2019-09-03 20:54:36,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 20:54:36,253 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 272 transitions. [2019-09-03 20:54:36,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-03 20:54:36,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:36,254 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:36,255 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:36,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:36,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1762811033, now seen corresponding path program 63 times [2019-09-03 20:54:36,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:36,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:36,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:36,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:36,256 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:36,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:37,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4128 backedges. 1616 proven. 528 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-09-03 20:54:37,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:37,746 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:37,746 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:37,746 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:37,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:37,747 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 20:54:37,757 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:37,757 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:54:37,845 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:37,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:37,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-03 20:54:37,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:39,526 INFO L134 CoverageAnalysis]: Checked inductivity of 4128 backedges. 1616 proven. 528 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-09-03 20:54:39,526 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:40,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4128 backedges. 1616 proven. 528 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-09-03 20:54:40,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:40,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 102 [2019-09-03 20:54:40,824 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:40,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-09-03 20:54:40,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-09-03 20:54:40,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2379, Invalid=7923, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:40,827 INFO L87 Difference]: Start difference. First operand 271 states and 272 transitions. Second operand 102 states. [2019-09-03 20:54:43,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:43,010 INFO L93 Difference]: Finished difference Result 370 states and 403 transitions. [2019-09-03 20:54:43,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-03 20:54:43,010 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 268 [2019-09-03 20:54:43,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:43,012 INFO L225 Difference]: With dead ends: 370 [2019-09-03 20:54:43,013 INFO L226 Difference]: Without dead ends: 272 [2019-09-03 20:54:43,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 438 SyntacticMatches, 66 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7490 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=4198, Invalid=14162, Unknown=0, NotChecked=0, Total=18360 [2019-09-03 20:54:43,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-09-03 20:54:43,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2019-09-03 20:54:43,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-03 20:54:43,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 273 transitions. [2019-09-03 20:54:43,022 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 273 transitions. Word has length 268 [2019-09-03 20:54:43,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:43,022 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 273 transitions. [2019-09-03 20:54:43,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-09-03 20:54:43,023 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 273 transitions. [2019-09-03 20:54:43,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-09-03 20:54:43,024 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:43,025 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:43,025 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:43,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:43,025 INFO L82 PathProgramCache]: Analyzing trace with hash -154981304, now seen corresponding path program 64 times [2019-09-03 20:54:43,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:43,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:43,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:43,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:43,026 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:43,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4161 backedges. 625 proven. 1552 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-09-03 20:54:43,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:43,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:43,729 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:43,729 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:43,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:43,729 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 20:54:43,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:43,741 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:54:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:43,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-03 20:54:43,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:43,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:43,900 INFO L134 CoverageAnalysis]: Checked inductivity of 4161 backedges. 625 proven. 1552 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-09-03 20:54:43,901 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:44,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4161 backedges. 625 proven. 1552 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-09-03 20:54:44,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:44,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 40 [2019-09-03 20:54:44,777 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:44,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-03 20:54:44,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-03 20:54:44,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=640, Invalid=920, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 20:54:44,778 INFO L87 Difference]: Start difference. First operand 272 states and 273 transitions. Second operand 40 states. [2019-09-03 20:54:45,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:45,156 INFO L93 Difference]: Finished difference Result 283 states and 285 transitions. [2019-09-03 20:54:45,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 20:54:45,156 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 269 [2019-09-03 20:54:45,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:45,158 INFO L225 Difference]: With dead ends: 283 [2019-09-03 20:54:45,159 INFO L226 Difference]: Without dead ends: 283 [2019-09-03 20:54:45,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 503 SyntacticMatches, 66 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1255 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=646, Invalid=994, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 20:54:45,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-09-03 20:54:45,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 279. [2019-09-03 20:54:45,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-09-03 20:54:45,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 280 transitions. [2019-09-03 20:54:45,163 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 280 transitions. Word has length 269 [2019-09-03 20:54:45,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:45,164 INFO L475 AbstractCegarLoop]: Abstraction has 279 states and 280 transitions. [2019-09-03 20:54:45,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-03 20:54:45,164 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 280 transitions. [2019-09-03 20:54:45,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-09-03 20:54:45,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:45,166 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:45,166 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:45,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:45,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1593721798, now seen corresponding path program 65 times [2019-09-03 20:54:45,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:45,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:45,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:45,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:45,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:46,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 1716 proven. 561 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2019-09-03 20:54:46,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:46,676 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:46,676 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:46,677 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:46,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:46,677 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 20:54:46,688 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:46,688 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:54:46,814 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-09-03 20:54:46,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:46,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-03 20:54:46,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:48,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 1716 proven. 561 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2019-09-03 20:54:48,612 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:49,993 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 1716 proven. 561 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2019-09-03 20:54:49,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:49,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 105 [2019-09-03 20:54:49,998 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:49,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-09-03 20:54:49,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-09-03 20:54:49,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2519, Invalid=8401, Unknown=0, NotChecked=0, Total=10920 [2019-09-03 20:54:50,000 INFO L87 Difference]: Start difference. First operand 279 states and 280 transitions. Second operand 105 states. [2019-09-03 20:54:52,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:52,386 INFO L93 Difference]: Finished difference Result 381 states and 415 transitions. [2019-09-03 20:54:52,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-03 20:54:52,386 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 276 [2019-09-03 20:54:52,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:52,389 INFO L225 Difference]: With dead ends: 381 [2019-09-03 20:54:52,389 INFO L226 Difference]: Without dead ends: 280 [2019-09-03 20:54:52,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 657 GetRequests, 451 SyntacticMatches, 68 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7955 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=4444, Invalid=15016, Unknown=0, NotChecked=0, Total=19460 [2019-09-03 20:54:52,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-09-03 20:54:52,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2019-09-03 20:54:52,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-09-03 20:54:52,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 281 transitions. [2019-09-03 20:54:52,396 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 281 transitions. Word has length 276 [2019-09-03 20:54:52,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:52,396 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 281 transitions. [2019-09-03 20:54:52,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-09-03 20:54:52,396 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 281 transitions. [2019-09-03 20:54:52,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-09-03 20:54:52,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:52,398 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:52,399 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:52,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:52,399 INFO L82 PathProgramCache]: Analyzing trace with hash 792423657, now seen corresponding path program 66 times [2019-09-03 20:54:52,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:52,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:52,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:52,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:52,400 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:53,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4423 backedges. 661 proven. 1650 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2019-09-03 20:54:53,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:53,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:53,071 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:53,071 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:53,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:53,071 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 20:54:53,081 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:53,081 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:54:53,171 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:53,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:53,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-03 20:54:53,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:53,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:53,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4423 backedges. 661 proven. 1650 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2019-09-03 20:54:53,253 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:54,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4423 backedges. 661 proven. 1650 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2019-09-03 20:54:54,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:54,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 41 [2019-09-03 20:54:54,162 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:54,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 20:54:54,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 20:54:54,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=676, Invalid=964, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 20:54:54,164 INFO L87 Difference]: Start difference. First operand 280 states and 281 transitions. Second operand 41 states. [2019-09-03 20:54:54,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:54,615 INFO L93 Difference]: Finished difference Result 291 states and 293 transitions. [2019-09-03 20:54:54,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-03 20:54:54,615 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 277 [2019-09-03 20:54:54,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:54,617 INFO L225 Difference]: With dead ends: 291 [2019-09-03 20:54:54,617 INFO L226 Difference]: Without dead ends: 291 [2019-09-03 20:54:54,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 518 SyntacticMatches, 68 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1327 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=682, Invalid=1040, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 20:54:54,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-09-03 20:54:54,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 287. [2019-09-03 20:54:54,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-09-03 20:54:54,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 288 transitions. [2019-09-03 20:54:54,624 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 288 transitions. Word has length 277 [2019-09-03 20:54:54,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:54,624 INFO L475 AbstractCegarLoop]: Abstraction has 287 states and 288 transitions. [2019-09-03 20:54:54,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 20:54:54,624 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 288 transitions. [2019-09-03 20:54:54,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-09-03 20:54:54,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:54,626 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:54,626 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:54,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:54,627 INFO L82 PathProgramCache]: Analyzing trace with hash 291419257, now seen corresponding path program 67 times [2019-09-03 20:54:54,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:54,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:54,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:54,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:54,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:56,208 INFO L134 CoverageAnalysis]: Checked inductivity of 4658 backedges. 1819 proven. 595 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2019-09-03 20:54:56,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:56,208 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:56,209 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:56,209 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:56,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:56,209 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 20:54:56,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:56,219 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:54:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:56,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-03 20:54:56,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:58,232 INFO L134 CoverageAnalysis]: Checked inductivity of 4658 backedges. 1819 proven. 595 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2019-09-03 20:54:58,232 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:59,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4658 backedges. 1819 proven. 595 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2019-09-03 20:54:59,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:59,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 108 [2019-09-03 20:54:59,712 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:59,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-09-03 20:54:59,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-09-03 20:54:59,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2663, Invalid=8893, Unknown=0, NotChecked=0, Total=11556 [2019-09-03 20:54:59,714 INFO L87 Difference]: Start difference. First operand 287 states and 288 transitions. Second operand 108 states. [2019-09-03 20:55:02,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:02,337 INFO L93 Difference]: Finished difference Result 392 states and 427 transitions. [2019-09-03 20:55:02,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-03 20:55:02,338 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 284 [2019-09-03 20:55:02,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:02,340 INFO L225 Difference]: With dead ends: 392 [2019-09-03 20:55:02,340 INFO L226 Difference]: Without dead ends: 288 [2019-09-03 20:55:02,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 676 GetRequests, 464 SyntacticMatches, 70 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8434 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=4697, Invalid=15895, Unknown=0, NotChecked=0, Total=20592 [2019-09-03 20:55:02,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-09-03 20:55:02,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2019-09-03 20:55:02,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-09-03 20:55:02,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 289 transitions. [2019-09-03 20:55:02,346 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 289 transitions. Word has length 284 [2019-09-03 20:55:02,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:02,346 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 289 transitions. [2019-09-03 20:55:02,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-09-03 20:55:02,347 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 289 transitions. [2019-09-03 20:55:02,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-09-03 20:55:02,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:02,348 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:02,348 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:02,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:02,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1112521176, now seen corresponding path program 68 times [2019-09-03 20:55:02,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:02,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:02,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:02,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:02,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:02,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4693 backedges. 698 proven. 1751 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2019-09-03 20:55:02,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:02,999 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:02,999 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:02,999 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:02,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:02,999 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 20:55:03,008 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:55:03,009 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:55:03,140 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-09-03 20:55:03,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:03,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-03 20:55:03,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:03,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:03,224 INFO L134 CoverageAnalysis]: Checked inductivity of 4693 backedges. 698 proven. 1751 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2019-09-03 20:55:03,224 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:04,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4693 backedges. 698 proven. 1751 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2019-09-03 20:55:04,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:04,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 42 [2019-09-03 20:55:04,191 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:04,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-03 20:55:04,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-03 20:55:04,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=713, Invalid=1009, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 20:55:04,192 INFO L87 Difference]: Start difference. First operand 288 states and 289 transitions. Second operand 42 states. [2019-09-03 20:55:04,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:04,561 INFO L93 Difference]: Finished difference Result 299 states and 301 transitions. [2019-09-03 20:55:04,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 20:55:04,562 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 285 [2019-09-03 20:55:04,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:04,564 INFO L225 Difference]: With dead ends: 299 [2019-09-03 20:55:04,564 INFO L226 Difference]: Without dead ends: 299 [2019-09-03 20:55:04,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 644 GetRequests, 533 SyntacticMatches, 70 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1401 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=719, Invalid=1087, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 20:55:04,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-09-03 20:55:04,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 295. [2019-09-03 20:55:04,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-09-03 20:55:04,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 296 transitions. [2019-09-03 20:55:04,569 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 296 transitions. Word has length 285 [2019-09-03 20:55:04,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:04,569 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 296 transitions. [2019-09-03 20:55:04,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-03 20:55:04,569 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 296 transitions. [2019-09-03 20:55:04,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-09-03 20:55:04,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:04,571 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:04,571 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:04,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:04,572 INFO L82 PathProgramCache]: Analyzing trace with hash -2015508902, now seen corresponding path program 69 times [2019-09-03 20:55:04,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:04,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:04,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:04,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:04,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:04,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:06,258 INFO L134 CoverageAnalysis]: Checked inductivity of 4935 backedges. 1925 proven. 630 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-09-03 20:55:06,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:06,259 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:06,259 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:06,259 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:06,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:06,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 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 20:55:06,270 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:55:06,270 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:55:06,365 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:55:06,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:06,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-03 20:55:06,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:08,370 INFO L134 CoverageAnalysis]: Checked inductivity of 4935 backedges. 1925 proven. 630 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-09-03 20:55:08,370 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:09,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4935 backedges. 1925 proven. 630 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-09-03 20:55:09,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:09,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 111 [2019-09-03 20:55:09,931 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:09,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-09-03 20:55:09,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-09-03 20:55:09,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2811, Invalid=9399, Unknown=0, NotChecked=0, Total=12210 [2019-09-03 20:55:09,933 INFO L87 Difference]: Start difference. First operand 295 states and 296 transitions. Second operand 111 states. [2019-09-03 20:55:11,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:11,546 INFO L93 Difference]: Finished difference Result 403 states and 439 transitions. [2019-09-03 20:55:11,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-03 20:55:11,546 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 292 [2019-09-03 20:55:11,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:11,547 INFO L225 Difference]: With dead ends: 403 [2019-09-03 20:55:11,548 INFO L226 Difference]: Without dead ends: 296 [2019-09-03 20:55:11,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 695 GetRequests, 477 SyntacticMatches, 72 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8927 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=4957, Invalid=16799, Unknown=0, NotChecked=0, Total=21756 [2019-09-03 20:55:11,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-03 20:55:11,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2019-09-03 20:55:11,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-09-03 20:55:11,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 297 transitions. [2019-09-03 20:55:11,553 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 297 transitions. Word has length 292 [2019-09-03 20:55:11,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:11,554 INFO L475 AbstractCegarLoop]: Abstraction has 296 states and 297 transitions. [2019-09-03 20:55:11,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-09-03 20:55:11,554 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 297 transitions. [2019-09-03 20:55:11,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-09-03 20:55:11,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:11,556 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:11,556 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:11,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:11,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1893087497, now seen corresponding path program 70 times [2019-09-03 20:55:11,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:11,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:11,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:11,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:11,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:12,228 INFO L134 CoverageAnalysis]: Checked inductivity of 4971 backedges. 736 proven. 1855 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-09-03 20:55:12,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:12,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:12,228 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:12,228 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:12,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:12,228 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 20:55:12,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:12,239 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:55:12,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:12,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-03 20:55:12,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:12,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:12,423 INFO L134 CoverageAnalysis]: Checked inductivity of 4971 backedges. 736 proven. 1855 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-09-03 20:55:12,423 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:13,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4971 backedges. 736 proven. 1855 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-09-03 20:55:13,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:13,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 43 [2019-09-03 20:55:13,443 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:13,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 20:55:13,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 20:55:13,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=751, Invalid=1055, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 20:55:13,445 INFO L87 Difference]: Start difference. First operand 296 states and 297 transitions. Second operand 43 states. [2019-09-03 20:55:13,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:13,857 INFO L93 Difference]: Finished difference Result 307 states and 309 transitions. [2019-09-03 20:55:13,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-03 20:55:13,858 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 293 [2019-09-03 20:55:13,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:13,860 INFO L225 Difference]: With dead ends: 307 [2019-09-03 20:55:13,860 INFO L226 Difference]: Without dead ends: 307 [2019-09-03 20:55:13,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 662 GetRequests, 548 SyntacticMatches, 72 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1477 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=757, Invalid=1135, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 20:55:13,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-03 20:55:13,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 303. [2019-09-03 20:55:13,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-03 20:55:13,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 304 transitions. [2019-09-03 20:55:13,865 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 304 transitions. Word has length 293 [2019-09-03 20:55:13,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:13,865 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 304 transitions. [2019-09-03 20:55:13,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 20:55:13,866 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 304 transitions. [2019-09-03 20:55:13,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-03 20:55:13,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:13,867 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:13,867 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:13,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:13,867 INFO L82 PathProgramCache]: Analyzing trace with hash 443286617, now seen corresponding path program 71 times [2019-09-03 20:55:13,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:13,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:13,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:13,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:13,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:15,664 INFO L134 CoverageAnalysis]: Checked inductivity of 5220 backedges. 2034 proven. 666 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2019-09-03 20:55:15,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:15,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:15,665 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:15,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:15,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:15,665 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 20:55:15,675 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:55:15,675 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:55:15,810 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-09-03 20:55:15,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:15,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-03 20:55:15,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:17,930 INFO L134 CoverageAnalysis]: Checked inductivity of 5220 backedges. 2034 proven. 666 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2019-09-03 20:55:17,931 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:19,561 INFO L134 CoverageAnalysis]: Checked inductivity of 5220 backedges. 2034 proven. 666 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2019-09-03 20:55:19,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:19,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 114 [2019-09-03 20:55:19,564 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:19,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-09-03 20:55:19,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-09-03 20:55:19,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2963, Invalid=9919, Unknown=0, NotChecked=0, Total=12882 [2019-09-03 20:55:19,567 INFO L87 Difference]: Start difference. First operand 303 states and 304 transitions. Second operand 114 states. [2019-09-03 20:55:22,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:22,362 INFO L93 Difference]: Finished difference Result 414 states and 451 transitions. [2019-09-03 20:55:22,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-03 20:55:22,362 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 300 [2019-09-03 20:55:22,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:22,363 INFO L225 Difference]: With dead ends: 414 [2019-09-03 20:55:22,363 INFO L226 Difference]: Without dead ends: 304 [2019-09-03 20:55:22,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 714 GetRequests, 490 SyntacticMatches, 74 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9434 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=5224, Invalid=17728, Unknown=0, NotChecked=0, Total=22952 [2019-09-03 20:55:22,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-03 20:55:22,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2019-09-03 20:55:22,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-03 20:55:22,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 305 transitions. [2019-09-03 20:55:22,368 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 305 transitions. Word has length 300 [2019-09-03 20:55:22,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:22,369 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 305 transitions. [2019-09-03 20:55:22,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-09-03 20:55:22,369 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 305 transitions. [2019-09-03 20:55:22,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-09-03 20:55:22,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:22,370 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:22,371 INFO L418 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:22,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:22,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1603950600, now seen corresponding path program 72 times [2019-09-03 20:55:22,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:22,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:22,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:22,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:22,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:22,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:23,024 INFO L134 CoverageAnalysis]: Checked inductivity of 5257 backedges. 775 proven. 1962 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2019-09-03 20:55:23,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:23,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:23,024 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:23,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:23,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:23,025 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 20:55:23,036 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:55:23,037 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:55:23,137 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:55:23,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:23,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-03 20:55:23,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:23,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:23,257 INFO L134 CoverageAnalysis]: Checked inductivity of 5257 backedges. 775 proven. 1962 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2019-09-03 20:55:23,257 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:24,339 INFO L134 CoverageAnalysis]: Checked inductivity of 5257 backedges. 775 proven. 1962 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2019-09-03 20:55:24,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:24,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 44 [2019-09-03 20:55:24,343 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:24,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-03 20:55:24,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-03 20:55:24,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=790, Invalid=1102, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 20:55:24,344 INFO L87 Difference]: Start difference. First operand 304 states and 305 transitions. Second operand 44 states. [2019-09-03 20:55:24,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:24,800 INFO L93 Difference]: Finished difference Result 315 states and 317 transitions. [2019-09-03 20:55:24,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-03 20:55:24,800 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 301 [2019-09-03 20:55:24,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:24,802 INFO L225 Difference]: With dead ends: 315 [2019-09-03 20:55:24,802 INFO L226 Difference]: Without dead ends: 315 [2019-09-03 20:55:24,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 680 GetRequests, 563 SyntacticMatches, 74 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1555 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=796, Invalid=1184, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 20:55:24,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-03 20:55:24,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 311. [2019-09-03 20:55:24,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-09-03 20:55:24,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 312 transitions. [2019-09-03 20:55:24,807 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 312 transitions. Word has length 301 [2019-09-03 20:55:24,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:24,807 INFO L475 AbstractCegarLoop]: Abstraction has 311 states and 312 transitions. [2019-09-03 20:55:24,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-03 20:55:24,807 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 312 transitions. [2019-09-03 20:55:24,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-03 20:55:24,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:24,809 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:24,810 INFO L418 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:24,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:24,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1548363654, now seen corresponding path program 73 times [2019-09-03 20:55:24,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:24,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:24,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:24,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:24,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:26,759 INFO L134 CoverageAnalysis]: Checked inductivity of 5513 backedges. 2146 proven. 703 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2019-09-03 20:55:26,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:26,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:26,759 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:26,759 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:26,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:26,759 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 20:55:26,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:26,769 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:55:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:26,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-03 20:55:26,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:29,124 INFO L134 CoverageAnalysis]: Checked inductivity of 5513 backedges. 2146 proven. 703 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2019-09-03 20:55:29,124 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:30,847 INFO L134 CoverageAnalysis]: Checked inductivity of 5513 backedges. 2146 proven. 703 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2019-09-03 20:55:30,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:30,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 117 [2019-09-03 20:55:30,851 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:30,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-09-03 20:55:30,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-09-03 20:55:30,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3119, Invalid=10453, Unknown=0, NotChecked=0, Total=13572 [2019-09-03 20:55:30,853 INFO L87 Difference]: Start difference. First operand 311 states and 312 transitions. Second operand 117 states. [2019-09-03 20:55:33,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:33,801 INFO L93 Difference]: Finished difference Result 425 states and 463 transitions. [2019-09-03 20:55:33,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-03 20:55:33,802 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 308 [2019-09-03 20:55:33,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:33,804 INFO L225 Difference]: With dead ends: 425 [2019-09-03 20:55:33,804 INFO L226 Difference]: Without dead ends: 312 [2019-09-03 20:55:33,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 733 GetRequests, 503 SyntacticMatches, 76 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9955 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=5498, Invalid=18682, Unknown=0, NotChecked=0, Total=24180 [2019-09-03 20:55:33,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-09-03 20:55:33,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2019-09-03 20:55:33,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-09-03 20:55:33,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 313 transitions. [2019-09-03 20:55:33,810 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 313 transitions. Word has length 308 [2019-09-03 20:55:33,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:33,811 INFO L475 AbstractCegarLoop]: Abstraction has 312 states and 313 transitions. [2019-09-03 20:55:33,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-09-03 20:55:33,811 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 313 transitions. [2019-09-03 20:55:33,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-09-03 20:55:33,812 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:33,812 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:33,812 INFO L418 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:33,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:33,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1705577769, now seen corresponding path program 74 times [2019-09-03 20:55:33,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:33,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:33,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:33,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:33,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:33,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:34,476 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 815 proven. 2072 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2019-09-03 20:55:34,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:34,476 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:34,476 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:34,477 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:34,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:34,477 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 20:55:34,487 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:55:34,487 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:55:34,633 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-09-03 20:55:34,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:34,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 82 conjunts are in the unsatisfiable core [2019-09-03 20:55:34,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:34,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:34,727 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 815 proven. 2072 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2019-09-03 20:55:34,727 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:35,860 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 815 proven. 2072 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2019-09-03 20:55:35,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:35,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 45 [2019-09-03 20:55:35,864 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:35,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 20:55:35,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 20:55:35,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=830, Invalid=1150, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 20:55:35,865 INFO L87 Difference]: Start difference. First operand 312 states and 313 transitions. Second operand 45 states. [2019-09-03 20:55:36,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:36,326 INFO L93 Difference]: Finished difference Result 323 states and 325 transitions. [2019-09-03 20:55:36,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-03 20:55:36,327 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 309 [2019-09-03 20:55:36,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:36,329 INFO L225 Difference]: With dead ends: 323 [2019-09-03 20:55:36,329 INFO L226 Difference]: Without dead ends: 323 [2019-09-03 20:55:36,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 698 GetRequests, 578 SyntacticMatches, 76 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1635 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=836, Invalid=1234, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 20:55:36,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-09-03 20:55:36,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 319. [2019-09-03 20:55:36,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-09-03 20:55:36,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 320 transitions. [2019-09-03 20:55:36,334 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 320 transitions. Word has length 309 [2019-09-03 20:55:36,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:36,334 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 320 transitions. [2019-09-03 20:55:36,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 20:55:36,334 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 320 transitions. [2019-09-03 20:55:36,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-03 20:55:36,335 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:36,336 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:36,336 INFO L418 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:36,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:36,336 INFO L82 PathProgramCache]: Analyzing trace with hash -358069191, now seen corresponding path program 75 times [2019-09-03 20:55:36,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:36,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:36,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:36,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:36,337 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:36,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:38,349 INFO L134 CoverageAnalysis]: Checked inductivity of 5814 backedges. 2261 proven. 741 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2019-09-03 20:55:38,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:38,349 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:38,349 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:38,350 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:38,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:38,350 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 20:55:38,361 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:55:38,361 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:55:38,462 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:55:38,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:38,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-03 20:55:38,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:40,789 INFO L134 CoverageAnalysis]: Checked inductivity of 5814 backedges. 2261 proven. 741 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2019-09-03 20:55:40,790 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:42,610 INFO L134 CoverageAnalysis]: Checked inductivity of 5814 backedges. 2261 proven. 741 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2019-09-03 20:55:42,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:42,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 120 [2019-09-03 20:55:42,614 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:42,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-09-03 20:55:42,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-09-03 20:55:42,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3279, Invalid=11001, Unknown=0, NotChecked=0, Total=14280 [2019-09-03 20:55:42,617 INFO L87 Difference]: Start difference. First operand 319 states and 320 transitions. Second operand 120 states. [2019-09-03 20:55:45,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:45,740 INFO L93 Difference]: Finished difference Result 436 states and 475 transitions. [2019-09-03 20:55:45,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-03 20:55:45,741 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 316 [2019-09-03 20:55:45,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:45,743 INFO L225 Difference]: With dead ends: 436 [2019-09-03 20:55:45,743 INFO L226 Difference]: Without dead ends: 320 [2019-09-03 20:55:45,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 752 GetRequests, 516 SyntacticMatches, 78 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10490 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=5779, Invalid=19661, Unknown=0, NotChecked=0, Total=25440 [2019-09-03 20:55:45,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-03 20:55:45,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-09-03 20:55:45,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-09-03 20:55:45,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 321 transitions. [2019-09-03 20:55:45,749 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 321 transitions. Word has length 316 [2019-09-03 20:55:45,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:45,749 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 321 transitions. [2019-09-03 20:55:45,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-09-03 20:55:45,750 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 321 transitions. [2019-09-03 20:55:45,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-09-03 20:55:45,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:45,751 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:45,751 INFO L418 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:45,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:45,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1257202152, now seen corresponding path program 76 times [2019-09-03 20:55:45,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:45,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:45,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:45,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:45,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:46,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5853 backedges. 856 proven. 2185 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2019-09-03 20:55:46,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:46,521 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:46,521 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:46,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:46,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:46,521 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 20:55:46,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:46,531 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:55:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:46,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-03 20:55:46,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:46,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:46,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5853 backedges. 856 proven. 2185 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2019-09-03 20:55:46,726 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:47,937 INFO L134 CoverageAnalysis]: Checked inductivity of 5853 backedges. 856 proven. 2185 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2019-09-03 20:55:47,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:47,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 46 [2019-09-03 20:55:47,941 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:47,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-03 20:55:47,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-03 20:55:47,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=871, Invalid=1199, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 20:55:47,942 INFO L87 Difference]: Start difference. First operand 320 states and 321 transitions. Second operand 46 states. [2019-09-03 20:55:48,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:48,446 INFO L93 Difference]: Finished difference Result 331 states and 333 transitions. [2019-09-03 20:55:48,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-03 20:55:48,446 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 317 [2019-09-03 20:55:48,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:48,448 INFO L225 Difference]: With dead ends: 331 [2019-09-03 20:55:48,448 INFO L226 Difference]: Without dead ends: 331 [2019-09-03 20:55:48,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 716 GetRequests, 593 SyntacticMatches, 78 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1717 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=877, Invalid=1285, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 20:55:48,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-09-03 20:55:48,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 327. [2019-09-03 20:55:48,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-09-03 20:55:48,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 328 transitions. [2019-09-03 20:55:48,454 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 328 transitions. Word has length 317 [2019-09-03 20:55:48,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:48,455 INFO L475 AbstractCegarLoop]: Abstraction has 327 states and 328 transitions. [2019-09-03 20:55:48,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-03 20:55:48,455 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 328 transitions. [2019-09-03 20:55:48,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-03 20:55:48,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:48,457 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:48,457 INFO L418 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:48,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:48,458 INFO L82 PathProgramCache]: Analyzing trace with hash 240906906, now seen corresponding path program 77 times [2019-09-03 20:55:48,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:48,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:48,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:48,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:48,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:50,580 INFO L134 CoverageAnalysis]: Checked inductivity of 6123 backedges. 2379 proven. 780 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2019-09-03 20:55:50,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:50,580 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:50,580 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:50,580 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:50,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:50,580 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 20:55:50,589 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:55:50,590 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:55:50,744 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-09-03 20:55:50,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:50,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 82 conjunts are in the unsatisfiable core [2019-09-03 20:55:50,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:53,204 INFO L134 CoverageAnalysis]: Checked inductivity of 6123 backedges. 2379 proven. 780 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2019-09-03 20:55:53,205 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:55,081 INFO L134 CoverageAnalysis]: Checked inductivity of 6123 backedges. 2379 proven. 780 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2019-09-03 20:55:55,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:55,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 123 [2019-09-03 20:55:55,086 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:55,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 123 states [2019-09-03 20:55:55,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2019-09-03 20:55:55,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3443, Invalid=11563, Unknown=0, NotChecked=0, Total=15006 [2019-09-03 20:55:55,088 INFO L87 Difference]: Start difference. First operand 327 states and 328 transitions. Second operand 123 states. [2019-09-03 20:55:57,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:57,264 INFO L93 Difference]: Finished difference Result 447 states and 487 transitions. [2019-09-03 20:55:57,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-03 20:55:57,271 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 324 [2019-09-03 20:55:57,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:57,272 INFO L225 Difference]: With dead ends: 447 [2019-09-03 20:55:57,273 INFO L226 Difference]: Without dead ends: 328 [2019-09-03 20:55:57,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 771 GetRequests, 529 SyntacticMatches, 80 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11039 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=6067, Invalid=20665, Unknown=0, NotChecked=0, Total=26732 [2019-09-03 20:55:57,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-09-03 20:55:57,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2019-09-03 20:55:57,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-09-03 20:55:57,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 329 transitions. [2019-09-03 20:55:57,280 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 329 transitions. Word has length 324 [2019-09-03 20:55:57,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:57,280 INFO L475 AbstractCegarLoop]: Abstraction has 328 states and 329 transitions. [2019-09-03 20:55:57,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 123 states. [2019-09-03 20:55:57,281 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 329 transitions. [2019-09-03 20:55:57,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-09-03 20:55:57,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:57,283 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:57,283 INFO L418 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:57,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:57,283 INFO L82 PathProgramCache]: Analyzing trace with hash 797305161, now seen corresponding path program 78 times [2019-09-03 20:55:57,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:57,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:57,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:57,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:57,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:58,071 INFO L134 CoverageAnalysis]: Checked inductivity of 6163 backedges. 898 proven. 2301 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2019-09-03 20:55:58,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:58,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:58,072 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:58,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:58,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:58,072 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 20:55:58,082 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:55:58,082 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:55:58,186 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:55:58,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:58,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-03 20:55:58,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:58,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:58,289 INFO L134 CoverageAnalysis]: Checked inductivity of 6163 backedges. 898 proven. 2301 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2019-09-03 20:55:58,290 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:59,541 INFO L134 CoverageAnalysis]: Checked inductivity of 6163 backedges. 898 proven. 2301 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2019-09-03 20:55:59,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:59,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 47 [2019-09-03 20:55:59,545 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:59,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-03 20:55:59,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-03 20:55:59,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=913, Invalid=1249, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 20:55:59,546 INFO L87 Difference]: Start difference. First operand 328 states and 329 transitions. Second operand 47 states. [2019-09-03 20:55:59,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:59,997 INFO L93 Difference]: Finished difference Result 339 states and 341 transitions. [2019-09-03 20:55:59,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-03 20:55:59,997 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 325 [2019-09-03 20:55:59,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:59,999 INFO L225 Difference]: With dead ends: 339 [2019-09-03 20:56:00,000 INFO L226 Difference]: Without dead ends: 339 [2019-09-03 20:56:00,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 734 GetRequests, 608 SyntacticMatches, 80 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1801 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=919, Invalid=1337, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 20:56:00,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-09-03 20:56:00,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 335. [2019-09-03 20:56:00,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-09-03 20:56:00,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 336 transitions. [2019-09-03 20:56:00,005 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 336 transitions. Word has length 325 [2019-09-03 20:56:00,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:00,006 INFO L475 AbstractCegarLoop]: Abstraction has 335 states and 336 transitions. [2019-09-03 20:56:00,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-03 20:56:00,006 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 336 transitions. [2019-09-03 20:56:00,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-03 20:56:00,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:00,007 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:00,007 INFO L418 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:00,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:00,008 INFO L82 PathProgramCache]: Analyzing trace with hash 268536857, now seen corresponding path program 79 times [2019-09-03 20:56:00,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:00,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:00,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:00,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:00,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:00,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:02,108 INFO L134 CoverageAnalysis]: Checked inductivity of 6440 backedges. 2500 proven. 820 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2019-09-03 20:56:02,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:02,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:02,108 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:02,108 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:02,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:02,108 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 20:56:02,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:02,118 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:56:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:02,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-03 20:56:02,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:04,770 INFO L134 CoverageAnalysis]: Checked inductivity of 6440 backedges. 2500 proven. 820 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2019-09-03 20:56:04,771 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:06,754 INFO L134 CoverageAnalysis]: Checked inductivity of 6440 backedges. 2500 proven. 820 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2019-09-03 20:56:06,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:06,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 126 [2019-09-03 20:56:06,757 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:06,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-09-03 20:56:06,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-09-03 20:56:06,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3611, Invalid=12139, Unknown=0, NotChecked=0, Total=15750 [2019-09-03 20:56:06,759 INFO L87 Difference]: Start difference. First operand 335 states and 336 transitions. Second operand 126 states. [2019-09-03 20:56:10,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:10,227 INFO L93 Difference]: Finished difference Result 458 states and 499 transitions. [2019-09-03 20:56:10,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-03 20:56:10,227 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 332 [2019-09-03 20:56:10,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:10,229 INFO L225 Difference]: With dead ends: 458 [2019-09-03 20:56:10,229 INFO L226 Difference]: Without dead ends: 336 [2019-09-03 20:56:10,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 790 GetRequests, 542 SyntacticMatches, 82 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11602 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=6362, Invalid=21694, Unknown=0, NotChecked=0, Total=28056 [2019-09-03 20:56:10,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-09-03 20:56:10,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2019-09-03 20:56:10,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-09-03 20:56:10,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 337 transitions. [2019-09-03 20:56:10,236 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 337 transitions. Word has length 332 [2019-09-03 20:56:10,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:10,237 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 337 transitions. [2019-09-03 20:56:10,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-09-03 20:56:10,237 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 337 transitions. [2019-09-03 20:56:10,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-03 20:56:10,239 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:10,239 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:10,239 INFO L418 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:10,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:10,240 INFO L82 PathProgramCache]: Analyzing trace with hash 362636232, now seen corresponding path program 80 times [2019-09-03 20:56:10,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:10,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:10,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:10,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:10,241 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:11,044 INFO L134 CoverageAnalysis]: Checked inductivity of 6481 backedges. 941 proven. 2420 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2019-09-03 20:56:11,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:11,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:11,044 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:11,044 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:11,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:11,044 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 20:56:11,054 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:56:11,054 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:56:11,220 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-09-03 20:56:11,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:11,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-03 20:56:11,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:11,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:11,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6481 backedges. 941 proven. 2420 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2019-09-03 20:56:11,322 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:12,648 INFO L134 CoverageAnalysis]: Checked inductivity of 6481 backedges. 941 proven. 2420 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2019-09-03 20:56:12,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:12,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 48 [2019-09-03 20:56:12,652 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:12,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-03 20:56:12,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-03 20:56:12,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=956, Invalid=1300, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 20:56:12,653 INFO L87 Difference]: Start difference. First operand 336 states and 337 transitions. Second operand 48 states. [2019-09-03 20:56:13,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:13,135 INFO L93 Difference]: Finished difference Result 347 states and 349 transitions. [2019-09-03 20:56:13,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 20:56:13,135 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 333 [2019-09-03 20:56:13,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:13,137 INFO L225 Difference]: With dead ends: 347 [2019-09-03 20:56:13,137 INFO L226 Difference]: Without dead ends: 347 [2019-09-03 20:56:13,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 752 GetRequests, 623 SyntacticMatches, 82 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1887 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=962, Invalid=1390, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 20:56:13,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-09-03 20:56:13,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 343. [2019-09-03 20:56:13,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-09-03 20:56:13,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 344 transitions. [2019-09-03 20:56:13,142 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 344 transitions. Word has length 333 [2019-09-03 20:56:13,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:13,143 INFO L475 AbstractCegarLoop]: Abstraction has 343 states and 344 transitions. [2019-09-03 20:56:13,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-03 20:56:13,143 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 344 transitions. [2019-09-03 20:56:13,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-09-03 20:56:13,144 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:13,144 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:13,144 INFO L418 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:13,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:13,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1243747514, now seen corresponding path program 81 times [2019-09-03 20:56:13,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:13,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:13,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:13,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:13,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:15,420 INFO L134 CoverageAnalysis]: Checked inductivity of 6765 backedges. 2624 proven. 861 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2019-09-03 20:56:15,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:15,421 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:15,421 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:15,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:15,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:15,421 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 20:56:15,431 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:56:15,431 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:56:15,543 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:56:15,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:15,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-03 20:56:15,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:18,213 INFO L134 CoverageAnalysis]: Checked inductivity of 6765 backedges. 2624 proven. 861 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2019-09-03 20:56:18,213 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:20,295 INFO L134 CoverageAnalysis]: Checked inductivity of 6765 backedges. 2624 proven. 861 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2019-09-03 20:56:20,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:20,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 129 [2019-09-03 20:56:20,300 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:20,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 129 states [2019-09-03 20:56:20,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2019-09-03 20:56:20,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3783, Invalid=12729, Unknown=0, NotChecked=0, Total=16512 [2019-09-03 20:56:20,302 INFO L87 Difference]: Start difference. First operand 343 states and 344 transitions. Second operand 129 states. [2019-09-03 20:56:23,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:23,870 INFO L93 Difference]: Finished difference Result 469 states and 511 transitions. [2019-09-03 20:56:23,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-03 20:56:23,870 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 340 [2019-09-03 20:56:23,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:23,872 INFO L225 Difference]: With dead ends: 469 [2019-09-03 20:56:23,872 INFO L226 Difference]: Without dead ends: 344 [2019-09-03 20:56:23,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 809 GetRequests, 555 SyntacticMatches, 84 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12179 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=6664, Invalid=22748, Unknown=0, NotChecked=0, Total=29412 [2019-09-03 20:56:23,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-09-03 20:56:23,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2019-09-03 20:56:23,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-09-03 20:56:23,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 345 transitions. [2019-09-03 20:56:23,881 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 345 transitions. Word has length 340 [2019-09-03 20:56:23,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:23,881 INFO L475 AbstractCegarLoop]: Abstraction has 344 states and 345 transitions. [2019-09-03 20:56:23,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 129 states. [2019-09-03 20:56:23,881 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 345 transitions. [2019-09-03 20:56:23,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-09-03 20:56:23,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:23,883 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:23,883 INFO L418 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:23,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:23,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1488899433, now seen corresponding path program 82 times [2019-09-03 20:56:23,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:23,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:23,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:23,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:23,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:24,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6807 backedges. 985 proven. 2542 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2019-09-03 20:56:24,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:24,713 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:24,713 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:24,713 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:24,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:24,713 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 20:56:24,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:24,723 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:56:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:24,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-03 20:56:24,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:24,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:24,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6807 backedges. 985 proven. 2542 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2019-09-03 20:56:24,934 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:26,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6807 backedges. 985 proven. 2542 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2019-09-03 20:56:26,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:26,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 49 [2019-09-03 20:56:26,272 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:26,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 20:56:26,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 20:56:26,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1000, Invalid=1352, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 20:56:26,273 INFO L87 Difference]: Start difference. First operand 344 states and 345 transitions. Second operand 49 states. [2019-09-03 20:56:26,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:26,856 INFO L93 Difference]: Finished difference Result 355 states and 357 transitions. [2019-09-03 20:56:26,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-03 20:56:26,856 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 341 [2019-09-03 20:56:26,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:26,859 INFO L225 Difference]: With dead ends: 355 [2019-09-03 20:56:26,859 INFO L226 Difference]: Without dead ends: 355 [2019-09-03 20:56:26,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 770 GetRequests, 638 SyntacticMatches, 84 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1975 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1006, Invalid=1444, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 20:56:26,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-09-03 20:56:26,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 351. [2019-09-03 20:56:26,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-09-03 20:56:26,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 352 transitions. [2019-09-03 20:56:26,865 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 352 transitions. Word has length 341 [2019-09-03 20:56:26,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:26,865 INFO L475 AbstractCegarLoop]: Abstraction has 351 states and 352 transitions. [2019-09-03 20:56:26,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 20:56:26,866 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 352 transitions. [2019-09-03 20:56:26,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-09-03 20:56:26,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:26,868 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:26,868 INFO L418 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:26,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:26,868 INFO L82 PathProgramCache]: Analyzing trace with hash 535151609, now seen corresponding path program 83 times [2019-09-03 20:56:26,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:26,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:26,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:26,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:26,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:29,184 INFO L134 CoverageAnalysis]: Checked inductivity of 7098 backedges. 2751 proven. 903 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2019-09-03 20:56:29,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:29,184 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:29,184 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:29,184 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:29,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:29,184 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 20:56:29,194 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:56:29,195 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:56:29,399 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-09-03 20:56:29,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:29,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-03 20:56:29,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:32,163 INFO L134 CoverageAnalysis]: Checked inductivity of 7098 backedges. 2751 proven. 903 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2019-09-03 20:56:32,164 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:34,354 INFO L134 CoverageAnalysis]: Checked inductivity of 7098 backedges. 2751 proven. 903 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2019-09-03 20:56:34,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:34,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 132 [2019-09-03 20:56:34,359 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:34,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-09-03 20:56:34,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-09-03 20:56:34,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3959, Invalid=13333, Unknown=0, NotChecked=0, Total=17292 [2019-09-03 20:56:34,361 INFO L87 Difference]: Start difference. First operand 351 states and 352 transitions. Second operand 132 states. [2019-09-03 20:56:39,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:39,525 INFO L93 Difference]: Finished difference Result 480 states and 523 transitions. [2019-09-03 20:56:39,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-03 20:56:39,526 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 348 [2019-09-03 20:56:39,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:39,528 INFO L225 Difference]: With dead ends: 480 [2019-09-03 20:56:39,528 INFO L226 Difference]: Without dead ends: 352 [2019-09-03 20:56:39,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 828 GetRequests, 568 SyntacticMatches, 86 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12770 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=6973, Invalid=23827, Unknown=0, NotChecked=0, Total=30800 [2019-09-03 20:56:39,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-09-03 20:56:39,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2019-09-03 20:56:39,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-03 20:56:39,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 353 transitions. [2019-09-03 20:56:39,535 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 353 transitions. Word has length 348 [2019-09-03 20:56:39,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:39,535 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 353 transitions. [2019-09-03 20:56:39,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-09-03 20:56:39,539 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 353 transitions. [2019-09-03 20:56:39,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-09-03 20:56:39,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:39,541 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:39,543 INFO L418 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:39,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:39,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1561484712, now seen corresponding path program 84 times [2019-09-03 20:56:39,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:39,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:39,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:39,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:39,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:40,433 INFO L134 CoverageAnalysis]: Checked inductivity of 7141 backedges. 1030 proven. 2667 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2019-09-03 20:56:40,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:40,434 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:40,434 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:40,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:40,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:40,434 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 20:56:40,446 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:56:40,446 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:56:40,559 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:56:40,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:40,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 834 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-03 20:56:40,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:40,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:40,754 INFO L134 CoverageAnalysis]: Checked inductivity of 7141 backedges. 1030 proven. 2667 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2019-09-03 20:56:40,755 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:42,226 INFO L134 CoverageAnalysis]: Checked inductivity of 7141 backedges. 1030 proven. 2667 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2019-09-03 20:56:42,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:42,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 50 [2019-09-03 20:56:42,230 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:42,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-03 20:56:42,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-03 20:56:42,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1045, Invalid=1405, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 20:56:42,231 INFO L87 Difference]: Start difference. First operand 352 states and 353 transitions. Second operand 50 states. [2019-09-03 20:56:42,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:42,797 INFO L93 Difference]: Finished difference Result 363 states and 365 transitions. [2019-09-03 20:56:42,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-03 20:56:42,797 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 349 [2019-09-03 20:56:42,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:42,800 INFO L225 Difference]: With dead ends: 363 [2019-09-03 20:56:42,800 INFO L226 Difference]: Without dead ends: 363 [2019-09-03 20:56:42,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 788 GetRequests, 653 SyntacticMatches, 86 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2065 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1051, Invalid=1499, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 20:56:42,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-09-03 20:56:42,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 359. [2019-09-03 20:56:42,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-09-03 20:56:42,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 360 transitions. [2019-09-03 20:56:42,806 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 360 transitions. Word has length 349 [2019-09-03 20:56:42,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:42,807 INFO L475 AbstractCegarLoop]: Abstraction has 359 states and 360 transitions. [2019-09-03 20:56:42,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-03 20:56:42,807 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 360 transitions. [2019-09-03 20:56:42,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-09-03 20:56:42,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:42,809 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:42,809 INFO L418 AbstractCegarLoop]: === Iteration 87 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:42,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:42,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1641692890, now seen corresponding path program 85 times [2019-09-03 20:56:42,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:42,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:42,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:42,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:42,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:45,442 INFO L134 CoverageAnalysis]: Checked inductivity of 7439 backedges. 2881 proven. 946 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2019-09-03 20:56:45,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:45,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:45,443 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:45,443 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:45,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:45,443 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 20:56:45,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:45,457 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:56:45,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:45,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 848 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-03 20:56:45,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:48,448 INFO L134 CoverageAnalysis]: Checked inductivity of 7439 backedges. 2881 proven. 946 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2019-09-03 20:56:48,448 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:50,707 INFO L134 CoverageAnalysis]: Checked inductivity of 7439 backedges. 2881 proven. 946 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2019-09-03 20:56:50,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:50,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 135 [2019-09-03 20:56:50,711 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:50,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 135 states [2019-09-03 20:56:50,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2019-09-03 20:56:50,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4139, Invalid=13951, Unknown=0, NotChecked=0, Total=18090 [2019-09-03 20:56:50,713 INFO L87 Difference]: Start difference. First operand 359 states and 360 transitions. Second operand 135 states. [2019-09-03 20:56:54,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:54,669 INFO L93 Difference]: Finished difference Result 491 states and 535 transitions. [2019-09-03 20:56:54,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-03 20:56:54,670 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 356 [2019-09-03 20:56:54,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:54,672 INFO L225 Difference]: With dead ends: 491 [2019-09-03 20:56:54,672 INFO L226 Difference]: Without dead ends: 360 [2019-09-03 20:56:54,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 847 GetRequests, 581 SyntacticMatches, 88 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13375 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=7289, Invalid=24931, Unknown=0, NotChecked=0, Total=32220 [2019-09-03 20:56:54,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-09-03 20:56:54,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2019-09-03 20:56:54,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-09-03 20:56:54,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 361 transitions. [2019-09-03 20:56:54,680 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 361 transitions. Word has length 356 [2019-09-03 20:56:54,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:54,680 INFO L475 AbstractCegarLoop]: Abstraction has 360 states and 361 transitions. [2019-09-03 20:56:54,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 135 states. [2019-09-03 20:56:54,681 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 361 transitions. [2019-09-03 20:56:54,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-09-03 20:56:54,683 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:54,683 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:54,683 INFO L418 AbstractCegarLoop]: === Iteration 88 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:54,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:54,684 INFO L82 PathProgramCache]: Analyzing trace with hash -198854263, now seen corresponding path program 86 times [2019-09-03 20:56:54,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:54,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:54,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:54,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:54,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:55,682 INFO L134 CoverageAnalysis]: Checked inductivity of 7483 backedges. 1076 proven. 2795 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2019-09-03 20:56:55,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:55,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:55,683 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:55,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:55,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:55,683 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 20:56:55,695 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:56:55,695 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:56:55,876 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-09-03 20:56:55,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:55,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 94 conjunts are in the unsatisfiable core [2019-09-03 20:56:55,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:55,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:56,007 INFO L134 CoverageAnalysis]: Checked inductivity of 7483 backedges. 1076 proven. 2795 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2019-09-03 20:56:56,008 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:57,481 INFO L134 CoverageAnalysis]: Checked inductivity of 7483 backedges. 1076 proven. 2795 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2019-09-03 20:56:57,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:57,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 51 [2019-09-03 20:56:57,486 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:57,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-03 20:56:57,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-03 20:56:57,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1091, Invalid=1459, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 20:56:57,487 INFO L87 Difference]: Start difference. First operand 360 states and 361 transitions. Second operand 51 states. [2019-09-03 20:56:57,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:57,953 INFO L93 Difference]: Finished difference Result 371 states and 373 transitions. [2019-09-03 20:56:57,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-03 20:56:57,954 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 357 [2019-09-03 20:56:57,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:57,956 INFO L225 Difference]: With dead ends: 371 [2019-09-03 20:56:57,956 INFO L226 Difference]: Without dead ends: 371 [2019-09-03 20:56:57,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 806 GetRequests, 668 SyntacticMatches, 88 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2157 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1097, Invalid=1555, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:56:57,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-09-03 20:56:57,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 367. [2019-09-03 20:56:57,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-09-03 20:56:57,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 368 transitions. [2019-09-03 20:56:57,961 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 368 transitions. Word has length 357 [2019-09-03 20:56:57,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:57,961 INFO L475 AbstractCegarLoop]: Abstraction has 367 states and 368 transitions. [2019-09-03 20:56:57,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-03 20:56:57,962 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 368 transitions. [2019-09-03 20:56:57,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-09-03 20:56:57,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:57,965 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:57,965 INFO L418 AbstractCegarLoop]: === Iteration 89 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:57,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:57,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1757219879, now seen corresponding path program 87 times [2019-09-03 20:56:57,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:57,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:57,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:57,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:57,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:58,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:00,508 INFO L134 CoverageAnalysis]: Checked inductivity of 7788 backedges. 3014 proven. 990 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2019-09-03 20:57:00,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:00,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:00,509 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:00,509 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:00,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:00,509 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 20:57:00,519 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:00,519 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:57:00,640 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:00,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:00,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-03 20:57:00,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:03,703 INFO L134 CoverageAnalysis]: Checked inductivity of 7788 backedges. 3014 proven. 990 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2019-09-03 20:57:03,704 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:06,175 INFO L134 CoverageAnalysis]: Checked inductivity of 7788 backedges. 3014 proven. 990 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2019-09-03 20:57:06,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:06,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 138 [2019-09-03 20:57:06,179 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:06,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-09-03 20:57:06,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-09-03 20:57:06,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4323, Invalid=14583, Unknown=0, NotChecked=0, Total=18906 [2019-09-03 20:57:06,181 INFO L87 Difference]: Start difference. First operand 367 states and 368 transitions. Second operand 138 states. [2019-09-03 20:57:10,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:10,338 INFO L93 Difference]: Finished difference Result 502 states and 547 transitions. [2019-09-03 20:57:10,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-03 20:57:10,342 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 364 [2019-09-03 20:57:10,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:10,344 INFO L225 Difference]: With dead ends: 502 [2019-09-03 20:57:10,344 INFO L226 Difference]: Without dead ends: 368 [2019-09-03 20:57:10,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 866 GetRequests, 594 SyntacticMatches, 90 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13994 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=7612, Invalid=26060, Unknown=0, NotChecked=0, Total=33672 [2019-09-03 20:57:10,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-09-03 20:57:10,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2019-09-03 20:57:10,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-09-03 20:57:10,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 369 transitions. [2019-09-03 20:57:10,352 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 369 transitions. Word has length 364 [2019-09-03 20:57:10,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:10,353 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 369 transitions. [2019-09-03 20:57:10,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-09-03 20:57:10,353 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 369 transitions. [2019-09-03 20:57:10,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-09-03 20:57:10,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:10,355 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:10,356 INFO L418 AbstractCegarLoop]: === Iteration 90 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:10,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:10,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1505996920, now seen corresponding path program 88 times [2019-09-03 20:57:10,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:10,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:10,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:10,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:10,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:11,331 INFO L134 CoverageAnalysis]: Checked inductivity of 7833 backedges. 1123 proven. 2926 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2019-09-03 20:57:11,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:11,331 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:11,331 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:11,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:11,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:11,331 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 20:57:11,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:11,342 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:57:11,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:11,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-03 20:57:11,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:11,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:11,571 INFO L134 CoverageAnalysis]: Checked inductivity of 7833 backedges. 1123 proven. 2926 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2019-09-03 20:57:11,571 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:13,154 INFO L134 CoverageAnalysis]: Checked inductivity of 7833 backedges. 1123 proven. 2926 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2019-09-03 20:57:13,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:13,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 52 [2019-09-03 20:57:13,157 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:13,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 20:57:13,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 20:57:13,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1138, Invalid=1514, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:57:13,159 INFO L87 Difference]: Start difference. First operand 368 states and 369 transitions. Second operand 52 states. [2019-09-03 20:57:13,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:13,725 INFO L93 Difference]: Finished difference Result 379 states and 381 transitions. [2019-09-03 20:57:13,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-03 20:57:13,726 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 365 [2019-09-03 20:57:13,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:13,729 INFO L225 Difference]: With dead ends: 379 [2019-09-03 20:57:13,730 INFO L226 Difference]: Without dead ends: 379 [2019-09-03 20:57:13,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 824 GetRequests, 683 SyntacticMatches, 90 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2251 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1144, Invalid=1612, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 20:57:13,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-09-03 20:57:13,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 375. [2019-09-03 20:57:13,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-09-03 20:57:13,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 376 transitions. [2019-09-03 20:57:13,736 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 376 transitions. Word has length 365 [2019-09-03 20:57:13,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:13,736 INFO L475 AbstractCegarLoop]: Abstraction has 375 states and 376 transitions. [2019-09-03 20:57:13,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 20:57:13,737 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 376 transitions. [2019-09-03 20:57:13,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-03 20:57:13,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:13,739 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:13,739 INFO L418 AbstractCegarLoop]: === Iteration 91 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:13,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:13,740 INFO L82 PathProgramCache]: Analyzing trace with hash 148271354, now seen corresponding path program 89 times [2019-09-03 20:57:13,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:13,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:13,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:13,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:13,741 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:16,419 INFO L134 CoverageAnalysis]: Checked inductivity of 8145 backedges. 3150 proven. 1035 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2019-09-03 20:57:16,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:16,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:16,420 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:16,420 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:16,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:16,420 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 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:16,433 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:57:16,434 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:57:16,627 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-09-03 20:57:16,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:16,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 886 conjuncts, 94 conjunts are in the unsatisfiable core [2019-09-03 20:57:16,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:19,812 INFO L134 CoverageAnalysis]: Checked inductivity of 8145 backedges. 3150 proven. 1035 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2019-09-03 20:57:19,812 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:22,350 INFO L134 CoverageAnalysis]: Checked inductivity of 8145 backedges. 3150 proven. 1035 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2019-09-03 20:57:22,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:22,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 141 [2019-09-03 20:57:22,354 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:22,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 141 states [2019-09-03 20:57:22,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2019-09-03 20:57:22,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4511, Invalid=15229, Unknown=0, NotChecked=0, Total=19740 [2019-09-03 20:57:22,356 INFO L87 Difference]: Start difference. First operand 375 states and 376 transitions. Second operand 141 states. [2019-09-03 20:57:26,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:26,078 INFO L93 Difference]: Finished difference Result 513 states and 559 transitions. [2019-09-03 20:57:26,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-03 20:57:26,083 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 372 [2019-09-03 20:57:26,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:26,085 INFO L225 Difference]: With dead ends: 513 [2019-09-03 20:57:26,086 INFO L226 Difference]: Without dead ends: 376 [2019-09-03 20:57:26,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 885 GetRequests, 607 SyntacticMatches, 92 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14627 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=7942, Invalid=27214, Unknown=0, NotChecked=0, Total=35156 [2019-09-03 20:57:26,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-09-03 20:57:26,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2019-09-03 20:57:26,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-09-03 20:57:26,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 377 transitions. [2019-09-03 20:57:26,095 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 377 transitions. Word has length 372 [2019-09-03 20:57:26,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:26,095 INFO L475 AbstractCegarLoop]: Abstraction has 376 states and 377 transitions. [2019-09-03 20:57:26,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 141 states. [2019-09-03 20:57:26,095 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 377 transitions. [2019-09-03 20:57:26,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-09-03 20:57:26,097 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:26,098 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:26,098 INFO L418 AbstractCegarLoop]: === Iteration 92 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:26,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:26,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1123242583, now seen corresponding path program 90 times [2019-09-03 20:57:26,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:26,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:26,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:26,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:26,100 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:27,083 INFO L134 CoverageAnalysis]: Checked inductivity of 8191 backedges. 1171 proven. 3060 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2019-09-03 20:57:27,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:27,084 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:27,084 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:27,084 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:27,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:27,084 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 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:27,093 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:27,094 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:57:27,215 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:27,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:27,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-03 20:57:27,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:27,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:27,334 INFO L134 CoverageAnalysis]: Checked inductivity of 8191 backedges. 1171 proven. 3060 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2019-09-03 20:57:27,334 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:28,945 INFO L134 CoverageAnalysis]: Checked inductivity of 8191 backedges. 1171 proven. 3060 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2019-09-03 20:57:28,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:28,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 53 [2019-09-03 20:57:28,949 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:28,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-03 20:57:28,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-03 20:57:28,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1186, Invalid=1570, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 20:57:28,951 INFO L87 Difference]: Start difference. First operand 376 states and 377 transitions. Second operand 53 states. [2019-09-03 20:57:29,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:29,536 INFO L93 Difference]: Finished difference Result 387 states and 389 transitions. [2019-09-03 20:57:29,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-03 20:57:29,536 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 373 [2019-09-03 20:57:29,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:29,538 INFO L225 Difference]: With dead ends: 387 [2019-09-03 20:57:29,538 INFO L226 Difference]: Without dead ends: 387 [2019-09-03 20:57:29,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 842 GetRequests, 698 SyntacticMatches, 92 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2347 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1192, Invalid=1670, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 20:57:29,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-09-03 20:57:29,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2019-09-03 20:57:29,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-09-03 20:57:29,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 384 transitions. [2019-09-03 20:57:29,543 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 384 transitions. Word has length 373 [2019-09-03 20:57:29,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:29,544 INFO L475 AbstractCegarLoop]: Abstraction has 383 states and 384 transitions. [2019-09-03 20:57:29,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-03 20:57:29,544 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 384 transitions. [2019-09-03 20:57:29,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-09-03 20:57:29,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:29,546 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:29,546 INFO L418 AbstractCegarLoop]: === Iteration 93 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:29,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:29,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1165550663, now seen corresponding path program 91 times [2019-09-03 20:57:29,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:29,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:29,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:29,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:29,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:29,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:32,328 INFO L134 CoverageAnalysis]: Checked inductivity of 8510 backedges. 3289 proven. 1081 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2019-09-03 20:57:32,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:32,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:32,329 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:32,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:32,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:32,329 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 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:32,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:32,341 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:57:32,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:32,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 905 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-03 20:57:32,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:35,762 INFO L134 CoverageAnalysis]: Checked inductivity of 8510 backedges. 3289 proven. 1081 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2019-09-03 20:57:35,762 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:38,388 INFO L134 CoverageAnalysis]: Checked inductivity of 8510 backedges. 3289 proven. 1081 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2019-09-03 20:57:38,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:38,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 144 [2019-09-03 20:57:38,391 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:38,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-09-03 20:57:38,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-09-03 20:57:38,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4703, Invalid=15889, Unknown=0, NotChecked=0, Total=20592 [2019-09-03 20:57:38,394 INFO L87 Difference]: Start difference. First operand 383 states and 384 transitions. Second operand 144 states. [2019-09-03 20:57:42,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:42,721 INFO L93 Difference]: Finished difference Result 524 states and 571 transitions. [2019-09-03 20:57:42,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-03 20:57:42,721 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 380 [2019-09-03 20:57:42,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:42,724 INFO L225 Difference]: With dead ends: 524 [2019-09-03 20:57:42,724 INFO L226 Difference]: Without dead ends: 384 [2019-09-03 20:57:42,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 904 GetRequests, 620 SyntacticMatches, 94 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15274 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=8279, Invalid=28393, Unknown=0, NotChecked=0, Total=36672 [2019-09-03 20:57:42,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-09-03 20:57:42,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2019-09-03 20:57:42,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-09-03 20:57:42,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 385 transitions. [2019-09-03 20:57:42,732 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 385 transitions. Word has length 380 [2019-09-03 20:57:42,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:42,733 INFO L475 AbstractCegarLoop]: Abstraction has 384 states and 385 transitions. [2019-09-03 20:57:42,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-09-03 20:57:42,733 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 385 transitions. [2019-09-03 20:57:42,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-09-03 20:57:42,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:42,735 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:42,736 INFO L418 AbstractCegarLoop]: === Iteration 94 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:42,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:42,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1032403304, now seen corresponding path program 92 times [2019-09-03 20:57:42,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:42,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:42,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:42,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:42,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:43,804 INFO L134 CoverageAnalysis]: Checked inductivity of 8557 backedges. 1220 proven. 3197 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2019-09-03 20:57:43,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:43,805 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:43,805 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:43,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 20:57:43,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:43,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 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:43,816 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:57:43,816 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:57:44,027 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-09-03 20:57:44,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:44,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 100 conjunts are in the unsatisfiable core [2019-09-03 20:57:44,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:44,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:44,152 INFO L134 CoverageAnalysis]: Checked inductivity of 8557 backedges. 1220 proven. 3197 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2019-09-03 20:57:44,152 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:45,830 INFO L134 CoverageAnalysis]: Checked inductivity of 8557 backedges. 1220 proven. 3197 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2019-09-03 20:57:45,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:45,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 54 [2019-09-03 20:57:45,834 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:45,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-03 20:57:45,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-03 20:57:45,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1235, Invalid=1627, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 20:57:45,835 INFO L87 Difference]: Start difference. First operand 384 states and 385 transitions. Second operand 54 states. [2019-09-03 20:57:46,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:46,533 INFO L93 Difference]: Finished difference Result 395 states and 397 transitions. [2019-09-03 20:57:46,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-03 20:57:46,533 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 381 [2019-09-03 20:57:46,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:46,535 INFO L225 Difference]: With dead ends: 395 [2019-09-03 20:57:46,535 INFO L226 Difference]: Without dead ends: 395 [2019-09-03 20:57:46,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 860 GetRequests, 713 SyntacticMatches, 94 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2445 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1241, Invalid=1729, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 20:57:46,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-09-03 20:57:46,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 391. [2019-09-03 20:57:46,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-09-03 20:57:46,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 392 transitions. [2019-09-03 20:57:46,541 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 392 transitions. Word has length 381 [2019-09-03 20:57:46,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:46,542 INFO L475 AbstractCegarLoop]: Abstraction has 391 states and 392 transitions. [2019-09-03 20:57:46,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-03 20:57:46,542 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 392 transitions. [2019-09-03 20:57:46,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-09-03 20:57:46,544 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:46,544 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:46,545 INFO L418 AbstractCegarLoop]: === Iteration 95 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:46,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:46,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1159156966, now seen corresponding path program 93 times [2019-09-03 20:57:46,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:46,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:46,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:46,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:46,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:49,373 INFO L134 CoverageAnalysis]: Checked inductivity of 8883 backedges. 3431 proven. 1128 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2019-09-03 20:57:49,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:49,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:49,373 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:49,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:49,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:49,374 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 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:49,384 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:49,384 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:57:49,512 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:49,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:49,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-03 20:57:49,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:52,977 INFO L134 CoverageAnalysis]: Checked inductivity of 8883 backedges. 3431 proven. 1128 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2019-09-03 20:57:52,978 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:55,680 INFO L134 CoverageAnalysis]: Checked inductivity of 8883 backedges. 3431 proven. 1128 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2019-09-03 20:57:55,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:55,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 147 [2019-09-03 20:57:55,684 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:55,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-09-03 20:57:55,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-09-03 20:57:55,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4899, Invalid=16563, Unknown=0, NotChecked=0, Total=21462 [2019-09-03 20:57:55,688 INFO L87 Difference]: Start difference. First operand 391 states and 392 transitions. Second operand 147 states. [2019-09-03 20:58:00,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:00,382 INFO L93 Difference]: Finished difference Result 535 states and 583 transitions. [2019-09-03 20:58:00,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-03 20:58:00,382 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 388 [2019-09-03 20:58:00,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:00,385 INFO L225 Difference]: With dead ends: 535 [2019-09-03 20:58:00,385 INFO L226 Difference]: Without dead ends: 392 [2019-09-03 20:58:00,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 923 GetRequests, 633 SyntacticMatches, 96 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15935 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=8623, Invalid=29597, Unknown=0, NotChecked=0, Total=38220 [2019-09-03 20:58:00,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-09-03 20:58:00,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2019-09-03 20:58:00,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-09-03 20:58:00,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 393 transitions. [2019-09-03 20:58:00,392 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 393 transitions. Word has length 388 [2019-09-03 20:58:00,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:00,392 INFO L475 AbstractCegarLoop]: Abstraction has 392 states and 393 transitions. [2019-09-03 20:58:00,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 147 states. [2019-09-03 20:58:00,393 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 393 transitions. [2019-09-03 20:58:00,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2019-09-03 20:58:00,394 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:00,394 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:00,394 INFO L418 AbstractCegarLoop]: === Iteration 96 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:00,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:00,395 INFO L82 PathProgramCache]: Analyzing trace with hash 927312329, now seen corresponding path program 94 times [2019-09-03 20:58:00,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:00,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:00,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:00,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:00,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:01,422 INFO L134 CoverageAnalysis]: Checked inductivity of 8931 backedges. 1270 proven. 3337 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2019-09-03 20:58:01,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:01,422 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:01,423 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:01,423 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:01,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:01,423 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 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:01,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:01,434 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:58:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:01,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 929 conjuncts, 102 conjunts are in the unsatisfiable core [2019-09-03 20:58:01,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:01,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:01,682 INFO L134 CoverageAnalysis]: Checked inductivity of 8931 backedges. 1270 proven. 3337 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2019-09-03 20:58:01,682 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:03,430 INFO L134 CoverageAnalysis]: Checked inductivity of 8931 backedges. 1270 proven. 3337 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2019-09-03 20:58:03,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:03,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 55 [2019-09-03 20:58:03,433 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:03,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-03 20:58:03,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-03 20:58:03,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1285, Invalid=1685, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 20:58:03,435 INFO L87 Difference]: Start difference. First operand 392 states and 393 transitions. Second operand 55 states. [2019-09-03 20:58:03,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:03,939 INFO L93 Difference]: Finished difference Result 403 states and 405 transitions. [2019-09-03 20:58:03,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-03 20:58:03,940 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 389 [2019-09-03 20:58:03,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:03,942 INFO L225 Difference]: With dead ends: 403 [2019-09-03 20:58:03,942 INFO L226 Difference]: Without dead ends: 403 [2019-09-03 20:58:03,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 878 GetRequests, 728 SyntacticMatches, 96 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2545 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1291, Invalid=1789, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 20:58:03,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2019-09-03 20:58:03,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 399. [2019-09-03 20:58:03,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-09-03 20:58:03,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 400 transitions. [2019-09-03 20:58:03,947 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 400 transitions. Word has length 389 [2019-09-03 20:58:03,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:03,947 INFO L475 AbstractCegarLoop]: Abstraction has 399 states and 400 transitions. [2019-09-03 20:58:03,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-03 20:58:03,948 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 400 transitions. [2019-09-03 20:58:03,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-09-03 20:58:03,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:03,950 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:03,950 INFO L418 AbstractCegarLoop]: === Iteration 97 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:03,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:03,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1973435289, now seen corresponding path program 95 times [2019-09-03 20:58:03,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:03,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:03,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:03,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:03,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:07,017 INFO L134 CoverageAnalysis]: Checked inductivity of 9264 backedges. 3576 proven. 1176 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2019-09-03 20:58:07,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:07,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:07,018 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:07,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:07,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:07,018 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 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:07,027 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:58:07,027 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:58:07,248 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-09-03 20:58:07,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:07,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 943 conjuncts, 100 conjunts are in the unsatisfiable core [2019-09-03 20:58:07,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:10,800 INFO L134 CoverageAnalysis]: Checked inductivity of 9264 backedges. 3576 proven. 1176 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2019-09-03 20:58:10,800 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:13,628 INFO L134 CoverageAnalysis]: Checked inductivity of 9264 backedges. 3576 proven. 1176 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2019-09-03 20:58:13,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:13,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 150 [2019-09-03 20:58:13,633 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:13,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-09-03 20:58:13,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-09-03 20:58:13,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5099, Invalid=17251, Unknown=0, NotChecked=0, Total=22350 [2019-09-03 20:58:13,635 INFO L87 Difference]: Start difference. First operand 399 states and 400 transitions. Second operand 150 states. [2019-09-03 20:58:18,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:18,631 INFO L93 Difference]: Finished difference Result 546 states and 595 transitions. [2019-09-03 20:58:18,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-03 20:58:18,631 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 396 [2019-09-03 20:58:18,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:18,634 INFO L225 Difference]: With dead ends: 546 [2019-09-03 20:58:18,634 INFO L226 Difference]: Without dead ends: 400 [2019-09-03 20:58:18,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 942 GetRequests, 646 SyntacticMatches, 98 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16610 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=8974, Invalid=30826, Unknown=0, NotChecked=0, Total=39800 [2019-09-03 20:58:18,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-09-03 20:58:18,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2019-09-03 20:58:18,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-03 20:58:18,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 401 transitions. [2019-09-03 20:58:18,641 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 401 transitions. Word has length 396 [2019-09-03 20:58:18,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:18,641 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 401 transitions. [2019-09-03 20:58:18,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-09-03 20:58:18,641 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 401 transitions. [2019-09-03 20:58:18,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2019-09-03 20:58:18,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:18,643 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:18,643 INFO L418 AbstractCegarLoop]: === Iteration 98 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:18,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:18,643 INFO L82 PathProgramCache]: Analyzing trace with hash 384244552, now seen corresponding path program 96 times [2019-09-03 20:58:18,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:18,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:18,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:18,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:18,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:19,736 INFO L134 CoverageAnalysis]: Checked inductivity of 9313 backedges. 1321 proven. 3480 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2019-09-03 20:58:19,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:19,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:19,736 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:19,736 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:19,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:19,736 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 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:19,748 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:58:19,748 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:58:19,880 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:58:19,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:19,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 104 conjunts are in the unsatisfiable core [2019-09-03 20:58:19,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:19,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:20,009 INFO L134 CoverageAnalysis]: Checked inductivity of 9313 backedges. 1321 proven. 3480 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2019-09-03 20:58:20,009 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:21,871 INFO L134 CoverageAnalysis]: Checked inductivity of 9313 backedges. 1321 proven. 3480 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2019-09-03 20:58:21,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:21,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 56 [2019-09-03 20:58:21,875 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:21,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-03 20:58:21,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-03 20:58:21,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1336, Invalid=1744, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 20:58:21,876 INFO L87 Difference]: Start difference. First operand 400 states and 401 transitions. Second operand 56 states. [2019-09-03 20:58:22,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:22,415 INFO L93 Difference]: Finished difference Result 411 states and 413 transitions. [2019-09-03 20:58:22,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-03 20:58:22,416 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 397 [2019-09-03 20:58:22,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:22,418 INFO L225 Difference]: With dead ends: 411 [2019-09-03 20:58:22,419 INFO L226 Difference]: Without dead ends: 411 [2019-09-03 20:58:22,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 896 GetRequests, 743 SyntacticMatches, 98 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2647 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1342, Invalid=1850, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 20:58:22,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-09-03 20:58:22,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 407. [2019-09-03 20:58:22,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-09-03 20:58:22,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 408 transitions. [2019-09-03 20:58:22,424 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 408 transitions. Word has length 397 [2019-09-03 20:58:22,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:22,425 INFO L475 AbstractCegarLoop]: Abstraction has 407 states and 408 transitions. [2019-09-03 20:58:22,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-03 20:58:22,425 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 408 transitions. [2019-09-03 20:58:22,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-09-03 20:58:22,426 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:22,426 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:22,427 INFO L418 AbstractCegarLoop]: === Iteration 99 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:22,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:22,427 INFO L82 PathProgramCache]: Analyzing trace with hash -597496518, now seen corresponding path program 97 times [2019-09-03 20:58:22,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:22,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:22,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:22,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:22,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:22,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:25,477 INFO L134 CoverageAnalysis]: Checked inductivity of 9653 backedges. 3724 proven. 1225 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2019-09-03 20:58:25,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:25,478 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:25,478 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:25,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:25,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:25,478 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 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:58:25,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:25,506 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:25,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:25,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 962 conjuncts, 102 conjunts are in the unsatisfiable core [2019-09-03 20:58:25,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:29,349 INFO L134 CoverageAnalysis]: Checked inductivity of 9653 backedges. 3724 proven. 1225 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2019-09-03 20:58:29,350 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:32,326 INFO L134 CoverageAnalysis]: Checked inductivity of 9653 backedges. 3724 proven. 1225 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2019-09-03 20:58:32,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:32,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 153 [2019-09-03 20:58:32,330 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:32,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 153 states [2019-09-03 20:58:32,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2019-09-03 20:58:32,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5303, Invalid=17953, Unknown=0, NotChecked=0, Total=23256 [2019-09-03 20:58:32,332 INFO L87 Difference]: Start difference. First operand 407 states and 408 transitions. Second operand 153 states. [2019-09-03 20:58:37,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:37,357 INFO L93 Difference]: Finished difference Result 557 states and 607 transitions. [2019-09-03 20:58:37,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-09-03 20:58:37,358 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 404 [2019-09-03 20:58:37,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:37,360 INFO L225 Difference]: With dead ends: 557 [2019-09-03 20:58:37,360 INFO L226 Difference]: Without dead ends: 408 [2019-09-03 20:58:37,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 961 GetRequests, 659 SyntacticMatches, 100 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17299 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=9332, Invalid=32080, Unknown=0, NotChecked=0, Total=41412 [2019-09-03 20:58:37,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-09-03 20:58:37,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2019-09-03 20:58:37,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-09-03 20:58:37,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 409 transitions. [2019-09-03 20:58:37,369 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 409 transitions. Word has length 404 [2019-09-03 20:58:37,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:37,369 INFO L475 AbstractCegarLoop]: Abstraction has 408 states and 409 transitions. [2019-09-03 20:58:37,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 153 states. [2019-09-03 20:58:37,369 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 409 transitions. [2019-09-03 20:58:37,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2019-09-03 20:58:37,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:37,372 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:37,372 INFO L418 AbstractCegarLoop]: === Iteration 100 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:37,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:37,372 INFO L82 PathProgramCache]: Analyzing trace with hash -819810839, now seen corresponding path program 98 times [2019-09-03 20:58:37,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:37,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:37,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:37,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:37,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:38,484 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 1373 proven. 3626 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2019-09-03 20:58:38,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:38,485 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:38,485 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:38,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:38,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:38,485 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 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:38,495 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:58:38,496 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:58:38,719 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-09-03 20:58:38,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:38,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 967 conjuncts, 106 conjunts are in the unsatisfiable core [2019-09-03 20:58:38,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:38,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:38,851 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 1373 proven. 3626 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2019-09-03 20:58:38,852 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:40,760 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 1373 proven. 3626 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2019-09-03 20:58:40,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:40,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 57 [2019-09-03 20:58:40,765 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:40,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-03 20:58:40,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-03 20:58:40,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1388, Invalid=1804, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 20:58:40,766 INFO L87 Difference]: Start difference. First operand 408 states and 409 transitions. Second operand 57 states. [2019-09-03 20:58:41,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:41,432 INFO L93 Difference]: Finished difference Result 419 states and 421 transitions. [2019-09-03 20:58:41,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-03 20:58:41,432 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 405 [2019-09-03 20:58:41,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:41,435 INFO L225 Difference]: With dead ends: 419 [2019-09-03 20:58:41,435 INFO L226 Difference]: Without dead ends: 419 [2019-09-03 20:58:41,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 914 GetRequests, 758 SyntacticMatches, 100 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2751 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1394, Invalid=1912, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 20:58:41,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-09-03 20:58:41,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 415. [2019-09-03 20:58:41,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-09-03 20:58:41,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 416 transitions. [2019-09-03 20:58:41,440 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 416 transitions. Word has length 405 [2019-09-03 20:58:41,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:41,441 INFO L475 AbstractCegarLoop]: Abstraction has 415 states and 416 transitions. [2019-09-03 20:58:41,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-03 20:58:41,441 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 416 transitions. [2019-09-03 20:58:41,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-09-03 20:58:41,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:41,443 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:41,444 INFO L418 AbstractCegarLoop]: === Iteration 101 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:41,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:41,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1006392185, now seen corresponding path program 99 times [2019-09-03 20:58:41,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:41,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:41,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:41,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:41,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:44,651 INFO L134 CoverageAnalysis]: Checked inductivity of 10050 backedges. 3875 proven. 1275 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2019-09-03 20:58:44,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:44,652 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:44,652 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:44,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:44,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:44,652 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 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:44,662 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:58:44,662 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:58:44,791 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:58:44,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:44,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 981 conjuncts, 104 conjunts are in the unsatisfiable core [2019-09-03 20:58:44,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:48,672 INFO L134 CoverageAnalysis]: Checked inductivity of 10050 backedges. 3875 proven. 1275 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2019-09-03 20:58:48,672 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:51,707 INFO L134 CoverageAnalysis]: Checked inductivity of 10050 backedges. 3875 proven. 1275 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2019-09-03 20:58:51,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:51,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 156 [2019-09-03 20:58:51,711 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:51,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-09-03 20:58:51,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-09-03 20:58:51,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5511, Invalid=18669, Unknown=0, NotChecked=0, Total=24180 [2019-09-03 20:58:51,714 INFO L87 Difference]: Start difference. First operand 415 states and 416 transitions. Second operand 156 states. [2019-09-03 20:58:56,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:56,903 INFO L93 Difference]: Finished difference Result 568 states and 619 transitions. [2019-09-03 20:58:56,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-09-03 20:58:56,903 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 412 [2019-09-03 20:58:56,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:56,906 INFO L225 Difference]: With dead ends: 568 [2019-09-03 20:58:56,906 INFO L226 Difference]: Without dead ends: 416 [2019-09-03 20:58:56,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 980 GetRequests, 672 SyntacticMatches, 102 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18002 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=9697, Invalid=33359, Unknown=0, NotChecked=0, Total=43056 [2019-09-03 20:58:56,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-09-03 20:58:56,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2019-09-03 20:58:56,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-09-03 20:58:56,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 417 transitions. [2019-09-03 20:58:56,917 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 417 transitions. Word has length 412 [2019-09-03 20:58:56,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:56,917 INFO L475 AbstractCegarLoop]: Abstraction has 416 states and 417 transitions. [2019-09-03 20:58:56,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-09-03 20:58:56,917 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 417 transitions. [2019-09-03 20:58:56,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2019-09-03 20:58:56,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:56,919 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:56,920 INFO L418 AbstractCegarLoop]: === Iteration 102 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:56,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:56,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1379666648, now seen corresponding path program 100 times [2019-09-03 20:58:56,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:56,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:56,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:56,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:56,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:58,158 INFO L134 CoverageAnalysis]: Checked inductivity of 10101 backedges. 1426 proven. 3775 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2019-09-03 20:58:58,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:58,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:58,158 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:58,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:58,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:58,159 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 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:58,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:58,170 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:58:58,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:58,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-03 20:58:58,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:58,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:58,440 INFO L134 CoverageAnalysis]: Checked inductivity of 10101 backedges. 1426 proven. 3775 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2019-09-03 20:58:58,440 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:00,375 INFO L134 CoverageAnalysis]: Checked inductivity of 10101 backedges. 1426 proven. 3775 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2019-09-03 20:59:00,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:00,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 58 [2019-09-03 20:59:00,378 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:00,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-03 20:59:00,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-03 20:59:00,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1441, Invalid=1865, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 20:59:00,380 INFO L87 Difference]: Start difference. First operand 416 states and 417 transitions. Second operand 58 states. [2019-09-03 20:59:01,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:01,074 INFO L93 Difference]: Finished difference Result 427 states and 429 transitions. [2019-09-03 20:59:01,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-03 20:59:01,075 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 413 [2019-09-03 20:59:01,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:01,077 INFO L225 Difference]: With dead ends: 427 [2019-09-03 20:59:01,077 INFO L226 Difference]: Without dead ends: 427 [2019-09-03 20:59:01,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 932 GetRequests, 773 SyntacticMatches, 102 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2857 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1447, Invalid=1975, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 20:59:01,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-09-03 20:59:01,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 423. [2019-09-03 20:59:01,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-09-03 20:59:01,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 424 transitions. [2019-09-03 20:59:01,084 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 424 transitions. Word has length 413 [2019-09-03 20:59:01,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:01,084 INFO L475 AbstractCegarLoop]: Abstraction has 423 states and 424 transitions. [2019-09-03 20:59:01,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-03 20:59:01,084 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 424 transitions. [2019-09-03 20:59:01,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-09-03 20:59:01,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:01,087 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:01,087 INFO L418 AbstractCegarLoop]: === Iteration 103 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:01,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:01,087 INFO L82 PathProgramCache]: Analyzing trace with hash -636012710, now seen corresponding path program 101 times [2019-09-03 20:59:01,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:01,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:01,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:01,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:01,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:04,422 INFO L134 CoverageAnalysis]: Checked inductivity of 10455 backedges. 4029 proven. 1326 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2019-09-03 20:59:04,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:04,422 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:04,422 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:04,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:04,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:04,423 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 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:04,432 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:59:04,432 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:59:04,674 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-09-03 20:59:04,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:04,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 1000 conjuncts, 106 conjunts are in the unsatisfiable core [2019-09-03 20:59:04,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:08,656 INFO L134 CoverageAnalysis]: Checked inductivity of 10455 backedges. 4029 proven. 1326 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2019-09-03 20:59:08,656 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:11,831 INFO L134 CoverageAnalysis]: Checked inductivity of 10455 backedges. 4029 proven. 1326 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2019-09-03 20:59:11,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:11,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 159 [2019-09-03 20:59:11,836 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:11,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 159 states [2019-09-03 20:59:11,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2019-09-03 20:59:11,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5723, Invalid=19399, Unknown=0, NotChecked=0, Total=25122 [2019-09-03 20:59:11,838 INFO L87 Difference]: Start difference. First operand 423 states and 424 transitions. Second operand 159 states. [2019-09-03 20:59:17,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:17,149 INFO L93 Difference]: Finished difference Result 579 states and 631 transitions. [2019-09-03 20:59:17,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-09-03 20:59:17,149 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 420 [2019-09-03 20:59:17,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:17,151 INFO L225 Difference]: With dead ends: 579 [2019-09-03 20:59:17,151 INFO L226 Difference]: Without dead ends: 424 [2019-09-03 20:59:17,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 999 GetRequests, 685 SyntacticMatches, 104 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18719 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=10069, Invalid=34663, Unknown=0, NotChecked=0, Total=44732 [2019-09-03 20:59:17,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-09-03 20:59:17,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2019-09-03 20:59:17,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-09-03 20:59:17,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 425 transitions. [2019-09-03 20:59:17,160 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 425 transitions. Word has length 420 [2019-09-03 20:59:17,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:17,160 INFO L475 AbstractCegarLoop]: Abstraction has 424 states and 425 transitions. [2019-09-03 20:59:17,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 159 states. [2019-09-03 20:59:17,160 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 425 transitions. [2019-09-03 20:59:17,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-09-03 20:59:17,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:17,162 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:17,162 INFO L418 AbstractCegarLoop]: === Iteration 104 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:17,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:17,162 INFO L82 PathProgramCache]: Analyzing trace with hash -109725175, now seen corresponding path program 102 times [2019-09-03 20:59:17,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:17,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:17,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:17,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:17,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:18,387 INFO L134 CoverageAnalysis]: Checked inductivity of 10507 backedges. 1480 proven. 3927 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2019-09-03 20:59:18,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:18,387 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:18,387 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:18,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:18,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:18,387 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 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:18,398 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:59:18,398 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:59:18,541 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:59:18,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:18,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 1005 conjuncts, 110 conjunts are in the unsatisfiable core [2019-09-03 20:59:18,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:18,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:18,682 INFO L134 CoverageAnalysis]: Checked inductivity of 10507 backedges. 1480 proven. 3927 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2019-09-03 20:59:18,683 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:20,818 INFO L134 CoverageAnalysis]: Checked inductivity of 10507 backedges. 1480 proven. 3927 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2019-09-03 20:59:20,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:20,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 59 [2019-09-03 20:59:20,822 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:20,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-03 20:59:20,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-03 20:59:20,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1495, Invalid=1927, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 20:59:20,823 INFO L87 Difference]: Start difference. First operand 424 states and 425 transitions. Second operand 59 states. [2019-09-03 20:59:21,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:21,517 INFO L93 Difference]: Finished difference Result 435 states and 437 transitions. [2019-09-03 20:59:21,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-03 20:59:21,518 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 421 [2019-09-03 20:59:21,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:21,520 INFO L225 Difference]: With dead ends: 435 [2019-09-03 20:59:21,520 INFO L226 Difference]: Without dead ends: 435 [2019-09-03 20:59:21,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 950 GetRequests, 788 SyntacticMatches, 104 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2965 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1501, Invalid=2039, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 20:59:21,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-09-03 20:59:21,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 431. [2019-09-03 20:59:21,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-09-03 20:59:21,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 432 transitions. [2019-09-03 20:59:21,526 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 432 transitions. Word has length 421 [2019-09-03 20:59:21,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:21,527 INFO L475 AbstractCegarLoop]: Abstraction has 431 states and 432 transitions. [2019-09-03 20:59:21,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-03 20:59:21,527 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 432 transitions. [2019-09-03 20:59:21,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2019-09-03 20:59:21,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:21,528 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:21,529 INFO L418 AbstractCegarLoop]: === Iteration 105 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:21,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:21,529 INFO L82 PathProgramCache]: Analyzing trace with hash -393649319, now seen corresponding path program 103 times [2019-09-03 20:59:21,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:21,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:21,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:21,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:21,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:24,996 INFO L134 CoverageAnalysis]: Checked inductivity of 10868 backedges. 4186 proven. 1378 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2019-09-03 20:59:24,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:24,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:24,997 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:24,997 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:24,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:24,997 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 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:25,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:25,008 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:59:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:25,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 1019 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-03 20:59:25,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:29,384 INFO L134 CoverageAnalysis]: Checked inductivity of 10868 backedges. 4186 proven. 1378 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2019-09-03 20:59:29,384 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:32,659 INFO L134 CoverageAnalysis]: Checked inductivity of 10868 backedges. 4186 proven. 1378 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2019-09-03 20:59:32,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:32,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 162 [2019-09-03 20:59:32,680 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:32,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-09-03 20:59:32,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-09-03 20:59:32,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5939, Invalid=20143, Unknown=0, NotChecked=0, Total=26082 [2019-09-03 20:59:32,683 INFO L87 Difference]: Start difference. First operand 431 states and 432 transitions. Second operand 162 states. [2019-09-03 20:59:38,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:38,199 INFO L93 Difference]: Finished difference Result 590 states and 643 transitions. [2019-09-03 20:59:38,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-09-03 20:59:38,200 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 428 [2019-09-03 20:59:38,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:38,201 INFO L225 Difference]: With dead ends: 590 [2019-09-03 20:59:38,201 INFO L226 Difference]: Without dead ends: 432 [2019-09-03 20:59:38,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1018 GetRequests, 698 SyntacticMatches, 106 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19450 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=10448, Invalid=35992, Unknown=0, NotChecked=0, Total=46440 [2019-09-03 20:59:38,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-09-03 20:59:38,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2019-09-03 20:59:38,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-09-03 20:59:38,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 433 transitions. [2019-09-03 20:59:38,208 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 433 transitions. Word has length 428 [2019-09-03 20:59:38,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:38,209 INFO L475 AbstractCegarLoop]: Abstraction has 432 states and 433 transitions. [2019-09-03 20:59:38,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-09-03 20:59:38,209 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 433 transitions. [2019-09-03 20:59:38,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2019-09-03 20:59:38,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:38,210 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:38,210 INFO L418 AbstractCegarLoop]: === Iteration 106 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:38,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:38,211 INFO L82 PathProgramCache]: Analyzing trace with hash -452081912, now seen corresponding path program 104 times [2019-09-03 20:59:38,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:38,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:38,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:38,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:38,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:38,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:39,459 INFO L134 CoverageAnalysis]: Checked inductivity of 10921 backedges. 1535 proven. 4082 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2019-09-03 20:59:39,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:39,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:39,459 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:39,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:39,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:39,460 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 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:39,470 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:59:39,470 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:59:39,764 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-09-03 20:59:39,764 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:39,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 1024 conjuncts, 112 conjunts are in the unsatisfiable core [2019-09-03 20:59:39,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:39,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:39,952 INFO L134 CoverageAnalysis]: Checked inductivity of 10921 backedges. 1535 proven. 4082 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2019-09-03 20:59:39,952 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:42,079 INFO L134 CoverageAnalysis]: Checked inductivity of 10921 backedges. 1535 proven. 4082 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2019-09-03 20:59:42,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:42,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 60 [2019-09-03 20:59:42,084 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:42,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-03 20:59:42,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-03 20:59:42,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1550, Invalid=1990, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 20:59:42,085 INFO L87 Difference]: Start difference. First operand 432 states and 433 transitions. Second operand 60 states. [2019-09-03 20:59:42,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:42,774 INFO L93 Difference]: Finished difference Result 443 states and 445 transitions. [2019-09-03 20:59:42,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 20:59:42,774 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 429 [2019-09-03 20:59:42,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:42,776 INFO L225 Difference]: With dead ends: 443 [2019-09-03 20:59:42,776 INFO L226 Difference]: Without dead ends: 443 [2019-09-03 20:59:42,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 968 GetRequests, 803 SyntacticMatches, 106 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3075 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1556, Invalid=2104, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 20:59:42,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-09-03 20:59:42,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 439. [2019-09-03 20:59:42,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-09-03 20:59:42,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 440 transitions. [2019-09-03 20:59:42,781 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 440 transitions. Word has length 429 [2019-09-03 20:59:42,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:42,782 INFO L475 AbstractCegarLoop]: Abstraction has 439 states and 440 transitions. [2019-09-03 20:59:42,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-03 20:59:42,782 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 440 transitions. [2019-09-03 20:59:42,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2019-09-03 20:59:42,784 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:42,784 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:42,785 INFO L418 AbstractCegarLoop]: === Iteration 107 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:42,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:42,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1230473594, now seen corresponding path program 105 times [2019-09-03 20:59:42,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:42,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:42,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:42,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:42,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:42,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:46,394 INFO L134 CoverageAnalysis]: Checked inductivity of 11289 backedges. 4346 proven. 1431 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2019-09-03 20:59:46,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:46,395 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:46,395 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:46,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:46,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:46,395 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 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:46,405 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:59:46,405 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:59:46,551 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:59:46,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:46,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 110 conjunts are in the unsatisfiable core [2019-09-03 20:59:46,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:50,888 INFO L134 CoverageAnalysis]: Checked inductivity of 11289 backedges. 4346 proven. 1431 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2019-09-03 20:59:50,888 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:54,257 INFO L134 CoverageAnalysis]: Checked inductivity of 11289 backedges. 4346 proven. 1431 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2019-09-03 20:59:54,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:54,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 165 [2019-09-03 20:59:54,261 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:54,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 165 states [2019-09-03 20:59:54,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2019-09-03 20:59:54,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6159, Invalid=20901, Unknown=0, NotChecked=0, Total=27060 [2019-09-03 20:59:54,263 INFO L87 Difference]: Start difference. First operand 439 states and 440 transitions. Second operand 165 states. [2019-09-03 20:59:58,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:58,868 INFO L93 Difference]: Finished difference Result 601 states and 655 transitions. [2019-09-03 20:59:58,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-09-03 20:59:58,874 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 436 [2019-09-03 20:59:58,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:58,876 INFO L225 Difference]: With dead ends: 601 [2019-09-03 20:59:58,876 INFO L226 Difference]: Without dead ends: 440 [2019-09-03 20:59:58,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1037 GetRequests, 711 SyntacticMatches, 108 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20195 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=10834, Invalid=37346, Unknown=0, NotChecked=0, Total=48180 [2019-09-03 20:59:58,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-09-03 20:59:58,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2019-09-03 20:59:58,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-09-03 20:59:58,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 441 transitions. [2019-09-03 20:59:58,885 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 441 transitions. Word has length 436 [2019-09-03 20:59:58,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:58,885 INFO L475 AbstractCegarLoop]: Abstraction has 440 states and 441 transitions. [2019-09-03 20:59:58,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 165 states. [2019-09-03 20:59:58,885 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 441 transitions. [2019-09-03 20:59:58,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2019-09-03 20:59:58,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:58,888 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:58,888 INFO L418 AbstractCegarLoop]: === Iteration 108 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:58,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:58,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1401998889, now seen corresponding path program 106 times [2019-09-03 20:59:58,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:58,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:58,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:58,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:58,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:00,266 INFO L134 CoverageAnalysis]: Checked inductivity of 11343 backedges. 1591 proven. 4240 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2019-09-03 21:00:00,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:00,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:00,267 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:00,267 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:00:00,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:00,267 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 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:00,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:00:00,277 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:00:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:00,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 1043 conjuncts, 114 conjunts are in the unsatisfiable core [2019-09-03 21:00:00,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:00,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:00,558 INFO L134 CoverageAnalysis]: Checked inductivity of 11343 backedges. 1591 proven. 4240 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2019-09-03 21:00:00,558 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:02,854 INFO L134 CoverageAnalysis]: Checked inductivity of 11343 backedges. 1591 proven. 4240 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2019-09-03 21:00:02,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:02,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 61 [2019-09-03 21:00:02,858 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:02,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-03 21:00:02,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-03 21:00:02,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1606, Invalid=2054, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 21:00:02,859 INFO L87 Difference]: Start difference. First operand 440 states and 441 transitions. Second operand 61 states. [2019-09-03 21:00:03,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:03,606 INFO L93 Difference]: Finished difference Result 451 states and 453 transitions. [2019-09-03 21:00:03,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-03 21:00:03,607 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 437 [2019-09-03 21:00:03,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:03,609 INFO L225 Difference]: With dead ends: 451 [2019-09-03 21:00:03,609 INFO L226 Difference]: Without dead ends: 451 [2019-09-03 21:00:03,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 986 GetRequests, 818 SyntacticMatches, 108 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3187 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1612, Invalid=2170, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 21:00:03,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-09-03 21:00:03,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 447. [2019-09-03 21:00:03,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-09-03 21:00:03,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 448 transitions. [2019-09-03 21:00:03,614 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 448 transitions. Word has length 437 [2019-09-03 21:00:03,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:03,614 INFO L475 AbstractCegarLoop]: Abstraction has 447 states and 448 transitions. [2019-09-03 21:00:03,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-03 21:00:03,614 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 448 transitions. [2019-09-03 21:00:03,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2019-09-03 21:00:03,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:03,616 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:03,616 INFO L418 AbstractCegarLoop]: === Iteration 109 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:03,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:03,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1649054919, now seen corresponding path program 107 times [2019-09-03 21:00:03,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:03,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:03,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:00:03,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:03,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:07,290 INFO L134 CoverageAnalysis]: Checked inductivity of 11718 backedges. 4509 proven. 1485 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2019-09-03 21:00:07,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:07,291 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:07,291 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:07,291 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:00:07,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:07,291 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 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:07,301 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:00:07,301 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:00:07,558 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2019-09-03 21:00:07,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:00:07,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 1057 conjuncts, 112 conjunts are in the unsatisfiable core [2019-09-03 21:00:07,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:12,033 INFO L134 CoverageAnalysis]: Checked inductivity of 11718 backedges. 4509 proven. 1485 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2019-09-03 21:00:12,034 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:15,628 INFO L134 CoverageAnalysis]: Checked inductivity of 11718 backedges. 4509 proven. 1485 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2019-09-03 21:00:15,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:15,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113, 113] total 168 [2019-09-03 21:00:15,633 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:15,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-09-03 21:00:15,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-09-03 21:00:15,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6383, Invalid=21673, Unknown=0, NotChecked=0, Total=28056 [2019-09-03 21:00:15,636 INFO L87 Difference]: Start difference. First operand 447 states and 448 transitions. Second operand 168 states. [2019-09-03 21:00:20,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:20,451 INFO L93 Difference]: Finished difference Result 612 states and 667 transitions. [2019-09-03 21:00:20,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-09-03 21:00:20,452 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 444 [2019-09-03 21:00:20,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:20,453 INFO L225 Difference]: With dead ends: 612 [2019-09-03 21:00:20,453 INFO L226 Difference]: Without dead ends: 448 [2019-09-03 21:00:20,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1056 GetRequests, 724 SyntacticMatches, 110 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20954 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=11227, Invalid=38725, Unknown=0, NotChecked=0, Total=49952 [2019-09-03 21:00:20,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2019-09-03 21:00:20,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2019-09-03 21:00:20,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-09-03 21:00:20,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 449 transitions. [2019-09-03 21:00:20,461 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 449 transitions. Word has length 444 [2019-09-03 21:00:20,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:20,462 INFO L475 AbstractCegarLoop]: Abstraction has 448 states and 449 transitions. [2019-09-03 21:00:20,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-09-03 21:00:20,462 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 449 transitions. [2019-09-03 21:00:20,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2019-09-03 21:00:20,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:20,463 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:20,464 INFO L418 AbstractCegarLoop]: === Iteration 110 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:20,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:20,464 INFO L82 PathProgramCache]: Analyzing trace with hash -416116504, now seen corresponding path program 108 times [2019-09-03 21:00:20,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:20,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:20,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:00:20,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:20,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:21,821 INFO L134 CoverageAnalysis]: Checked inductivity of 11773 backedges. 1648 proven. 4401 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2019-09-03 21:00:21,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:21,821 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:21,821 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:21,821 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:00:21,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:21,821 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 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:21,831 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:00:21,832 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:00:21,999 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:00:21,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:00:22,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 1062 conjuncts, 116 conjunts are in the unsatisfiable core [2019-09-03 21:00:22,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:22,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:22,276 INFO L134 CoverageAnalysis]: Checked inductivity of 11773 backedges. 1648 proven. 4401 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2019-09-03 21:00:22,276 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:24,572 INFO L134 CoverageAnalysis]: Checked inductivity of 11773 backedges. 1648 proven. 4401 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2019-09-03 21:00:24,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:24,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 62 [2019-09-03 21:00:24,576 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:24,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-03 21:00:24,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-03 21:00:24,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1663, Invalid=2119, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 21:00:24,577 INFO L87 Difference]: Start difference. First operand 448 states and 449 transitions. Second operand 62 states. [2019-09-03 21:00:25,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:25,441 INFO L93 Difference]: Finished difference Result 459 states and 461 transitions. [2019-09-03 21:00:25,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-03 21:00:25,441 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 445 [2019-09-03 21:00:25,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:25,443 INFO L225 Difference]: With dead ends: 459 [2019-09-03 21:00:25,443 INFO L226 Difference]: Without dead ends: 459 [2019-09-03 21:00:25,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1004 GetRequests, 833 SyntacticMatches, 110 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3301 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1669, Invalid=2237, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 21:00:25,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-09-03 21:00:25,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 455. [2019-09-03 21:00:25,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-09-03 21:00:25,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 456 transitions. [2019-09-03 21:00:25,449 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 456 transitions. Word has length 445 [2019-09-03 21:00:25,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:25,450 INFO L475 AbstractCegarLoop]: Abstraction has 455 states and 456 transitions. [2019-09-03 21:00:25,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-03 21:00:25,450 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 456 transitions. [2019-09-03 21:00:25,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2019-09-03 21:00:25,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:25,452 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:25,453 INFO L418 AbstractCegarLoop]: === Iteration 111 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:25,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:25,453 INFO L82 PathProgramCache]: Analyzing trace with hash 133555098, now seen corresponding path program 109 times [2019-09-03 21:00:25,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:25,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:25,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:00:25,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:25,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:25,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:29,398 INFO L134 CoverageAnalysis]: Checked inductivity of 12155 backedges. 4675 proven. 1540 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2019-09-03 21:00:29,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:29,399 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:29,399 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:29,399 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:00:29,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:29,399 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 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:29,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:00:29,411 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:00:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:29,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 1076 conjuncts, 114 conjunts are in the unsatisfiable core [2019-09-03 21:00:29,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:34,173 INFO L134 CoverageAnalysis]: Checked inductivity of 12155 backedges. 4675 proven. 1540 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2019-09-03 21:00:34,174 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:37,838 INFO L134 CoverageAnalysis]: Checked inductivity of 12155 backedges. 4675 proven. 1540 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2019-09-03 21:00:37,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:37,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 115, 115] total 171 [2019-09-03 21:00:37,843 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:37,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 171 states [2019-09-03 21:00:37,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2019-09-03 21:00:37,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6611, Invalid=22459, Unknown=0, NotChecked=0, Total=29070 [2019-09-03 21:00:37,846 INFO L87 Difference]: Start difference. First operand 455 states and 456 transitions. Second operand 171 states. [2019-09-03 21:00:42,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:42,785 INFO L93 Difference]: Finished difference Result 623 states and 679 transitions. [2019-09-03 21:00:42,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-09-03 21:00:42,785 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 452 [2019-09-03 21:00:42,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:42,787 INFO L225 Difference]: With dead ends: 623 [2019-09-03 21:00:42,787 INFO L226 Difference]: Without dead ends: 456 [2019-09-03 21:00:42,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1075 GetRequests, 737 SyntacticMatches, 112 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21727 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=11627, Invalid=40129, Unknown=0, NotChecked=0, Total=51756 [2019-09-03 21:00:42,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-09-03 21:00:42,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2019-09-03 21:00:42,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-09-03 21:00:42,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 457 transitions. [2019-09-03 21:00:42,796 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 457 transitions. Word has length 452 [2019-09-03 21:00:42,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:42,796 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 457 transitions. [2019-09-03 21:00:42,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 171 states. [2019-09-03 21:00:42,796 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 457 transitions. [2019-09-03 21:00:42,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2019-09-03 21:00:42,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:42,798 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:42,798 INFO L418 AbstractCegarLoop]: === Iteration 112 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:42,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:42,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1018828215, now seen corresponding path program 110 times [2019-09-03 21:00:42,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:42,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:42,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:00:42,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:42,799 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:44,180 INFO L134 CoverageAnalysis]: Checked inductivity of 12211 backedges. 1706 proven. 4565 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2019-09-03 21:00:44,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:44,180 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:44,180 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:44,180 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:00:44,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:44,180 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 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:44,190 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:00:44,190 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:00:44,616 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2019-09-03 21:00:44,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:00:44,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 1081 conjuncts, 118 conjunts are in the unsatisfiable core [2019-09-03 21:00:44,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:44,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:44,769 INFO L134 CoverageAnalysis]: Checked inductivity of 12211 backedges. 1706 proven. 4565 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2019-09-03 21:00:44,769 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:47,130 INFO L134 CoverageAnalysis]: Checked inductivity of 12211 backedges. 1706 proven. 4565 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2019-09-03 21:00:47,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:47,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 63 [2019-09-03 21:00:47,134 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:47,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-03 21:00:47,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-03 21:00:47,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1721, Invalid=2185, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 21:00:47,135 INFO L87 Difference]: Start difference. First operand 456 states and 457 transitions. Second operand 63 states. [2019-09-03 21:00:47,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:47,824 INFO L93 Difference]: Finished difference Result 467 states and 469 transitions. [2019-09-03 21:00:47,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-03 21:00:47,825 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 453 [2019-09-03 21:00:47,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:47,826 INFO L225 Difference]: With dead ends: 467 [2019-09-03 21:00:47,826 INFO L226 Difference]: Without dead ends: 467 [2019-09-03 21:00:47,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1022 GetRequests, 848 SyntacticMatches, 112 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3417 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1727, Invalid=2305, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 21:00:47,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-09-03 21:00:47,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 463. [2019-09-03 21:00:47,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-09-03 21:00:47,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 464 transitions. [2019-09-03 21:00:47,837 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 464 transitions. Word has length 453 [2019-09-03 21:00:47,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:47,838 INFO L475 AbstractCegarLoop]: Abstraction has 463 states and 464 transitions. [2019-09-03 21:00:47,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-03 21:00:47,838 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 464 transitions. [2019-09-03 21:00:47,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2019-09-03 21:00:47,839 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:47,840 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:47,840 INFO L418 AbstractCegarLoop]: === Iteration 113 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:47,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:47,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1519490279, now seen corresponding path program 111 times [2019-09-03 21:00:47,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:47,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:47,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:00:47,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:47,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:51,851 INFO L134 CoverageAnalysis]: Checked inductivity of 12600 backedges. 4844 proven. 1596 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2019-09-03 21:00:51,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:51,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:51,851 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:51,851 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:00:51,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:51,851 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 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:51,860 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:00:51,861 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:00:52,014 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:00:52,014 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:00:52,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 1095 conjuncts, 116 conjunts are in the unsatisfiable core [2019-09-03 21:00:52,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:56,787 INFO L134 CoverageAnalysis]: Checked inductivity of 12600 backedges. 4844 proven. 1596 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2019-09-03 21:00:56,788 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:01:00,687 INFO L134 CoverageAnalysis]: Checked inductivity of 12600 backedges. 4844 proven. 1596 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2019-09-03 21:01:00,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:00,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 117, 117] total 174 [2019-09-03 21:01:00,691 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:00,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 174 states [2019-09-03 21:01:00,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2019-09-03 21:01:00,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6843, Invalid=23259, Unknown=0, NotChecked=0, Total=30102 [2019-09-03 21:01:00,694 INFO L87 Difference]: Start difference. First operand 463 states and 464 transitions. Second operand 174 states. [2019-09-03 21:01:05,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:05,236 INFO L93 Difference]: Finished difference Result 634 states and 691 transitions. [2019-09-03 21:01:05,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-09-03 21:01:05,236 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 460 [2019-09-03 21:01:05,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:05,238 INFO L225 Difference]: With dead ends: 634 [2019-09-03 21:01:05,238 INFO L226 Difference]: Without dead ends: 464 [2019-09-03 21:01:05,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1094 GetRequests, 750 SyntacticMatches, 114 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22514 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=12034, Invalid=41558, Unknown=0, NotChecked=0, Total=53592 [2019-09-03 21:01:05,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-09-03 21:01:05,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2019-09-03 21:01:05,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-09-03 21:01:05,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 465 transitions. [2019-09-03 21:01:05,248 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 465 transitions. Word has length 460 [2019-09-03 21:01:05,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:05,248 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 465 transitions. [2019-09-03 21:01:05,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 174 states. [2019-09-03 21:01:05,249 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 465 transitions. [2019-09-03 21:01:05,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2019-09-03 21:01:05,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:05,251 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:05,251 INFO L418 AbstractCegarLoop]: === Iteration 114 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:05,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:05,252 INFO L82 PathProgramCache]: Analyzing trace with hash 102781640, now seen corresponding path program 112 times [2019-09-03 21:01:05,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:05,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:05,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:01:05,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:05,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:06,691 INFO L134 CoverageAnalysis]: Checked inductivity of 12657 backedges. 1765 proven. 4732 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2019-09-03 21:01:06,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:06,691 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:01:06,691 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:01:06,692 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:01:06,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:06,692 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 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:01:06,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:01:06,701 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:01:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:06,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 1100 conjuncts, 120 conjunts are in the unsatisfiable core [2019-09-03 21:01:06,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:01:06,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:06,996 INFO L134 CoverageAnalysis]: Checked inductivity of 12657 backedges. 1765 proven. 4732 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2019-09-03 21:01:06,996 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:01:09,386 INFO L134 CoverageAnalysis]: Checked inductivity of 12657 backedges. 1765 proven. 4732 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2019-09-03 21:01:09,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:09,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 64 [2019-09-03 21:01:09,391 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:09,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-03 21:01:09,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-03 21:01:09,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1780, Invalid=2252, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 21:01:09,392 INFO L87 Difference]: Start difference. First operand 464 states and 465 transitions. Second operand 64 states. [2019-09-03 21:01:10,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:10,239 INFO L93 Difference]: Finished difference Result 475 states and 477 transitions. [2019-09-03 21:01:10,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-03 21:01:10,239 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 461 [2019-09-03 21:01:10,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:10,241 INFO L225 Difference]: With dead ends: 475 [2019-09-03 21:01:10,241 INFO L226 Difference]: Without dead ends: 475 [2019-09-03 21:01:10,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1040 GetRequests, 863 SyntacticMatches, 114 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3535 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1786, Invalid=2374, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 21:01:10,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-09-03 21:01:10,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 471. [2019-09-03 21:01:10,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-09-03 21:01:10,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 472 transitions. [2019-09-03 21:01:10,246 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 472 transitions. Word has length 461 [2019-09-03 21:01:10,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:10,246 INFO L475 AbstractCegarLoop]: Abstraction has 471 states and 472 transitions. [2019-09-03 21:01:10,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-03 21:01:10,246 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 472 transitions. [2019-09-03 21:01:10,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2019-09-03 21:01:10,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:10,248 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:10,248 INFO L418 AbstractCegarLoop]: === Iteration 115 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:10,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:10,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1547978170, now seen corresponding path program 113 times [2019-09-03 21:01:10,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:10,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:10,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:01:10,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:10,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:14,433 INFO L134 CoverageAnalysis]: Checked inductivity of 13053 backedges. 5016 proven. 1653 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2019-09-03 21:01:14,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:14,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:01:14,434 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:01:14,434 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:01:14,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:14,434 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 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:01:14,445 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:01:14,445 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:01:14,724 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2019-09-03 21:01:14,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:01:14,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 1114 conjuncts, 118 conjunts are in the unsatisfiable core [2019-09-03 21:01:14,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:01:19,687 INFO L134 CoverageAnalysis]: Checked inductivity of 13053 backedges. 5016 proven. 1653 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2019-09-03 21:01:19,687 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:01:23,676 INFO L134 CoverageAnalysis]: Checked inductivity of 13053 backedges. 5016 proven. 1653 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2019-09-03 21:01:23,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:23,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119, 119, 119] total 177 [2019-09-03 21:01:23,681 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:23,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 177 states [2019-09-03 21:01:23,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 177 interpolants. [2019-09-03 21:01:23,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7079, Invalid=24073, Unknown=0, NotChecked=0, Total=31152 [2019-09-03 21:01:23,684 INFO L87 Difference]: Start difference. First operand 471 states and 472 transitions. Second operand 177 states. [2019-09-03 21:01:27,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:27,844 INFO L93 Difference]: Finished difference Result 645 states and 703 transitions. [2019-09-03 21:01:27,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-03 21:01:27,845 INFO L78 Accepts]: Start accepts. Automaton has 177 states. Word has length 468 [2019-09-03 21:01:27,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:27,846 INFO L225 Difference]: With dead ends: 645 [2019-09-03 21:01:27,846 INFO L226 Difference]: Without dead ends: 472 [2019-09-03 21:01:27,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1113 GetRequests, 763 SyntacticMatches, 116 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23315 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=12448, Invalid=43012, Unknown=0, NotChecked=0, Total=55460 [2019-09-03 21:01:27,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-09-03 21:01:27,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2019-09-03 21:01:27,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-09-03 21:01:27,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 473 transitions. [2019-09-03 21:01:27,855 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 473 transitions. Word has length 468 [2019-09-03 21:01:27,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:27,855 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 473 transitions. [2019-09-03 21:01:27,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 177 states. [2019-09-03 21:01:27,856 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 473 transitions. [2019-09-03 21:01:27,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-09-03 21:01:27,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:27,858 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 58, 58, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:27,858 INFO L418 AbstractCegarLoop]: === Iteration 116 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:27,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:27,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1763242391, now seen corresponding path program 114 times [2019-09-03 21:01:27,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:27,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:27,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:01:27,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:27,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:29,310 INFO L134 CoverageAnalysis]: Checked inductivity of 13111 backedges. 1825 proven. 4902 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2019-09-03 21:01:29,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:29,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:01:29,310 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:01:29,311 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:01:29,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:29,311 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 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:01:29,321 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:01:29,321 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:01:29,488 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:01:29,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:01:29,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 1119 conjuncts, 122 conjunts are in the unsatisfiable core [2019-09-03 21:01:29,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:01:29,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:29,652 INFO L134 CoverageAnalysis]: Checked inductivity of 13111 backedges. 1825 proven. 4902 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2019-09-03 21:01:29,652 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:01:32,250 INFO L134 CoverageAnalysis]: Checked inductivity of 13111 backedges. 1825 proven. 4902 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2019-09-03 21:01:32,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:32,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 65 [2019-09-03 21:01:32,254 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:32,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-03 21:01:32,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-03 21:01:32,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1840, Invalid=2320, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 21:01:32,255 INFO L87 Difference]: Start difference. First operand 472 states and 473 transitions. Second operand 65 states. [2019-09-03 21:01:33,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:33,289 INFO L93 Difference]: Finished difference Result 483 states and 485 transitions. [2019-09-03 21:01:33,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-03 21:01:33,289 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 469 [2019-09-03 21:01:33,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:33,292 INFO L225 Difference]: With dead ends: 483 [2019-09-03 21:01:33,292 INFO L226 Difference]: Without dead ends: 483 [2019-09-03 21:01:33,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1058 GetRequests, 878 SyntacticMatches, 116 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3655 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1846, Invalid=2444, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 21:01:33,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-09-03 21:01:33,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 479. [2019-09-03 21:01:33,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-09-03 21:01:33,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 480 transitions. [2019-09-03 21:01:33,297 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 480 transitions. Word has length 469 [2019-09-03 21:01:33,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:33,298 INFO L475 AbstractCegarLoop]: Abstraction has 479 states and 480 transitions. [2019-09-03 21:01:33,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-03 21:01:33,298 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 480 transitions. [2019-09-03 21:01:33,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2019-09-03 21:01:33,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:33,301 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:33,301 INFO L418 AbstractCegarLoop]: === Iteration 117 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:33,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:33,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1361208057, now seen corresponding path program 115 times [2019-09-03 21:01:33,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:33,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:33,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:01:33,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:33,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:33,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:37,519 INFO L134 CoverageAnalysis]: Checked inductivity of 13514 backedges. 5191 proven. 1711 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2019-09-03 21:01:37,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:37,519 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:01:37,519 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:01:37,520 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:01:37,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:37,520 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 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 21:01:37,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:01:37,551 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:01:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:37,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 1133 conjuncts, 120 conjunts are in the unsatisfiable core [2019-09-03 21:01:37,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:01:42,791 INFO L134 CoverageAnalysis]: Checked inductivity of 13514 backedges. 5191 proven. 1711 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2019-09-03 21:01:42,791 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:01:46,854 INFO L134 CoverageAnalysis]: Checked inductivity of 13514 backedges. 5191 proven. 1711 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2019-09-03 21:01:46,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:46,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121, 121, 121] total 180 [2019-09-03 21:01:46,858 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:46,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 180 states [2019-09-03 21:01:46,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2019-09-03 21:01:46,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7319, Invalid=24901, Unknown=0, NotChecked=0, Total=32220 [2019-09-03 21:01:46,861 INFO L87 Difference]: Start difference. First operand 479 states and 480 transitions. Second operand 180 states. [2019-09-03 21:01:52,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:52,213 INFO L93 Difference]: Finished difference Result 656 states and 715 transitions. [2019-09-03 21:01:52,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-09-03 21:01:52,214 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 476 [2019-09-03 21:01:52,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:52,215 INFO L225 Difference]: With dead ends: 656 [2019-09-03 21:01:52,216 INFO L226 Difference]: Without dead ends: 480 [2019-09-03 21:01:52,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1132 GetRequests, 776 SyntacticMatches, 118 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24130 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=12869, Invalid=44491, Unknown=0, NotChecked=0, Total=57360 [2019-09-03 21:01:52,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-09-03 21:01:52,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2019-09-03 21:01:52,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-09-03 21:01:52,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 481 transitions. [2019-09-03 21:01:52,224 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 481 transitions. Word has length 476 [2019-09-03 21:01:52,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:52,225 INFO L475 AbstractCegarLoop]: Abstraction has 480 states and 481 transitions. [2019-09-03 21:01:52,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 180 states. [2019-09-03 21:01:52,225 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 481 transitions. [2019-09-03 21:01:52,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2019-09-03 21:01:52,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:52,226 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:52,227 INFO L418 AbstractCegarLoop]: === Iteration 118 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:52,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:52,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1689973592, now seen corresponding path program 116 times [2019-09-03 21:01:52,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:52,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:52,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:01:52,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:52,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:53,721 INFO L134 CoverageAnalysis]: Checked inductivity of 13573 backedges. 1886 proven. 5075 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2019-09-03 21:01:53,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:53,722 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:01:53,722 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:01:53,722 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:01:53,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:53,722 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 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:01:53,731 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:01:53,731 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:01:54,029 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 59 check-sat command(s) [2019-09-03 21:01:54,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:01:54,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 1138 conjuncts, 124 conjunts are in the unsatisfiable core [2019-09-03 21:01:54,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:01:54,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:54,192 INFO L134 CoverageAnalysis]: Checked inductivity of 13573 backedges. 1886 proven. 5075 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2019-09-03 21:01:54,192 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:01:56,734 INFO L134 CoverageAnalysis]: Checked inductivity of 13573 backedges. 1886 proven. 5075 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2019-09-03 21:01:56,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:56,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 66 [2019-09-03 21:01:56,738 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:56,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-03 21:01:56,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-03 21:01:56,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1901, Invalid=2389, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 21:01:56,739 INFO L87 Difference]: Start difference. First operand 480 states and 481 transitions. Second operand 66 states. [2019-09-03 21:01:57,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:57,413 INFO L93 Difference]: Finished difference Result 491 states and 493 transitions. [2019-09-03 21:01:57,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-03 21:01:57,414 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 477 [2019-09-03 21:01:57,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:57,416 INFO L225 Difference]: With dead ends: 491 [2019-09-03 21:01:57,416 INFO L226 Difference]: Without dead ends: 491 [2019-09-03 21:01:57,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1076 GetRequests, 893 SyntacticMatches, 118 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3777 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1907, Invalid=2515, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 21:01:57,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-09-03 21:01:57,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 487. [2019-09-03 21:01:57,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-09-03 21:01:57,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 488 transitions. [2019-09-03 21:01:57,422 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 488 transitions. Word has length 477 [2019-09-03 21:01:57,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:57,422 INFO L475 AbstractCegarLoop]: Abstraction has 487 states and 488 transitions. [2019-09-03 21:01:57,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-03 21:01:57,422 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 488 transitions. [2019-09-03 21:01:57,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2019-09-03 21:01:57,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:57,424 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:57,425 INFO L418 AbstractCegarLoop]: === Iteration 119 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:57,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:57,425 INFO L82 PathProgramCache]: Analyzing trace with hash 353677274, now seen corresponding path program 117 times [2019-09-03 21:01:57,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:57,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:57,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:01:57,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:57,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:57,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:01,875 INFO L134 CoverageAnalysis]: Checked inductivity of 13983 backedges. 5369 proven. 1770 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2019-09-03 21:02:01,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:01,876 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:02:01,876 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:02:01,876 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:02:01,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:01,876 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 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:02:01,886 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:02:01,886 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:02:02,043 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:02:02,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:02:02,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 1152 conjuncts, 122 conjunts are in the unsatisfiable core [2019-09-03 21:02:02,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:02:07,374 INFO L134 CoverageAnalysis]: Checked inductivity of 13983 backedges. 5369 proven. 1770 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2019-09-03 21:02:07,374 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:02:11,574 INFO L134 CoverageAnalysis]: Checked inductivity of 13983 backedges. 5369 proven. 1770 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2019-09-03 21:02:11,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:02:11,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123, 123, 123] total 183 [2019-09-03 21:02:11,579 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:02:11,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 183 states [2019-09-03 21:02:11,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 183 interpolants. [2019-09-03 21:02:11,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7563, Invalid=25743, Unknown=0, NotChecked=0, Total=33306 [2019-09-03 21:02:11,582 INFO L87 Difference]: Start difference. First operand 487 states and 488 transitions. Second operand 183 states. [2019-09-03 21:02:16,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:02:16,983 INFO L93 Difference]: Finished difference Result 667 states and 727 transitions. [2019-09-03 21:02:16,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-09-03 21:02:16,984 INFO L78 Accepts]: Start accepts. Automaton has 183 states. Word has length 484 [2019-09-03 21:02:16,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:02:16,985 INFO L225 Difference]: With dead ends: 667 [2019-09-03 21:02:16,986 INFO L226 Difference]: Without dead ends: 488 [2019-09-03 21:02:16,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1151 GetRequests, 789 SyntacticMatches, 120 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24959 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=13297, Invalid=45995, Unknown=0, NotChecked=0, Total=59292 [2019-09-03 21:02:16,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-09-03 21:02:16,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2019-09-03 21:02:16,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-03 21:02:16,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 489 transitions. [2019-09-03 21:02:16,996 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 489 transitions. Word has length 484 [2019-09-03 21:02:16,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:02:16,996 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 489 transitions. [2019-09-03 21:02:16,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 183 states. [2019-09-03 21:02:16,996 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 489 transitions. [2019-09-03 21:02:16,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2019-09-03 21:02:16,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:02:16,999 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:02:16,999 INFO L418 AbstractCegarLoop]: === Iteration 120 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:02:17,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:02:17,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1522124151, now seen corresponding path program 118 times [2019-09-03 21:02:17,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:02:17,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:17,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:02:17,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:17,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:02:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:18,600 INFO L134 CoverageAnalysis]: Checked inductivity of 14043 backedges. 1948 proven. 5251 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2019-09-03 21:02:18,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:18,600 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:02:18,600 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:02:18,600 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:02:18,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:18,600 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 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:02:18,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:02:18,611 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:02:18,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:18,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 1157 conjuncts, 126 conjunts are in the unsatisfiable core [2019-09-03 21:02:18,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:02:18,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:18,937 INFO L134 CoverageAnalysis]: Checked inductivity of 14043 backedges. 1948 proven. 5251 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2019-09-03 21:02:18,937 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:02:21,592 INFO L134 CoverageAnalysis]: Checked inductivity of 14043 backedges. 1948 proven. 5251 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2019-09-03 21:02:21,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:02:21,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 67 [2019-09-03 21:02:21,596 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:02:21,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-03 21:02:21,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-03 21:02:21,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1963, Invalid=2459, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 21:02:21,597 INFO L87 Difference]: Start difference. First operand 488 states and 489 transitions. Second operand 67 states. [2019-09-03 21:02:22,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:02:22,357 INFO L93 Difference]: Finished difference Result 499 states and 501 transitions. [2019-09-03 21:02:22,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-03 21:02:22,357 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 485 [2019-09-03 21:02:22,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:02:22,359 INFO L225 Difference]: With dead ends: 499 [2019-09-03 21:02:22,359 INFO L226 Difference]: Without dead ends: 499 [2019-09-03 21:02:22,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1094 GetRequests, 908 SyntacticMatches, 120 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3901 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1969, Invalid=2587, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 21:02:22,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-09-03 21:02:22,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 495. [2019-09-03 21:02:22,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-03 21:02:22,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 496 transitions. [2019-09-03 21:02:22,365 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 496 transitions. Word has length 485 [2019-09-03 21:02:22,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:02:22,365 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 496 transitions. [2019-09-03 21:02:22,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-03 21:02:22,365 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 496 transitions. [2019-09-03 21:02:22,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2019-09-03 21:02:22,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:02:22,367 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:02:22,367 INFO L418 AbstractCegarLoop]: === Iteration 121 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:02:22,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:02:22,367 INFO L82 PathProgramCache]: Analyzing trace with hash -641772839, now seen corresponding path program 119 times [2019-09-03 21:02:22,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:02:22,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:22,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:02:22,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:22,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:02:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:26,993 INFO L134 CoverageAnalysis]: Checked inductivity of 14460 backedges. 5550 proven. 1830 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2019-09-03 21:02:26,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:26,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:02:26,994 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:02:26,994 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:02:26,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:26,995 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 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 21:02:27,016 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:02:27,016 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:02:27,525 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 61 check-sat command(s) [2019-09-03 21:02:27,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:02:27,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 1171 conjuncts, 124 conjunts are in the unsatisfiable core [2019-09-03 21:02:27,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:02:33,009 INFO L134 CoverageAnalysis]: Checked inductivity of 14460 backedges. 5550 proven. 1830 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2019-09-03 21:02:33,009 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:02:37,317 INFO L134 CoverageAnalysis]: Checked inductivity of 14460 backedges. 5550 proven. 1830 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2019-09-03 21:02:37,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:02:37,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125, 125, 125] total 186 [2019-09-03 21:02:37,322 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:02:37,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 186 states [2019-09-03 21:02:37,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2019-09-03 21:02:37,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7811, Invalid=26599, Unknown=0, NotChecked=0, Total=34410 [2019-09-03 21:02:37,325 INFO L87 Difference]: Start difference. First operand 495 states and 496 transitions. Second operand 186 states. [2019-09-03 21:02:42,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:02:42,092 INFO L93 Difference]: Finished difference Result 678 states and 739 transitions. [2019-09-03 21:02:42,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-03 21:02:42,092 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 492 [2019-09-03 21:02:42,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:02:42,093 INFO L225 Difference]: With dead ends: 678 [2019-09-03 21:02:42,094 INFO L226 Difference]: Without dead ends: 496 [2019-09-03 21:02:42,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1170 GetRequests, 802 SyntacticMatches, 122 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25802 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=13732, Invalid=47524, Unknown=0, NotChecked=0, Total=61256 [2019-09-03 21:02:42,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2019-09-03 21:02:42,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2019-09-03 21:02:42,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-09-03 21:02:42,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 497 transitions. [2019-09-03 21:02:42,103 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 497 transitions. Word has length 492 [2019-09-03 21:02:42,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:02:42,103 INFO L475 AbstractCegarLoop]: Abstraction has 496 states and 497 transitions. [2019-09-03 21:02:42,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 186 states. [2019-09-03 21:02:42,103 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 497 transitions. [2019-09-03 21:02:42,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-09-03 21:02:42,105 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:02:42,105 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 61, 61, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:02:42,105 INFO L418 AbstractCegarLoop]: === Iteration 122 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:02:42,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:02:42,105 INFO L82 PathProgramCache]: Analyzing trace with hash -410075512, now seen corresponding path program 120 times [2019-09-03 21:02:42,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:02:42,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:42,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:02:42,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:42,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:02:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:43,681 INFO L134 CoverageAnalysis]: Checked inductivity of 14521 backedges. 2011 proven. 5430 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2019-09-03 21:02:43,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:43,682 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:02:43,682 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:02:43,682 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:02:43,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:43,682 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:02:43,692 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:02:43,692 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:02:43,859 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:02:43,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:02:43,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 1176 conjuncts, 128 conjunts are in the unsatisfiable core [2019-09-03 21:02:43,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:02:43,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:44,081 INFO L134 CoverageAnalysis]: Checked inductivity of 14521 backedges. 2011 proven. 5430 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2019-09-03 21:02:44,082 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:02:46,806 INFO L134 CoverageAnalysis]: Checked inductivity of 14521 backedges. 2011 proven. 5430 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2019-09-03 21:02:46,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:02:46,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 68 [2019-09-03 21:02:46,811 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:02:46,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-03 21:02:46,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-03 21:02:46,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2026, Invalid=2530, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 21:02:46,812 INFO L87 Difference]: Start difference. First operand 496 states and 497 transitions. Second operand 68 states. [2019-09-03 21:02:47,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:02:47,658 INFO L93 Difference]: Finished difference Result 507 states and 509 transitions. [2019-09-03 21:02:47,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-03 21:02:47,658 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 493 [2019-09-03 21:02:47,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:02:47,661 INFO L225 Difference]: With dead ends: 507 [2019-09-03 21:02:47,661 INFO L226 Difference]: Without dead ends: 507 [2019-09-03 21:02:47,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1112 GetRequests, 923 SyntacticMatches, 122 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4027 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2032, Invalid=2660, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 21:02:47,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-09-03 21:02:47,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 503. [2019-09-03 21:02:47,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2019-09-03 21:02:47,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 504 transitions. [2019-09-03 21:02:47,668 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 504 transitions. Word has length 493 [2019-09-03 21:02:47,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:02:47,668 INFO L475 AbstractCegarLoop]: Abstraction has 503 states and 504 transitions. [2019-09-03 21:02:47,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-03 21:02:47,669 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 504 transitions. [2019-09-03 21:02:47,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2019-09-03 21:02:47,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:02:47,671 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 62, 61, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:02:47,671 INFO L418 AbstractCegarLoop]: === Iteration 123 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:02:47,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:02:47,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1447484934, now seen corresponding path program 121 times [2019-09-03 21:02:47,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:02:47,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:47,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:02:47,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:47,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:02:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:52,392 INFO L134 CoverageAnalysis]: Checked inductivity of 14945 backedges. 5734 proven. 1891 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2019-09-03 21:02:52,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:52,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:02:52,392 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:02:52,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:02:52,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:52,393 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 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:02:52,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:02:52,403 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:02:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:52,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 1190 conjuncts, 126 conjunts are in the unsatisfiable core [2019-09-03 21:02:52,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:02:58,164 INFO L134 CoverageAnalysis]: Checked inductivity of 14945 backedges. 5734 proven. 1891 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2019-09-03 21:02:58,165 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:03:02,697 INFO L134 CoverageAnalysis]: Checked inductivity of 14945 backedges. 5734 proven. 1891 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2019-09-03 21:03:02,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:03:02,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127, 127, 127] total 189 [2019-09-03 21:03:02,701 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:03:02,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 189 states [2019-09-03 21:03:02,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 189 interpolants. [2019-09-03 21:03:02,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8063, Invalid=27469, Unknown=0, NotChecked=0, Total=35532 [2019-09-03 21:03:02,705 INFO L87 Difference]: Start difference. First operand 503 states and 504 transitions. Second operand 189 states. [2019-09-03 21:03:10,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:03:10,041 INFO L93 Difference]: Finished difference Result 689 states and 751 transitions. [2019-09-03 21:03:10,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-09-03 21:03:10,042 INFO L78 Accepts]: Start accepts. Automaton has 189 states. Word has length 500 [2019-09-03 21:03:10,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:03:10,043 INFO L225 Difference]: With dead ends: 689 [2019-09-03 21:03:10,043 INFO L226 Difference]: Without dead ends: 504 [2019-09-03 21:03:10,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1189 GetRequests, 815 SyntacticMatches, 124 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26659 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=14174, Invalid=49078, Unknown=0, NotChecked=0, Total=63252 [2019-09-03 21:03:10,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-03 21:03:10,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2019-09-03 21:03:10,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-09-03 21:03:10,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 505 transitions. [2019-09-03 21:03:10,051 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 505 transitions. Word has length 500 [2019-09-03 21:03:10,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:03:10,051 INFO L475 AbstractCegarLoop]: Abstraction has 504 states and 505 transitions. [2019-09-03 21:03:10,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 189 states. [2019-09-03 21:03:10,051 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 505 transitions. [2019-09-03 21:03:10,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2019-09-03 21:03:10,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:03:10,054 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:03:10,054 INFO L418 AbstractCegarLoop]: === Iteration 124 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:03:10,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:03:10,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1840606889, now seen corresponding path program 122 times [2019-09-03 21:03:10,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:03:10,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:10,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:03:10,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:10,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:03:10,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:11,678 INFO L134 CoverageAnalysis]: Checked inductivity of 15007 backedges. 2075 proven. 5612 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2019-09-03 21:03:11,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:11,678 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:03:11,679 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:03:11,679 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:03:11,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:11,679 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 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:03:11,690 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:03:11,690 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:03:12,018 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 62 check-sat command(s) [2019-09-03 21:03:12,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:03:12,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 1195 conjuncts, 130 conjunts are in the unsatisfiable core [2019-09-03 21:03:12,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:03:12,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:12,202 INFO L134 CoverageAnalysis]: Checked inductivity of 15007 backedges. 2075 proven. 5612 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2019-09-03 21:03:12,202 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:03:15,059 INFO L134 CoverageAnalysis]: Checked inductivity of 15007 backedges. 2075 proven. 5612 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2019-09-03 21:03:15,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:03:15,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 69 [2019-09-03 21:03:15,063 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:03:15,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-03 21:03:15,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-03 21:03:15,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2090, Invalid=2602, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 21:03:15,065 INFO L87 Difference]: Start difference. First operand 504 states and 505 transitions. Second operand 69 states. [2019-09-03 21:03:15,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:03:15,902 INFO L93 Difference]: Finished difference Result 515 states and 517 transitions. [2019-09-03 21:03:15,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-03 21:03:15,903 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 501 [2019-09-03 21:03:15,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:03:15,904 INFO L225 Difference]: With dead ends: 515 [2019-09-03 21:03:15,904 INFO L226 Difference]: Without dead ends: 515 [2019-09-03 21:03:15,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1130 GetRequests, 938 SyntacticMatches, 124 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4155 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2096, Invalid=2734, Unknown=0, NotChecked=0, Total=4830 [2019-09-03 21:03:15,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-09-03 21:03:15,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 511. [2019-09-03 21:03:15,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2019-09-03 21:03:15,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 512 transitions. [2019-09-03 21:03:15,908 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 512 transitions. Word has length 501 [2019-09-03 21:03:15,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:03:15,909 INFO L475 AbstractCegarLoop]: Abstraction has 511 states and 512 transitions. [2019-09-03 21:03:15,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-03 21:03:15,909 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 512 transitions. [2019-09-03 21:03:15,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2019-09-03 21:03:15,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:03:15,911 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 63, 62, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:03:15,911 INFO L418 AbstractCegarLoop]: === Iteration 125 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:03:15,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:03:15,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1068710585, now seen corresponding path program 123 times [2019-09-03 21:03:15,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:03:15,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:15,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:03:15,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:15,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:03:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:20,749 INFO L134 CoverageAnalysis]: Checked inductivity of 15438 backedges. 5921 proven. 1953 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2019-09-03 21:03:20,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:20,750 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:03:20,750 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:03:20,750 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:03:20,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:20,750 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 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:03:20,760 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:03:20,760 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:03:20,929 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:03:20,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:03:20,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 1209 conjuncts, 128 conjunts are in the unsatisfiable core [2019-09-03 21:03:20,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:03:26,760 INFO L134 CoverageAnalysis]: Checked inductivity of 15438 backedges. 5921 proven. 1953 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2019-09-03 21:03:26,760 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:03:31,336 INFO L134 CoverageAnalysis]: Checked inductivity of 15438 backedges. 5921 proven. 1953 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2019-09-03 21:03:31,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:03:31,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129, 129, 129] total 192 [2019-09-03 21:03:31,341 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:03:31,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 192 states [2019-09-03 21:03:31,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2019-09-03 21:03:31,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8319, Invalid=28353, Unknown=0, NotChecked=0, Total=36672 [2019-09-03 21:03:31,345 INFO L87 Difference]: Start difference. First operand 511 states and 512 transitions. Second operand 192 states. [2019-09-03 21:03:39,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:03:39,187 INFO L93 Difference]: Finished difference Result 700 states and 763 transitions. [2019-09-03 21:03:39,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2019-09-03 21:03:39,187 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 508 [2019-09-03 21:03:39,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:03:39,189 INFO L225 Difference]: With dead ends: 700 [2019-09-03 21:03:39,189 INFO L226 Difference]: Without dead ends: 512 [2019-09-03 21:03:39,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1208 GetRequests, 828 SyntacticMatches, 126 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27530 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=14623, Invalid=50657, Unknown=0, NotChecked=0, Total=65280 [2019-09-03 21:03:39,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-09-03 21:03:39,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512. [2019-09-03 21:03:39,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-09-03 21:03:39,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 513 transitions. [2019-09-03 21:03:39,198 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 513 transitions. Word has length 508 [2019-09-03 21:03:39,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:03:39,199 INFO L475 AbstractCegarLoop]: Abstraction has 512 states and 513 transitions. [2019-09-03 21:03:39,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 192 states. [2019-09-03 21:03:39,199 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 513 transitions. [2019-09-03 21:03:39,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2019-09-03 21:03:39,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:03:39,201 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 63, 63, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:03:39,201 INFO L418 AbstractCegarLoop]: === Iteration 126 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:03:39,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:03:39,202 INFO L82 PathProgramCache]: Analyzing trace with hash -211064728, now seen corresponding path program 124 times [2019-09-03 21:03:39,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:03:39,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:39,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:03:39,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:39,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:03:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:40,901 INFO L134 CoverageAnalysis]: Checked inductivity of 15501 backedges. 2140 proven. 5797 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2019-09-03 21:03:40,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:40,901 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:03:40,901 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:03:40,901 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:03:40,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:40,902 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 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:03:40,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:03:40,913 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:03:41,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:41,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 1214 conjuncts, 132 conjunts are in the unsatisfiable core [2019-09-03 21:03:41,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:03:41,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:41,293 INFO L134 CoverageAnalysis]: Checked inductivity of 15501 backedges. 2140 proven. 5797 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2019-09-03 21:03:41,293 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:03:44,418 INFO L134 CoverageAnalysis]: Checked inductivity of 15501 backedges. 2140 proven. 5797 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2019-09-03 21:03:44,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:03:44,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 70 [2019-09-03 21:03:44,422 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:03:44,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-03 21:03:44,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-03 21:03:44,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2155, Invalid=2675, Unknown=0, NotChecked=0, Total=4830 [2019-09-03 21:03:44,424 INFO L87 Difference]: Start difference. First operand 512 states and 513 transitions. Second operand 70 states. [2019-09-03 21:03:45,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:03:45,261 INFO L93 Difference]: Finished difference Result 523 states and 525 transitions. [2019-09-03 21:03:45,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-03 21:03:45,261 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 509 [2019-09-03 21:03:45,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:03:45,263 INFO L225 Difference]: With dead ends: 523 [2019-09-03 21:03:45,264 INFO L226 Difference]: Without dead ends: 523 [2019-09-03 21:03:45,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1148 GetRequests, 953 SyntacticMatches, 126 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4285 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2161, Invalid=2809, Unknown=0, NotChecked=0, Total=4970 [2019-09-03 21:03:45,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-09-03 21:03:45,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 519. [2019-09-03 21:03:45,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2019-09-03 21:03:45,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 520 transitions. [2019-09-03 21:03:45,271 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 520 transitions. Word has length 509 [2019-09-03 21:03:45,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:03:45,271 INFO L475 AbstractCegarLoop]: Abstraction has 519 states and 520 transitions. [2019-09-03 21:03:45,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-03 21:03:45,272 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 520 transitions. [2019-09-03 21:03:45,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2019-09-03 21:03:45,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:03:45,275 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 64, 63, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:03:45,275 INFO L418 AbstractCegarLoop]: === Iteration 127 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:03:45,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:03:45,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1510186010, now seen corresponding path program 125 times [2019-09-03 21:03:45,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:03:45,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:45,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:03:45,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:45,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:03:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:50,420 INFO L134 CoverageAnalysis]: Checked inductivity of 15939 backedges. 6111 proven. 2016 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2019-09-03 21:03:50,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:50,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:03:50,420 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:03:50,420 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:03:50,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:50,421 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 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:03:50,430 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:03:50,430 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:03:50,762 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2019-09-03 21:03:50,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:03:50,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 1228 conjuncts, 130 conjunts are in the unsatisfiable core [2019-09-03 21:03:50,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:03:56,678 INFO L134 CoverageAnalysis]: Checked inductivity of 15939 backedges. 6111 proven. 2016 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2019-09-03 21:03:56,678 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:01,499 INFO L134 CoverageAnalysis]: Checked inductivity of 15939 backedges. 6111 proven. 2016 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2019-09-03 21:04:01,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:01,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131, 131, 131] total 195 [2019-09-03 21:04:01,504 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:01,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 195 states [2019-09-03 21:04:01,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 195 interpolants. [2019-09-03 21:04:01,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8579, Invalid=29251, Unknown=0, NotChecked=0, Total=37830 [2019-09-03 21:04:01,507 INFO L87 Difference]: Start difference. First operand 519 states and 520 transitions. Second operand 195 states. [2019-09-03 21:04:09,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:09,280 INFO L93 Difference]: Finished difference Result 711 states and 775 transitions. [2019-09-03 21:04:09,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-09-03 21:04:09,280 INFO L78 Accepts]: Start accepts. Automaton has 195 states. Word has length 516 [2019-09-03 21:04:09,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:09,282 INFO L225 Difference]: With dead ends: 711 [2019-09-03 21:04:09,282 INFO L226 Difference]: Without dead ends: 520 [2019-09-03 21:04:09,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1227 GetRequests, 841 SyntacticMatches, 128 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28415 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=15079, Invalid=52261, Unknown=0, NotChecked=0, Total=67340 [2019-09-03 21:04:09,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2019-09-03 21:04:09,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2019-09-03 21:04:09,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2019-09-03 21:04:09,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 521 transitions. [2019-09-03 21:04:09,294 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 521 transitions. Word has length 516 [2019-09-03 21:04:09,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:09,295 INFO L475 AbstractCegarLoop]: Abstraction has 520 states and 521 transitions. [2019-09-03 21:04:09,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 195 states. [2019-09-03 21:04:09,295 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 521 transitions. [2019-09-03 21:04:09,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2019-09-03 21:04:09,298 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:09,298 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 64, 64, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:09,298 INFO L418 AbstractCegarLoop]: === Iteration 128 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:09,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:09,299 INFO L82 PathProgramCache]: Analyzing trace with hash 939961033, now seen corresponding path program 126 times [2019-09-03 21:04:09,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:09,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:09,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:09,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:09,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:09,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:11,181 INFO L134 CoverageAnalysis]: Checked inductivity of 16003 backedges. 2206 proven. 5985 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2019-09-03 21:04:11,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:11,182 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:11,182 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:11,182 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:11,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:11,182 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 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:11,194 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:04:11,194 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:04:11,374 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:04:11,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:11,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 1233 conjuncts, 139 conjunts are in the unsatisfiable core [2019-09-03 21:04:11,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:11,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:04:11,651 INFO L134 CoverageAnalysis]: Checked inductivity of 16003 backedges. 2205 proven. 6172 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2019-09-03 21:04:11,652 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:13,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:04:13,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:04:13,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:04:14,731 INFO L134 CoverageAnalysis]: Checked inductivity of 16003 backedges. 2141 proven. 6236 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2019-09-03 21:04:14,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:14,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 71, 71] total 74 [2019-09-03 21:04:14,736 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:14,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-03 21:04:14,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-03 21:04:14,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2231, Invalid=3171, Unknown=0, NotChecked=0, Total=5402 [2019-09-03 21:04:14,738 INFO L87 Difference]: Start difference. First operand 520 states and 521 transitions. Second operand 72 states. [2019-09-03 21:04:15,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:15,614 INFO L93 Difference]: Finished difference Result 527 states and 528 transitions. [2019-09-03 21:04:15,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-03 21:04:15,614 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 517 [2019-09-03 21:04:15,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:15,616 INFO L225 Difference]: With dead ends: 527 [2019-09-03 21:04:15,616 INFO L226 Difference]: Without dead ends: 527 [2019-09-03 21:04:15,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1167 GetRequests, 964 SyntacticMatches, 129 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4680 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=2246, Invalid=3454, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 21:04:15,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-09-03 21:04:15,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2019-09-03 21:04:15,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-09-03 21:04:15,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 528 transitions. [2019-09-03 21:04:15,623 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 528 transitions. Word has length 517 [2019-09-03 21:04:15,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:15,624 INFO L475 AbstractCegarLoop]: Abstraction has 527 states and 528 transitions. [2019-09-03 21:04:15,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-03 21:04:15,624 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 528 transitions. [2019-09-03 21:04:15,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2019-09-03 21:04:15,627 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:15,627 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 65, 64, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:15,627 INFO L418 AbstractCegarLoop]: === Iteration 129 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:15,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:15,628 INFO L82 PathProgramCache]: Analyzing trace with hash 720116377, now seen corresponding path program 127 times [2019-09-03 21:04:15,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:15,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:15,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:15,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:15,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:15,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:20,906 INFO L134 CoverageAnalysis]: Checked inductivity of 16448 backedges. 6304 proven. 2080 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2019-09-03 21:04:20,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:20,906 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:20,906 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:20,906 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:20,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:20,907 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 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:20,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:20,924 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:04:21,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:21,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 1247 conjuncts, 132 conjunts are in the unsatisfiable core [2019-09-03 21:04:21,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:27,305 INFO L134 CoverageAnalysis]: Checked inductivity of 16448 backedges. 6304 proven. 2080 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2019-09-03 21:04:27,306 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:32,252 INFO L134 CoverageAnalysis]: Checked inductivity of 16448 backedges. 6304 proven. 2080 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2019-09-03 21:04:32,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:32,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133, 133, 133] total 198 [2019-09-03 21:04:32,256 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:32,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 198 states [2019-09-03 21:04:32,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2019-09-03 21:04:32,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8843, Invalid=30163, Unknown=0, NotChecked=0, Total=39006 [2019-09-03 21:04:32,260 INFO L87 Difference]: Start difference. First operand 527 states and 528 transitions. Second operand 198 states. [2019-09-03 21:04:40,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:40,364 INFO L93 Difference]: Finished difference Result 722 states and 787 transitions. [2019-09-03 21:04:40,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2019-09-03 21:04:40,364 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 524 [2019-09-03 21:04:40,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:40,366 INFO L225 Difference]: With dead ends: 722 [2019-09-03 21:04:40,366 INFO L226 Difference]: Without dead ends: 528 [2019-09-03 21:04:40,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1246 GetRequests, 854 SyntacticMatches, 130 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29314 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=15542, Invalid=53890, Unknown=0, NotChecked=0, Total=69432 [2019-09-03 21:04:40,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-09-03 21:04:40,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2019-09-03 21:04:40,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-09-03 21:04:40,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 529 transitions. [2019-09-03 21:04:40,379 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 529 transitions. Word has length 524 [2019-09-03 21:04:40,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:40,379 INFO L475 AbstractCegarLoop]: Abstraction has 528 states and 529 transitions. [2019-09-03 21:04:40,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 198 states. [2019-09-03 21:04:40,379 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 529 transitions. [2019-09-03 21:04:40,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2019-09-03 21:04:40,382 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:40,382 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 65, 65, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:40,383 INFO L418 AbstractCegarLoop]: === Iteration 130 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:40,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:40,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1858669128, now seen corresponding path program 128 times [2019-09-03 21:04:40,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:40,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:40,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:40,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:40,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:42,239 INFO L134 CoverageAnalysis]: Checked inductivity of 16513 backedges. 2273 proven. 6176 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2019-09-03 21:04:42,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:42,239 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:42,240 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:42,240 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:42,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:42,240 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 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:42,255 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:04:42,255 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:04:42,607 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 65 check-sat command(s) [2019-09-03 21:04:42,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:42,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 1252 conjuncts, 141 conjunts are in the unsatisfiable core [2019-09-03 21:04:42,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:42,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:04:42,895 INFO L134 CoverageAnalysis]: Checked inductivity of 16513 backedges. 2272 proven. 6366 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2019-09-03 21:04:42,895 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:44,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:04:44,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:04:46,174 INFO L134 CoverageAnalysis]: Checked inductivity of 16513 backedges. 2207 proven. 6431 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2019-09-03 21:04:46,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:46,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 72, 72] total 75 [2019-09-03 21:04:46,179 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:46,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-03 21:04:46,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-03 21:04:46,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2298, Invalid=3252, Unknown=0, NotChecked=0, Total=5550 [2019-09-03 21:04:46,181 INFO L87 Difference]: Start difference. First operand 528 states and 529 transitions. Second operand 73 states. [2019-09-03 21:04:47,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:47,061 INFO L93 Difference]: Finished difference Result 535 states and 536 transitions. [2019-09-03 21:04:47,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-03 21:04:47,061 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 525 [2019-09-03 21:04:47,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:47,063 INFO L225 Difference]: With dead ends: 535 [2019-09-03 21:04:47,063 INFO L226 Difference]: Without dead ends: 535 [2019-09-03 21:04:47,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1185 GetRequests, 979 SyntacticMatches, 131 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4818 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=2313, Invalid=3539, Unknown=0, NotChecked=0, Total=5852 [2019-09-03 21:04:47,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-03 21:04:47,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2019-09-03 21:04:47,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2019-09-03 21:04:47,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 536 transitions. [2019-09-03 21:04:47,070 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 536 transitions. Word has length 525 [2019-09-03 21:04:47,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:47,071 INFO L475 AbstractCegarLoop]: Abstraction has 535 states and 536 transitions. [2019-09-03 21:04:47,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-03 21:04:47,071 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 536 transitions. [2019-09-03 21:04:47,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2019-09-03 21:04:47,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:47,074 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:47,074 INFO L418 AbstractCegarLoop]: === Iteration 131 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:47,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:47,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1313218106, now seen corresponding path program 129 times [2019-09-03 21:04:47,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:47,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:47,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:47,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:47,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:47,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat