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/recursive/EvenOdd01-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:51:29,016 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:51:29,019 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:51:29,032 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:51:29,033 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:51:29,034 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:51:29,035 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:51:29,037 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:51:29,039 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:51:29,039 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:51:29,040 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:51:29,042 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:51:29,042 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:51:29,043 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:51:29,044 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:51:29,045 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:51:29,046 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:51:29,047 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:51:29,048 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:51:29,050 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:51:29,052 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:51:29,053 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:51:29,054 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:51:29,055 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:51:29,057 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:51:29,057 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:51:29,057 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:51:29,058 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:51:29,059 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:51:29,060 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:51:29,060 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:51:29,061 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:51:29,061 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:51:29,062 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:51:29,063 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:51:29,064 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:51:29,064 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:51:29,065 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:51:29,065 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:51:29,066 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:51:29,066 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:51:29,067 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-10 02:51:29,083 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:51:29,084 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:51:29,084 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:51:29,084 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:51:29,085 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:51:29,085 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:51:29,085 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:51:29,085 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:51:29,086 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:51:29,086 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:51:29,086 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:51:29,087 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:51:29,087 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:51:29,087 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:51:29,087 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:51:29,087 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:51:29,088 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:51:29,088 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:51:29,088 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:51:29,088 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:51:29,088 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:51:29,089 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:51:29,089 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:51:29,089 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:51:29,089 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:51:29,089 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:51:29,090 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:51:29,090 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:51:29,090 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:51:29,090 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:51:29,122 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:51:29,134 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:51:29,138 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:51:29,139 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:51:29,140 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:51:29,140 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/EvenOdd01-1.c [2019-09-10 02:51:29,209 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd794e5c4/14a11d0012fa489fbb7492896d7bec60/FLAGbfe5c21fb [2019-09-10 02:51:29,685 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:51:29,686 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/EvenOdd01-1.c [2019-09-10 02:51:29,692 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd794e5c4/14a11d0012fa489fbb7492896d7bec60/FLAGbfe5c21fb [2019-09-10 02:51:30,085 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd794e5c4/14a11d0012fa489fbb7492896d7bec60 [2019-09-10 02:51:30,097 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:51:30,098 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:51:30,099 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:51:30,100 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:51:30,103 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:51:30,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:51:30" (1/1) ... [2019-09-10 02:51:30,107 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e8b0c6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:30, skipping insertion in model container [2019-09-10 02:51:30,108 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:51:30" (1/1) ... [2019-09-10 02:51:30,116 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:51:30,134 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:51:30,293 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:51:30,298 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:51:30,317 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:51:30,332 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:51:30,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:30 WrapperNode [2019-09-10 02:51:30,333 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:51:30,334 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:51:30,334 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:51:30,334 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:51:30,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:30" (1/1) ... [2019-09-10 02:51:30,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:30" (1/1) ... [2019-09-10 02:51:30,445 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:30" (1/1) ... [2019-09-10 02:51:30,445 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:30" (1/1) ... [2019-09-10 02:51:30,449 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:30" (1/1) ... [2019-09-10 02:51:30,450 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:30" (1/1) ... [2019-09-10 02:51:30,451 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:30" (1/1) ... [2019-09-10 02:51:30,453 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:51:30,453 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:51:30,454 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:51:30,454 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:51:30,455 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51: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-10 02:51:30,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:51:30,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:51:30,507 INFO L138 BoogieDeclarations]: Found implementation of procedure isOdd [2019-09-10 02:51:30,508 INFO L138 BoogieDeclarations]: Found implementation of procedure isEven [2019-09-10 02:51:30,508 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:51:30,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:51:30,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:51:30,508 INFO L130 BoogieDeclarations]: Found specification of procedure isOdd [2019-09-10 02:51:30,508 INFO L130 BoogieDeclarations]: Found specification of procedure isEven [2019-09-10 02:51:30,509 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:51:30,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:51:30,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:51:30,735 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:51:30,736 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 02:51:30,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:51:30 BoogieIcfgContainer [2019-09-10 02:51:30,737 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:51:30,739 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:51:30,739 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:51:30,743 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:51:30,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:51:30" (1/3) ... [2019-09-10 02:51:30,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@600f3d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:51:30, skipping insertion in model container [2019-09-10 02:51:30,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:30" (2/3) ... [2019-09-10 02:51:30,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@600f3d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:51:30, skipping insertion in model container [2019-09-10 02:51:30,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:51:30" (3/3) ... [2019-09-10 02:51:30,760 INFO L109 eAbstractionObserver]: Analyzing ICFG EvenOdd01-1.c [2019-09-10 02:51:30,781 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:51:30,794 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:51:30,809 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:51:30,842 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:51:30,842 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:51:30,842 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:51:30,842 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:51:30,842 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:51:30,843 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:51:30,843 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:51:30,843 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:51:30,855 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-09-10 02:51:30,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-10 02:51:30,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:30,866 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:30,868 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:30,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:30,872 INFO L82 PathProgramCache]: Analyzing trace with hash -2122072279, now seen corresponding path program 1 times [2019-09-10 02:51:30,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:30,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:30,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:30,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:30,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:31,209 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-10 02:51:31,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:51:31,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:51:31,212 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:51:31,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:51:31,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:51:31,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:51:31,231 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 7 states. [2019-09-10 02:51:31,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:31,409 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2019-09-10 02:51:31,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:51:31,411 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-09-10 02:51:31,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:31,422 INFO L225 Difference]: With dead ends: 35 [2019-09-10 02:51:31,422 INFO L226 Difference]: Without dead ends: 27 [2019-09-10 02:51:31,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:51:31,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-10 02:51:31,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-10 02:51:31,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-10 02:51:31,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-09-10 02:51:31,476 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 14 [2019-09-10 02:51:31,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:31,477 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-09-10 02:51:31,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:51:31,478 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-09-10 02:51:31,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-10 02:51:31,480 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:31,481 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:31,482 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:31,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:31,483 INFO L82 PathProgramCache]: Analyzing trace with hash -612070348, now seen corresponding path program 1 times [2019-09-10 02:51:31,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:31,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:31,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:31,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:31,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:31,678 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-10 02:51:31,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:51:31,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:51:31,679 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:51:31,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:51:31,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:51:31,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:51:31,681 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 7 states. [2019-09-10 02:51:31,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:31,778 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-09-10 02:51:31,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:51:31,779 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-09-10 02:51:31,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:31,780 INFO L225 Difference]: With dead ends: 31 [2019-09-10 02:51:31,781 INFO L226 Difference]: Without dead ends: 29 [2019-09-10 02:51:31,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:51:31,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-10 02:51:31,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-09-10 02:51:31,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-10 02:51:31,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-09-10 02:51:31,788 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 15 [2019-09-10 02:51:31,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:31,789 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-09-10 02:51:31,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:51:31,789 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-09-10 02:51:31,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-10 02:51:31,790 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:31,791 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:31,791 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:31,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:31,791 INFO L82 PathProgramCache]: Analyzing trace with hash -592576498, now seen corresponding path program 1 times [2019-09-10 02:51:31,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:31,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:31,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:31,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:31,793 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:31,955 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-10 02:51:31,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:51:31,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:51:31,956 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:51:31,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:51:31,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:51:31,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:51:31,959 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 9 states. [2019-09-10 02:51:32,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:32,149 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-09-10 02:51:32,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:51:32,150 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-09-10 02:51:32,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:32,151 INFO L225 Difference]: With dead ends: 35 [2019-09-10 02:51:32,151 INFO L226 Difference]: Without dead ends: 29 [2019-09-10 02:51:32,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:51:32,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-10 02:51:32,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-09-10 02:51:32,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-10 02:51:32,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-09-10 02:51:32,164 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 21 [2019-09-10 02:51:32,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:32,166 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-09-10 02:51:32,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:51:32,166 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-09-10 02:51:32,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 02:51:32,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:32,168 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:32,169 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:32,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:32,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1306118367, now seen corresponding path program 1 times [2019-09-10 02:51:32,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:32,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:32,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:32,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:32,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:32,568 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-10 02:51:32,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:51:32,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 02:51:32,568 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:51:32,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:51:32,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:51:32,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:51:32,570 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 12 states. [2019-09-10 02:51:32,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:32,822 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2019-09-10 02:51:32,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 02:51:32,822 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-09-10 02:51:32,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:32,824 INFO L225 Difference]: With dead ends: 36 [2019-09-10 02:51:32,824 INFO L226 Difference]: Without dead ends: 34 [2019-09-10 02:51:32,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:51:32,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-10 02:51:32,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2019-09-10 02:51:32,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-10 02:51:32,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-09-10 02:51:32,830 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 22 [2019-09-10 02:51:32,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:32,831 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-09-10 02:51:32,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:51:32,831 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-09-10 02:51:32,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-10 02:51:32,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:32,834 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:32,834 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:32,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:32,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1571291849, now seen corresponding path program 1 times [2019-09-10 02:51:32,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:32,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:32,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:32,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:32,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:32,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:33,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 02:51:33,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:51:33,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 02:51:33,060 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:51:33,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:51:33,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:51:33,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:51:33,061 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 12 states. [2019-09-10 02:51:33,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:33,295 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-09-10 02:51:33,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:51:33,297 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-09-10 02:51:33,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:33,298 INFO L225 Difference]: With dead ends: 40 [2019-09-10 02:51:33,299 INFO L226 Difference]: Without dead ends: 32 [2019-09-10 02:51:33,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:51:33,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-10 02:51:33,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-09-10 02:51:33,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-10 02:51:33,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-09-10 02:51:33,306 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 28 [2019-09-10 02:51:33,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:33,306 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-09-10 02:51:33,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:51:33,306 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-09-10 02:51:33,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-10 02:51:33,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:33,308 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:33,308 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:33,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:33,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1610221656, now seen corresponding path program 1 times [2019-09-10 02:51:33,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:33,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:33,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:33,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:33,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:33,546 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:51:33,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:33,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:33,548 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2019-09-10 02:51:33,550 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [9], [11], [12], [13], [17], [20], [21], [23], [24], [28], [32], [34], [38], [40], [43], [44], [45], [46], [47], [48], [49], [51], [52] [2019-09-10 02:51:33,587 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:51:33,588 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:51:33,680 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 02:51:33,721 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:51:33,726 INFO L272 AbstractInterpreter]: Visited 26 different actions 51 times. Merged at 2 different actions 4 times. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 7. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 3 fixpoints after 3 different actions. Largest state had 5 variables. [2019-09-10 02:51:33,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:33,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:51:33,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:33,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:51:33,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:33,742 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:51:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:33,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-10 02:51:33,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:51:33,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:33,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:33,966 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:51:33,966 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:51:33,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:34,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:34,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:34,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:34,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:34,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:34,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:34,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:51:34,500 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 02:51:34,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:51:34,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 19 [2019-09-10 02:51:34,505 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:51:34,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 02:51:34,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 02:51:34,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-09-10 02:51:34,506 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 13 states. [2019-09-10 02:51:34,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:34,977 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2019-09-10 02:51:34,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 02:51:34,977 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2019-09-10 02:51:34,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:34,978 INFO L225 Difference]: With dead ends: 40 [2019-09-10 02:51:34,978 INFO L226 Difference]: Without dead ends: 38 [2019-09-10 02:51:34,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 12 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2019-09-10 02:51:34,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-10 02:51:34,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2019-09-10 02:51:34,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-10 02:51:34,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-09-10 02:51:34,984 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2019-09-10 02:51:34,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:34,985 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-09-10 02:51:34,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 02:51:34,985 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-09-10 02:51:34,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-10 02:51:34,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:34,986 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:34,987 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:34,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:34,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1417612799, now seen corresponding path program 1 times [2019-09-10 02:51:34,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:34,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:34,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:34,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:34,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:35,221 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:51:35,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:35,222 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:35,222 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2019-09-10 02:51:35,222 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [8], [9], [11], [12], [13], [17], [21], [23], [24], [28], [32], [34], [38], [40], [43], [44], [45], [46], [47], [48], [49], [51], [52] [2019-09-10 02:51:35,224 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:51:35,224 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:51:35,242 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 02:51:35,257 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:51:35,257 INFO L272 AbstractInterpreter]: Visited 26 different actions 45 times. Merged at 2 different actions 2 times. Never widened. Performed 45 root evaluator evaluations with a maximum evaluation depth of 7. Performed 45 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 2 fixpoints after 2 different actions. Largest state had 5 variables. [2019-09-10 02:51:35,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:35,258 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:51:35,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:35,258 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-10 02:51:35,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:35,298 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:51:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:35,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-10 02:51:35,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:51:35,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:35,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:35,665 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:51:35,665 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:51:35,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:36,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:36,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:36,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:36,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:36,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:36,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:51:36,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:36,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:36,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:36,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:51:36,503 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 02:51:36,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:51:36,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 31 [2019-09-10 02:51:36,508 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:51:36,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 02:51:36,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 02:51:36,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=831, Unknown=0, NotChecked=0, Total=930 [2019-09-10 02:51:36,510 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 23 states. [2019-09-10 02:51:36,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:36,932 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2019-09-10 02:51:36,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:51:36,932 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 36 [2019-09-10 02:51:36,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:36,934 INFO L225 Difference]: With dead ends: 46 [2019-09-10 02:51:36,934 INFO L226 Difference]: Without dead ends: 44 [2019-09-10 02:51:36,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 45 SyntacticMatches, 13 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=158, Invalid=1324, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 02:51:36,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-10 02:51:36,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2019-09-10 02:51:36,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-10 02:51:36,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-09-10 02:51:36,940 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 36 [2019-09-10 02:51:36,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:36,941 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-09-10 02:51:36,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 02:51:36,941 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-09-10 02:51:36,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-10 02:51:36,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:36,942 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:36,943 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:36,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:36,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1668529660, now seen corresponding path program 2 times [2019-09-10 02:51:36,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:36,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:36,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:36,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:36,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:37,212 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-10 02:51:37,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:37,213 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:37,213 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:51:37,213 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:51:37,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:37,214 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-10 02:51:37,233 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:51:37,233 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:51:37,253 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-10 02:51:37,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:51:37,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-10 02:51:37,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:51:37,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:37,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:37,438 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-10 02:51:37,439 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:51:37,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:37,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:37,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:37,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:37,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:38,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:38,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:51:38,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:51:38,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:38,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:38,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:51:38,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:38,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:38,403 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:51:38,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:51:38,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 18] total 25 [2019-09-10 02:51:38,409 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:51:38,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 02:51:38,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 02:51:38,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2019-09-10 02:51:38,410 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 17 states. [2019-09-10 02:51:38,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:38,875 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2019-09-10 02:51:38,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 02:51:38,876 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 43 [2019-09-10 02:51:38,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:38,877 INFO L225 Difference]: With dead ends: 52 [2019-09-10 02:51:38,877 INFO L226 Difference]: Without dead ends: 50 [2019-09-10 02:51:38,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 63 SyntacticMatches, 18 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=141, Invalid=1049, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 02:51:38,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-10 02:51:38,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 39. [2019-09-10 02:51:38,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-10 02:51:38,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-09-10 02:51:38,884 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 43 [2019-09-10 02:51:38,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:38,885 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-09-10 02:51:38,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 02:51:38,885 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-09-10 02:51:38,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-10 02:51:38,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:38,886 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:38,886 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:38,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:38,887 INFO L82 PathProgramCache]: Analyzing trace with hash -150927713, now seen corresponding path program 2 times [2019-09-10 02:51:38,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:38,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:38,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:51:38,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:38,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:39,200 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 02:51:39,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:39,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:39,201 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:51:39,201 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:51:39,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:39,201 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:51:39,214 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:51:39,214 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:51:39,240 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-10 02:51:39,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:51:39,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-10 02:51:39,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:51:39,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:39,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:39,712 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 02:51:39,713 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:51:39,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:40,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:40,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:40,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:40,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:40,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:40,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:51:40,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:40,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:40,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:40,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:51:40,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:40,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:51:41,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:41,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:51:41,079 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 02:51:41,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:51:41,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 21] total 41 [2019-09-10 02:51:41,082 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:51:41,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 02:51:41,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 02:51:41,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1501, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 02:51:41,085 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 31 states. [2019-09-10 02:51:41,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:41,843 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2019-09-10 02:51:41,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 02:51:41,843 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 50 [2019-09-10 02:51:41,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:41,845 INFO L225 Difference]: With dead ends: 58 [2019-09-10 02:51:41,845 INFO L226 Difference]: Without dead ends: 56 [2019-09-10 02:51:41,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 63 SyntacticMatches, 19 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=239, Invalid=2517, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 02:51:41,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-10 02:51:41,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2019-09-10 02:51:41,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-10 02:51:41,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-09-10 02:51:41,852 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 50 [2019-09-10 02:51:41,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:41,852 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-09-10 02:51:41,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 02:51:41,853 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-09-10 02:51:41,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 02:51:41,853 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:41,854 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:41,854 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:41,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:41,854 INFO L82 PathProgramCache]: Analyzing trace with hash -308892384, now seen corresponding path program 3 times [2019-09-10 02:51:41,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:41,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:41,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:51:41,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:41,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:42,232 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-10 02:51:42,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:42,232 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:42,233 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:51:42,233 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:51:42,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:42,233 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-10 02:51:42,244 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:51:42,244 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:51:42,278 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:51:42,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:51:42,280 WARN L254 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-10 02:51:42,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:51:42,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:42,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:42,424 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-10 02:51:42,424 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:51:42,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:43,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:43,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:43,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:43,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:43,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:43,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:51:43,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:43,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:43,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:51:43,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:43,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:43,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:51:43,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:43,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:43,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:51:43,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:43,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:43,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:51:43,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:43,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:43,970 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 02:51:43,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:51:43,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 24] total 31 [2019-09-10 02:51:43,975 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:51:43,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 02:51:43,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 02:51:43,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=836, Unknown=0, NotChecked=0, Total=930 [2019-09-10 02:51:43,977 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 21 states. [2019-09-10 02:51:44,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:44,731 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2019-09-10 02:51:44,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 02:51:44,731 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 57 [2019-09-10 02:51:44,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:44,733 INFO L225 Difference]: With dead ends: 64 [2019-09-10 02:51:44,733 INFO L226 Difference]: Without dead ends: 62 [2019-09-10 02:51:44,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 85 SyntacticMatches, 24 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=204, Invalid=1776, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 02:51:44,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-10 02:51:44,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 45. [2019-09-10 02:51:44,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-10 02:51:44,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-09-10 02:51:44,741 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 57 [2019-09-10 02:51:44,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:44,741 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-09-10 02:51:44,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 02:51:44,741 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-09-10 02:51:44,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 02:51:44,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:44,742 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:44,743 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:44,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:44,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1668346559, now seen corresponding path program 3 times [2019-09-10 02:51:44,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:44,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:44,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:51:44,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:44,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:45,301 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-10 02:51:45,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:45,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:45,303 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:51:45,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:51:45,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:45,303 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-10 02:51:45,328 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:51:45,328 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-10 02:51:45,361 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:51:45,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:51:45,364 WARN L254 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-10 02:51:45,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:51:45,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:45,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:46,053 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-10 02:51:46,054 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:51:46,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:46,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:46,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:46,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:46,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:46,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:47,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:47,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:51:47,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:47,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:51:47,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:51:47,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:47,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:47,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:51:47,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:47,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:47,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:47,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:51:48,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:48,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:51:48,203 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 02:51:48,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:51:48,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 27] total 51 [2019-09-10 02:51:48,217 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:51:48,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-10 02:51:48,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-10 02:51:48,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2371, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 02:51:48,222 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 39 states. [2019-09-10 02:51:49,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:49,295 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2019-09-10 02:51:49,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 02:51:49,295 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 64 [2019-09-10 02:51:49,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:49,297 INFO L225 Difference]: With dead ends: 70 [2019-09-10 02:51:49,297 INFO L226 Difference]: Without dead ends: 68 [2019-09-10 02:51:49,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 81 SyntacticMatches, 25 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=328, Invalid=4094, Unknown=0, NotChecked=0, Total=4422 [2019-09-10 02:51:49,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-10 02:51:49,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 48. [2019-09-10 02:51:49,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-10 02:51:49,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2019-09-10 02:51:49,306 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 64 [2019-09-10 02:51:49,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:49,307 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2019-09-10 02:51:49,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-10 02:51:49,307 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2019-09-10 02:51:49,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 02:51:49,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:49,308 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:49,308 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:49,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:49,309 INFO L82 PathProgramCache]: Analyzing trace with hash 353359300, now seen corresponding path program 4 times [2019-09-10 02:51:49,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:49,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:49,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:51:49,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:49,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:49,803 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-10 02:51:49,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:49,803 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:49,803 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:51:49,803 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:51:49,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:49,804 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-10 02:51:49,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:49,814 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:51:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:49,842 WARN L254 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-10 02:51:49,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:51:49,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:49,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:50,020 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-10 02:51:50,020 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:51:50,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:50,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:50,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:50,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:50,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:51,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:51:51,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:51,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:51,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:51,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:51:51,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:51,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:51:51,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:51:51,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:51,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:52,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:51:52,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:52,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:52,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:52,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:51:52,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:52,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:51:52,434 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 16 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-10 02:51:52,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:51:52,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 30] total 37 [2019-09-10 02:51:52,448 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:51:52,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 02:51:52,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 02:51:52,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1216, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 02:51:52,451 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 25 states. [2019-09-10 02:51:53,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:53,480 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2019-09-10 02:51:53,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 02:51:53,480 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 71 [2019-09-10 02:51:53,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:53,481 INFO L225 Difference]: With dead ends: 76 [2019-09-10 02:51:53,482 INFO L226 Difference]: Without dead ends: 74 [2019-09-10 02:51:53,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 107 SyntacticMatches, 30 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=275, Invalid=2695, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 02:51:53,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-10 02:51:53,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 51. [2019-09-10 02:51:53,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-10 02:51:53,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2019-09-10 02:51:53,498 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 71 [2019-09-10 02:51:53,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:53,499 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2019-09-10 02:51:53,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 02:51:53,499 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2019-09-10 02:51:53,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 02:51:53,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:53,501 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:53,501 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:53,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:53,502 INFO L82 PathProgramCache]: Analyzing trace with hash -165146017, now seen corresponding path program 4 times [2019-09-10 02:51:53,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:53,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:53,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:53,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:53,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:53,984 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-09-10 02:51:53,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:53,984 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:53,985 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:51:53,985 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:51:53,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:53,985 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-10 02:51:53,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:53,998 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:51:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:54,022 WARN L254 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-10 02:51:54,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:51:54,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:54,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:54,944 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-09-10 02:51:54,945 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:51:54,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:55,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:55,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:55,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:55,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:56,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:51:56,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:56,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:56,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:51:56,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:56,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:56,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:56,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:51:57,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:51:57,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:57,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:57,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:57,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:51:57,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:51:57,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:57,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:57,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:51:57,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:57,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:57,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:57,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:51:57,933 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 02:51:57,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:51:57,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 33] total 61 [2019-09-10 02:51:57,948 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:51:57,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-10 02:51:57,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-10 02:51:57,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=3441, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 02:51:57,951 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 47 states. [2019-09-10 02:51:59,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:59,433 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2019-09-10 02:51:59,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 02:51:59,433 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 78 [2019-09-10 02:51:59,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:59,434 INFO L225 Difference]: With dead ends: 82 [2019-09-10 02:51:59,434 INFO L226 Difference]: Without dead ends: 80 [2019-09-10 02:51:59,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 99 SyntacticMatches, 31 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1543 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=425, Invalid=6055, Unknown=0, NotChecked=0, Total=6480 [2019-09-10 02:51:59,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-10 02:51:59,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 54. [2019-09-10 02:51:59,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-10 02:51:59,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2019-09-10 02:51:59,443 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 78 [2019-09-10 02:51:59,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:59,443 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2019-09-10 02:51:59,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-10 02:51:59,444 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2019-09-10 02:51:59,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 02:51:59,445 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:59,445 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:59,446 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:59,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:59,446 INFO L82 PathProgramCache]: Analyzing trace with hash 462698472, now seen corresponding path program 5 times [2019-09-10 02:51:59,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:59,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:59,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:59,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:59,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:52:00,074 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-10 02:52:00,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:52:00,075 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:52:00,075 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:52:00,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:52:00,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:52:00,076 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-10 02:52:00,105 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:52:00,106 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:52:00,145 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-10 02:52:00,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:52:00,150 WARN L254 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-10 02:52:00,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:52:00,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:00,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:00,383 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-10 02:52:00,383 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:52:00,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:01,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:01,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:01,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:01,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:01,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:01,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:01,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:02,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:02,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:02,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:02,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:02,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:02,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:02,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:02,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:02,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:03,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:03,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:03,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:03,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:03,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:03,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:03,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:03,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:03,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:03,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:03,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:03,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:03,600 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-10 02:52:03,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:52:03,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 36] total 43 [2019-09-10 02:52:03,603 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:52:03,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-10 02:52:03,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-10 02:52:03,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1668, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 02:52:03,606 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 29 states. [2019-09-10 02:52:04,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:52:04,934 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2019-09-10 02:52:04,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 02:52:04,934 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 85 [2019-09-10 02:52:04,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:52:04,935 INFO L225 Difference]: With dead ends: 88 [2019-09-10 02:52:04,935 INFO L226 Difference]: Without dead ends: 86 [2019-09-10 02:52:04,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 129 SyntacticMatches, 36 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=354, Invalid=3806, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 02:52:04,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-10 02:52:04,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 57. [2019-09-10 02:52:04,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-10 02:52:04,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2019-09-10 02:52:04,943 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 85 [2019-09-10 02:52:04,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:52:04,944 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2019-09-10 02:52:04,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-10 02:52:04,944 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2019-09-10 02:52:04,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 02:52:04,945 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:52:04,946 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:52:04,946 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:52:04,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:52:04,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1580751489, now seen corresponding path program 5 times [2019-09-10 02:52:04,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:52:04,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:52:04,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:52:04,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:52:04,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:52:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:52:05,545 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-09-10 02:52:05,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:52:05,546 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:52:05,546 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:52:05,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:52:05,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:52:05,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 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-10 02:52:05,560 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:52:05,560 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:52:05,589 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-10 02:52:05,589 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:52:05,593 WARN L254 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 104 conjunts are in the unsatisfiable core [2019-09-10 02:52:05,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:52:06,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:06,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:06,680 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-09-10 02:52:06,680 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:52:06,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:07,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:07,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:07,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:07,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:07,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:08,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:52:08,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:08,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:08,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:52:08,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:08,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:09,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:52:09,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:09,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:09,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:09,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:52:09,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:09,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:52:09,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:09,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:52:10,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:52:10,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:10,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:10,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:10,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:52:10,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:52:10,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:10,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:10,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:52:10,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:10,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:10,725 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 170 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-10 02:52:10,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:52:10,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30, 39] total 71 [2019-09-10 02:52:10,734 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:52:10,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-10 02:52:10,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-10 02:52:10,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=4711, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 02:52:10,736 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 55 states. [2019-09-10 02:52:12,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:52:12,607 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2019-09-10 02:52:12,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 02:52:12,608 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 92 [2019-09-10 02:52:12,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:52:12,609 INFO L225 Difference]: With dead ends: 94 [2019-09-10 02:52:12,609 INFO L226 Difference]: Without dead ends: 92 [2019-09-10 02:52:12,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 117 SyntacticMatches, 37 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2163 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=530, Invalid=8400, Unknown=0, NotChecked=0, Total=8930 [2019-09-10 02:52:12,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-10 02:52:12,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 60. [2019-09-10 02:52:12,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-10 02:52:12,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-09-10 02:52:12,617 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 92 [2019-09-10 02:52:12,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:52:12,618 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-09-10 02:52:12,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-10 02:52:12,618 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-09-10 02:52:12,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 02:52:12,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:52:12,619 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:52:12,620 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:52:12,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:52:12,620 INFO L82 PathProgramCache]: Analyzing trace with hash 165729164, now seen corresponding path program 6 times [2019-09-10 02:52:12,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:52:12,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:52:12,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:52:12,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:52:12,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:52:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:52:13,352 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-09-10 02:52:13,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:52:13,352 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:52:13,352 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:52:13,352 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:52:13,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:52:13,353 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-10 02:52:13,363 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:52:13,363 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:52:13,396 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:52:13,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:52:13,399 WARN L254 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 112 conjunts are in the unsatisfiable core [2019-09-10 02:52:13,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:52:13,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:13,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:13,597 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-09-10 02:52:13,597 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:52:13,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:14,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:14,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:14,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:14,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:15,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:15,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:15,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:15,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:15,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:15,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:15,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:15,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:16,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:16,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:16,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:16,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:16,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:16,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:16,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:17,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:17,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:17,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:17,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:17,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:17,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:17,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:17,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:17,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:17,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:17,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:17,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:17,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:17,811 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:52:17,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:52:17,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 42] total 49 [2019-09-10 02:52:17,817 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:52:17,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-10 02:52:17,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-10 02:52:17,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2192, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 02:52:17,820 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 33 states. [2019-09-10 02:52:19,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:52:19,476 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2019-09-10 02:52:19,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 02:52:19,477 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 99 [2019-09-10 02:52:19,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:52:19,478 INFO L225 Difference]: With dead ends: 100 [2019-09-10 02:52:19,478 INFO L226 Difference]: Without dead ends: 98 [2019-09-10 02:52:19,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 151 SyntacticMatches, 42 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=441, Invalid=5109, Unknown=0, NotChecked=0, Total=5550 [2019-09-10 02:52:19,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-10 02:52:19,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 63. [2019-09-10 02:52:19,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-10 02:52:19,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-09-10 02:52:19,486 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 99 [2019-09-10 02:52:19,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:52:19,486 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-09-10 02:52:19,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-10 02:52:19,487 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-09-10 02:52:19,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 02:52:19,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:52:19,488 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:52:19,488 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:52:19,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:52:19,489 INFO L82 PathProgramCache]: Analyzing trace with hash -684135393, now seen corresponding path program 6 times [2019-09-10 02:52:19,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:52:19,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:52:19,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:52:19,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:52:19,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:52:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:52:20,193 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-09-10 02:52:20,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:52:20,194 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:52:20,194 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:52:20,194 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:52:20,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:52:20,194 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-10 02:52:20,205 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:52:20,205 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:52:20,234 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:52:20,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:52:20,238 WARN L254 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 120 conjunts are in the unsatisfiable core [2019-09-10 02:52:20,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:52:21,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:21,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:21,625 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-09-10 02:52:21,625 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:52:21,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:23,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:23,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:23,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:23,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:23,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:23,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:23,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:52:24,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:24,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:52:24,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:52:24,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:24,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:25,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:25,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:52:25,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:52:25,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:25,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:25,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:25,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:52:26,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:52:26,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:26,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:26,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:52:26,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:26,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:26,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:52:26,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:26,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:26,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:52:26,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:26,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:27,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:27,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:52:27,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:52:27,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:27,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:27,310 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-10 02:52:27,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:52:27,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 34, 45] total 81 [2019-09-10 02:52:27,319 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:52:27,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-10 02:52:27,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-10 02:52:27,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=6181, Unknown=0, NotChecked=0, Total=6480 [2019-09-10 02:52:27,321 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 63 states. [2019-09-10 02:52:29,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:52:29,876 INFO L93 Difference]: Finished difference Result 106 states and 108 transitions. [2019-09-10 02:52:29,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 02:52:29,877 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 106 [2019-09-10 02:52:29,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:52:29,878 INFO L225 Difference]: With dead ends: 106 [2019-09-10 02:52:29,878 INFO L226 Difference]: Without dead ends: 104 [2019-09-10 02:52:29,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 135 SyntacticMatches, 43 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2887 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=643, Invalid=11129, Unknown=0, NotChecked=0, Total=11772 [2019-09-10 02:52:29,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-10 02:52:29,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 66. [2019-09-10 02:52:29,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-10 02:52:29,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-09-10 02:52:29,885 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 106 [2019-09-10 02:52:29,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:52:29,886 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-09-10 02:52:29,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-10 02:52:29,886 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-09-10 02:52:29,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 02:52:29,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:52:29,887 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:52:29,887 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:52:29,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:52:29,887 INFO L82 PathProgramCache]: Analyzing trace with hash -876959568, now seen corresponding path program 7 times [2019-09-10 02:52:29,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:52:29,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:52:29,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:52:29,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:52:29,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:52:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:52:30,780 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2019-09-10 02:52:30,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:52:30,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:52:30,780 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:52:30,780 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:52:30,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:52:30,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:52:30,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:52:30,792 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:52:30,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:52:30,824 WARN L254 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 128 conjunts are in the unsatisfiable core [2019-09-10 02:52:30,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:52:30,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:30,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:31,034 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2019-09-10 02:52:31,034 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:52:31,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:32,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:32,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:32,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:32,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:32,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:32,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:32,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:32,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:33,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:33,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:33,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:33,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:34,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:34,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:34,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:34,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:34,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:34,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:34,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:34,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:34,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:35,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:35,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:35,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:35,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:35,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:35,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:35,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:35,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:35,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:35,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:36,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:36,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:36,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:36,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:36,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:36,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:36,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:36,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:36,350 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 0 proven. 280 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-10 02:52:36,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:52:36,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 48] total 55 [2019-09-10 02:52:36,353 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:52:36,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-10 02:52:36,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-10 02:52:36,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2788, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 02:52:36,354 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 37 states. [2019-09-10 02:52:38,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:52:38,454 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2019-09-10 02:52:38,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 02:52:38,455 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 113 [2019-09-10 02:52:38,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:52:38,457 INFO L225 Difference]: With dead ends: 112 [2019-09-10 02:52:38,457 INFO L226 Difference]: Without dead ends: 110 [2019-09-10 02:52:38,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 173 SyntacticMatches, 48 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 857 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=536, Invalid=6604, Unknown=0, NotChecked=0, Total=7140 [2019-09-10 02:52:38,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-10 02:52:38,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 69. [2019-09-10 02:52:38,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-10 02:52:38,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2019-09-10 02:52:38,464 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 113 [2019-09-10 02:52:38,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:52:38,464 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2019-09-10 02:52:38,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-10 02:52:38,464 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2019-09-10 02:52:38,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 02:52:38,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:52:38,465 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:52:38,466 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:52:38,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:52:38,466 INFO L82 PathProgramCache]: Analyzing trace with hash -307419585, now seen corresponding path program 7 times [2019-09-10 02:52:38,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:52:38,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:52:38,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:52:38,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:52:38,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:52:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:52:39,281 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2019-09-10 02:52:39,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:52:39,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:52:39,281 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:52:39,281 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:52:39,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:52:39,282 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-10 02:52:39,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:52:39,292 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:52:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:52:39,334 WARN L254 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 136 conjunts are in the unsatisfiable core [2019-09-10 02:52:39,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:52:40,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:40,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:40,962 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2019-09-10 02:52:40,962 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:52:41,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:42,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:42,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:42,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:42,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:43,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:52:43,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:43,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:43,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:43,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:52:44,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:52:44,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:44,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:44,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:44,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:52:45,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:45,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:52:45,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:45,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:52:45,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:52:45,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:45,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:46,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:52:46,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:46,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:46,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:52:46,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:46,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:46,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:46,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:52:46,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:52:46,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:46,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:47,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:52:47,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:47,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:47,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:52:47,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:47,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:47,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:52:47,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:47,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:47,548 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 322 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-10 02:52:47,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:52:47,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38, 51] total 91 [2019-09-10 02:52:47,551 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:52:47,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-10 02:52:47,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-10 02:52:47,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=7851, Unknown=0, NotChecked=0, Total=8190 [2019-09-10 02:52:47,553 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 71 states. [2019-09-10 02:52:50,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:52:50,499 INFO L93 Difference]: Finished difference Result 118 states and 120 transitions. [2019-09-10 02:52:50,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-10 02:52:50,500 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 120 [2019-09-10 02:52:50,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:52:50,501 INFO L225 Difference]: With dead ends: 118 [2019-09-10 02:52:50,502 INFO L226 Difference]: Without dead ends: 116 [2019-09-10 02:52:50,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 153 SyntacticMatches, 49 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3715 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=764, Invalid=14242, Unknown=0, NotChecked=0, Total=15006 [2019-09-10 02:52:50,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-10 02:52:50,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 72. [2019-09-10 02:52:50,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-10 02:52:50,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2019-09-10 02:52:50,508 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 120 [2019-09-10 02:52:50,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:52:50,509 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2019-09-10 02:52:50,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-10 02:52:50,509 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2019-09-10 02:52:50,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 02:52:50,510 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:52:50,510 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:52:50,510 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:52:50,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:52:50,511 INFO L82 PathProgramCache]: Analyzing trace with hash -873547948, now seen corresponding path program 8 times [2019-09-10 02:52:50,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:52:50,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:52:50,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:52:50,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:52:50,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:52:50,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:52:51,522 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-09-10 02:52:51,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:52:51,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:52:51,523 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:52:51,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:52:51,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:52:51,523 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-10 02:52:51,532 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:52:51,533 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:52:51,571 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-10 02:52:51,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:52:51,575 WARN L254 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 144 conjunts are in the unsatisfiable core [2019-09-10 02:52:51,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:52:51,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:51,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:51,809 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-09-10 02:52:51,809 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:52:51,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:53,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:53,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:53,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:53,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:53,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:53,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:53,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:54,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:54,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:54,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:54,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:54,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:54,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:55,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:55,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:55,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:55,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:55,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:56,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:56,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:56,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:56,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:57,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:57,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:57,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:57,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:57,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:57,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:57,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:57,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:57,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:57,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:57,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:58,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:58,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:58,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:58,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:58,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:58,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:58,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:58,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:52:58,496 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 0 proven. 368 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-10 02:52:58,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:52:58,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 54] total 61 [2019-09-10 02:52:58,499 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:52:58,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-10 02:52:58,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-10 02:52:58,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=3456, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 02:52:58,500 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 41 states. [2019-09-10 02:53:01,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:53:01,131 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2019-09-10 02:53:01,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-10 02:53:01,131 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 127 [2019-09-10 02:53:01,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:53:01,133 INFO L225 Difference]: With dead ends: 124 [2019-09-10 02:53:01,133 INFO L226 Difference]: Without dead ends: 122 [2019-09-10 02:53:01,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 195 SyntacticMatches, 54 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1073 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=639, Invalid=8291, Unknown=0, NotChecked=0, Total=8930 [2019-09-10 02:53:01,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-10 02:53:01,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 75. [2019-09-10 02:53:01,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-10 02:53:01,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2019-09-10 02:53:01,139 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 127 [2019-09-10 02:53:01,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:53:01,140 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2019-09-10 02:53:01,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-10 02:53:01,140 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2019-09-10 02:53:01,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 02:53:01,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:53:01,141 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:53:01,141 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:53:01,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:53:01,142 INFO L82 PathProgramCache]: Analyzing trace with hash 178099167, now seen corresponding path program 8 times [2019-09-10 02:53:01,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:53:01,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:53:01,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:53:01,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:53:01,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:53:01,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:53:02,162 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2019-09-10 02:53:02,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:53:02,162 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:53:02,163 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:53:02,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:53:02,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:53:02,163 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:53:02,176 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:53:02,177 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:53:02,221 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-10 02:53:02,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:53:02,225 WARN L254 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 152 conjunts are in the unsatisfiable core [2019-09-10 02:53:02,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:53:04,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:04,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:04,199 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2019-09-10 02:53:04,199 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:53:04,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:05,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:05,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:05,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:05,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:05,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:06,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:53:06,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:06,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:07,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:53:07,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:07,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:07,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:07,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:53:08,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:08,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:53:08,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:08,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:53:09,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:09,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:53:09,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:09,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:53:10,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:10,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:53:10,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:53:10,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:10,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:10,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:53:10,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:10,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:11,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:11,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:53:11,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:53:11,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:11,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:11,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:11,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:53:11,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:11,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:53:12,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:12,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:53:12,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:12,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:53:12,437 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-10 02:53:12,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:53:12,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 57] total 101 [2019-09-10 02:53:12,445 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:53:12,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-10 02:53:12,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-10 02:53:12,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=9721, Unknown=0, NotChecked=0, Total=10100 [2019-09-10 02:53:12,447 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand 79 states. [2019-09-10 02:53:15,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:53:15,529 INFO L93 Difference]: Finished difference Result 130 states and 132 transitions. [2019-09-10 02:53:15,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-10 02:53:15,530 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 134 [2019-09-10 02:53:15,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:53:15,531 INFO L225 Difference]: With dead ends: 130 [2019-09-10 02:53:15,531 INFO L226 Difference]: Without dead ends: 128 [2019-09-10 02:53:15,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 171 SyntacticMatches, 55 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4700 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=893, Invalid=17739, Unknown=0, NotChecked=0, Total=18632 [2019-09-10 02:53:15,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-10 02:53:15,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 78. [2019-09-10 02:53:15,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-10 02:53:15,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2019-09-10 02:53:15,540 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 134 [2019-09-10 02:53:15,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:53:15,540 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2019-09-10 02:53:15,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-10 02:53:15,540 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2019-09-10 02:53:15,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 02:53:15,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:53:15,542 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:53:15,542 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:53:15,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:53:15,542 INFO L82 PathProgramCache]: Analyzing trace with hash 273809272, now seen corresponding path program 9 times [2019-09-10 02:53:15,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:53:15,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:53:15,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:53:15,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:53:15,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:53:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:53:16,785 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2019-09-10 02:53:16,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:53:16,785 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:53:16,785 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:53:16,786 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:53:16,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:53:16,786 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-10 02:53:16,798 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:53:16,798 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:53:16,838 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:53:16,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:53:16,841 WARN L254 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 160 conjunts are in the unsatisfiable core [2019-09-10 02:53:16,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:53:16,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:16,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:17,181 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2019-09-10 02:53:17,181 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:53:17,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:18,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:18,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:18,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:18,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:18,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:19,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:53:19,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:19,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:20,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:20,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:53:20,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:20,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:53:21,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:53:21,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:21,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:21,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:53:21,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:21,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:22,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:53:22,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:22,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:22,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:22,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:53:23,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:53:23,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:23,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:23,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:53:23,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:23,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:23,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:23,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:53:24,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:53:24,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:24,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:24,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:53:24,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:24,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:24,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:24,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:53:24,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:53:24,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:24,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:25,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:25,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:53:25,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:53:25,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:25,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:25,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:53:25,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:25,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:25,445 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 0 proven. 468 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-10 02:53:25,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:53:25,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 60] total 67 [2019-09-10 02:53:25,449 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:53:25,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-10 02:53:25,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-10 02:53:25,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=4196, Unknown=0, NotChecked=0, Total=4422 [2019-09-10 02:53:25,450 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 45 states. [2019-09-10 02:53:28,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:53:28,482 INFO L93 Difference]: Finished difference Result 136 states and 138 transitions. [2019-09-10 02:53:28,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-10 02:53:28,486 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 141 [2019-09-10 02:53:28,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:53:28,487 INFO L225 Difference]: With dead ends: 136 [2019-09-10 02:53:28,487 INFO L226 Difference]: Without dead ends: 134 [2019-09-10 02:53:28,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 217 SyntacticMatches, 60 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1313 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=750, Invalid=10170, Unknown=0, NotChecked=0, Total=10920 [2019-09-10 02:53:28,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-09-10 02:53:28,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 81. [2019-09-10 02:53:28,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-10 02:53:28,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2019-09-10 02:53:28,493 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 141 [2019-09-10 02:53:28,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:53:28,494 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2019-09-10 02:53:28,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-10 02:53:28,494 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2019-09-10 02:53:28,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 02:53:28,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:53:28,495 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:53:28,495 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:53:28,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:53:28,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1983154945, now seen corresponding path program 9 times [2019-09-10 02:53:28,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:53:28,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:53:28,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:53:28,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:53:28,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:53:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:53:29,649 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 261 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-09-10 02:53:29,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:53:29,649 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:53:29,649 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:53:29,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:53:29,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:53:29,650 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-10 02:53:29,660 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:53:29,660 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:53:29,701 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:53:29,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:53:29,704 WARN L254 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 168 conjunts are in the unsatisfiable core [2019-09-10 02:53:29,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:53:31,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:31,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:32,066 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 261 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-09-10 02:53:32,066 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:53:32,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:33,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:33,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:33,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:33,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:34,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:34,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:53:35,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:53:35,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:35,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:36,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:53:36,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:36,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:36,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:36,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:53:37,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:53:37,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:37,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:38,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:53:38,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:38,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:38,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:38,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:53:39,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:53:39,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:39,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:39,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:53:39,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:39,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:40,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:40,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:53:40,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:40,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:53:41,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:41,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:53:41,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:53:41,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:41,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:41,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:53:41,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:41,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:42,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:53:42,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:42,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:42,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:53:42,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:42,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:42,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:42,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:53:42,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:42,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:53:42,812 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 522 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-10 02:53:42,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:53:42,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 46, 63] total 111 [2019-09-10 02:53:42,816 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:53:42,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-10 02:53:42,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-10 02:53:42,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=11791, Unknown=0, NotChecked=0, Total=12210 [2019-09-10 02:53:42,818 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand 87 states. [2019-09-10 02:53:46,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:53:46,618 INFO L93 Difference]: Finished difference Result 142 states and 144 transitions. [2019-09-10 02:53:46,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-10 02:53:46,619 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 148 [2019-09-10 02:53:46,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:53:46,620 INFO L225 Difference]: With dead ends: 142 [2019-09-10 02:53:46,620 INFO L226 Difference]: Without dead ends: 140 [2019-09-10 02:53:46,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 189 SyntacticMatches, 61 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5683 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=1030, Invalid=21620, Unknown=0, NotChecked=0, Total=22650 [2019-09-10 02:53:46,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-09-10 02:53:46,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 84. [2019-09-10 02:53:46,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-09-10 02:53:46,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2019-09-10 02:53:46,629 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 148 [2019-09-10 02:53:46,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:53:46,629 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2019-09-10 02:53:46,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-10 02:53:46,630 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2019-09-10 02:53:46,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 02:53:46,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:53:46,631 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:53:46,631 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:53:46,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:53:46,631 INFO L82 PathProgramCache]: Analyzing trace with hash -708738788, now seen corresponding path program 10 times [2019-09-10 02:53:46,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:53:46,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:53:46,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:53:46,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:53:46,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:53:46,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:53:48,125 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2019-09-10 02:53:48,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:53:48,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:53:48,125 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:53:48,125 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:53:48,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:53:48,126 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:53:48,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:53:48,137 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:53:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:53:48,183 WARN L254 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 176 conjunts are in the unsatisfiable core [2019-09-10 02:53:48,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:53:48,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:48,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:48,525 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2019-09-10 02:53:48,526 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:53:48,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:50,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:50,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:50,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:50,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:50,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:51,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:51,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:53:52,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:52,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:53:52,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:53:52,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:52,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:53,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:53,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:53:53,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:53,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:53:54,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:54,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:53:55,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:55,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:53:55,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:55,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:53:56,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:53:56,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:56,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:56,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:53:56,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:56,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:56,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:53:56,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:56,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:57,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:53:57,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:57,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:57,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:57,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:53:57,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:53:57,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:57,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:58,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:58,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:53:58,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:53:58,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:58,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:58,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:58,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:53:58,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:53:58,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:58,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:58,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:53:58,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:58,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:58,919 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 0 proven. 580 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-10 02:53:58,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:53:58,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 66] total 73 [2019-09-10 02:53:58,922 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:53:58,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-10 02:53:58,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-10 02:53:58,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=5008, Unknown=0, NotChecked=0, Total=5256 [2019-09-10 02:53:58,924 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 49 states. [2019-09-10 02:54:02,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:54:02,645 INFO L93 Difference]: Finished difference Result 148 states and 150 transitions. [2019-09-10 02:54:02,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-10 02:54:02,647 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 155 [2019-09-10 02:54:02,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:54:02,650 INFO L225 Difference]: With dead ends: 148 [2019-09-10 02:54:02,650 INFO L226 Difference]: Without dead ends: 146 [2019-09-10 02:54:02,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 239 SyntacticMatches, 66 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1577 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=869, Invalid=12241, Unknown=0, NotChecked=0, Total=13110 [2019-09-10 02:54:02,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-09-10 02:54:02,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 87. [2019-09-10 02:54:02,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-10 02:54:02,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2019-09-10 02:54:02,655 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 155 [2019-09-10 02:54:02,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:54:02,656 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2019-09-10 02:54:02,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-10 02:54:02,656 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2019-09-10 02:54:02,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-10 02:54:02,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:54:02,657 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:54:02,657 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:54:02,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:54:02,658 INFO L82 PathProgramCache]: Analyzing trace with hash -448788065, now seen corresponding path program 10 times [2019-09-10 02:54:02,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:54:02,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:54:02,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:54:02,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:54:02,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:54:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:54:04,236 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 0 proven. 320 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2019-09-10 02:54:04,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:54:04,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:54:04,237 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:54:04,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:54:04,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:54:04,237 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-10 02:54:04,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:54:04,254 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:54:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:54:04,305 WARN L254 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 184 conjunts are in the unsatisfiable core [2019-09-10 02:54:04,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:54:06,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:06,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:07,104 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 0 proven. 320 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2019-09-10 02:54:07,104 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:54:07,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:09,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:09,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:09,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:09,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:09,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:10,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:54:10,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:10,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:10,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:54:10,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:10,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:11,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:11,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:54:12,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:54:12,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:12,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:13,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:54:13,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:13,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:13,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:13,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:54:14,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:14,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:54:15,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:15,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:54:15,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:15,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:54:16,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:16,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:54:16,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:16,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:54:17,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:54:17,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:17,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:17,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:17,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:54:17,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:17,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:54:18,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:54:18,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:18,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:18,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:18,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:54:18,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:18,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:54:19,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:19,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:54:19,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:54:19,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:19,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:19,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:19,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:54:19,608 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 0 proven. 640 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-09-10 02:54:19,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:54:19,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 69] total 121 [2019-09-10 02:54:19,612 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:54:19,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-10 02:54:19,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-10 02:54:19,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=14061, Unknown=0, NotChecked=0, Total=14520 [2019-09-10 02:54:19,614 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 95 states. [2019-09-10 02:54:24,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:54:24,709 INFO L93 Difference]: Finished difference Result 154 states and 156 transitions. [2019-09-10 02:54:24,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-10 02:54:24,709 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 162 [2019-09-10 02:54:24,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:54:24,711 INFO L225 Difference]: With dead ends: 154 [2019-09-10 02:54:24,712 INFO L226 Difference]: Without dead ends: 152 [2019-09-10 02:54:24,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 207 SyntacticMatches, 67 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6888 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=1175, Invalid=25885, Unknown=0, NotChecked=0, Total=27060 [2019-09-10 02:54:24,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-10 02:54:24,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 90. [2019-09-10 02:54:24,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-10 02:54:24,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2019-09-10 02:54:24,718 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 162 [2019-09-10 02:54:24,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:54:24,718 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2019-09-10 02:54:24,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-10 02:54:24,718 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2019-09-10 02:54:24,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-10 02:54:24,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:54:24,720 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:54:24,720 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:54:24,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:54:24,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1407042496, now seen corresponding path program 11 times [2019-09-10 02:54:24,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:54:24,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:54:24,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:54:24,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:54:24,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:54:24,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:54:26,366 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 473 trivial. 0 not checked. [2019-09-10 02:54:26,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:54:26,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:54:26,366 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:54:26,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:54:26,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:54:26,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:54:26,376 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:54:26,376 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:54:26,457 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-10 02:54:26,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:54:26,462 WARN L254 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 192 conjunts are in the unsatisfiable core [2019-09-10 02:54:26,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:54:26,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:26,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:26,776 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 473 trivial. 0 not checked. [2019-09-10 02:54:26,776 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:54:26,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:28,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:28,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:28,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:28,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:29,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:29,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:54:30,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:54:30,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:30,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:31,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:54:31,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:31,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:32,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:54:32,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:32,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:32,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:54:32,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:32,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:33,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:33,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:54:34,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:34,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:54:34,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:34,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:54:35,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:35,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:54:35,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:35,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:54:36,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:54:36,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:36,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:36,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:54:36,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:36,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:37,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:37,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:54:37,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:37,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:54:37,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:37,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:54:38,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:38,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:54:38,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:38,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:54:38,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:38,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:54:38,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:54:38,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:38,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:38,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:54:38,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:38,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:39,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:39,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:54:39,223 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 0 proven. 704 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 02:54:39,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:54:39,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 72] total 79 [2019-09-10 02:54:39,226 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:54:39,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-10 02:54:39,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-10 02:54:39,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=5892, Unknown=0, NotChecked=0, Total=6162 [2019-09-10 02:54:39,228 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand 53 states. [2019-09-10 02:54:43,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:54:43,563 INFO L93 Difference]: Finished difference Result 160 states and 162 transitions. [2019-09-10 02:54:43,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-10 02:54:43,563 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 169 [2019-09-10 02:54:43,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:54:43,565 INFO L225 Difference]: With dead ends: 160 [2019-09-10 02:54:43,565 INFO L226 Difference]: Without dead ends: 158 [2019-09-10 02:54:43,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 261 SyntacticMatches, 72 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1865 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=996, Invalid=14504, Unknown=0, NotChecked=0, Total=15500 [2019-09-10 02:54:43,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-09-10 02:54:43,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2019-09-10 02:54:43,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-10 02:54:43,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 95 transitions. [2019-09-10 02:54:43,572 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 95 transitions. Word has length 169 [2019-09-10 02:54:43,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:54:43,572 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 95 transitions. [2019-09-10 02:54:43,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-10 02:54:43,572 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2019-09-10 02:54:43,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 02:54:43,573 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:54:43,574 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:54:43,574 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:54:43,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:54:43,574 INFO L82 PathProgramCache]: Analyzing trace with hash 491557311, now seen corresponding path program 11 times [2019-09-10 02:54:43,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:54:43,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:54:43,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:54:43,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:54:43,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:54:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:54:45,285 INFO L134 CoverageAnalysis]: Checked inductivity of 902 backedges. 0 proven. 385 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2019-09-10 02:54:45,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:54:45,285 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:54:45,285 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:54:45,285 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:54:45,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:54:45,286 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-10 02:54:45,298 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:54:45,298 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:54:45,361 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-10 02:54:45,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:54:45,365 WARN L254 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 200 conjunts are in the unsatisfiable core [2019-09-10 02:54:45,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:54:48,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:48,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:48,646 INFO L134 CoverageAnalysis]: Checked inductivity of 902 backedges. 0 proven. 385 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2019-09-10 02:54:48,647 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:54:48,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:50,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:50,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:50,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:50,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:50,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:51,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:54:51,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:51,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:52,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:52,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:54:53,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:53,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:54:54,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:54:54,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:54,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:55,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:54:55,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:55,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:56,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:56,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:54:56,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:54:56,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:56,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:57,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:54:57,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:57,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:58,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:58,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:54:58,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:58,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:54:59,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:59,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:54:59,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:54:59,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:54:59,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:00,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:55:00,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:00,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:00,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:55:00,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:00,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:01,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:55:01,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:01,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:01,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:01,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:55:02,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:55:02,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:02,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:02,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:02,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:55:02,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:02,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:55:02,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:02,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:55:03,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:03,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:55:03,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:55:03,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:03,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:03,479 INFO L134 CoverageAnalysis]: Checked inductivity of 902 backedges. 0 proven. 770 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-10 02:55:03,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:55:03,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 75] total 131 [2019-09-10 02:55:03,483 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:55:03,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-09-10 02:55:03,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-09-10 02:55:03,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=16531, Unknown=0, NotChecked=0, Total=17030 [2019-09-10 02:55:03,485 INFO L87 Difference]: Start difference. First operand 93 states and 95 transitions. Second operand 103 states. [2019-09-10 02:55:09,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:55:09,478 INFO L93 Difference]: Finished difference Result 166 states and 168 transitions. [2019-09-10 02:55:09,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-10 02:55:09,478 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 176 [2019-09-10 02:55:09,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:55:09,480 INFO L225 Difference]: With dead ends: 166 [2019-09-10 02:55:09,480 INFO L226 Difference]: Without dead ends: 164 [2019-09-10 02:55:09,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 225 SyntacticMatches, 73 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8138 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=1328, Invalid=30534, Unknown=0, NotChecked=0, Total=31862 [2019-09-10 02:55:09,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-10 02:55:09,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 96. [2019-09-10 02:55:09,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-10 02:55:09,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2019-09-10 02:55:09,486 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 176 [2019-09-10 02:55:09,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:55:09,487 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2019-09-10 02:55:09,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-09-10 02:55:09,487 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2019-09-10 02:55:09,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 02:55:09,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:55:09,489 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:55:09,489 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:55:09,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:55:09,489 INFO L82 PathProgramCache]: Analyzing trace with hash 308359396, now seen corresponding path program 12 times [2019-09-10 02:55:09,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:55:09,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:55:09,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:55:09,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:55:09,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:55:09,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:55:11,448 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 564 trivial. 0 not checked. [2019-09-10 02:55:11,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:55:11,449 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:55:11,449 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:55:11,449 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:55:11,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:55:11,450 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-10 02:55:11,460 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:55:11,461 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:55:11,514 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:55:11,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:55:11,517 WARN L254 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 208 conjunts are in the unsatisfiable core [2019-09-10 02:55:11,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:55:11,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:11,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:11,860 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 564 trivial. 0 not checked. [2019-09-10 02:55:11,860 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:55:11,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:14,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:14,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:14,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:14,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:15,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:15,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:55:16,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:55:16,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:16,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:16,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:55:16,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:16,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:17,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:55:17,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:17,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:18,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:18,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:55:19,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:55:19,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:19,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:19,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:19,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:55:20,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:55:20,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:20,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:21,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:55:21,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:21,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:21,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:55:21,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:21,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:22,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:22,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:55:22,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:55:22,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:23,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:23,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:23,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:55:23,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:23,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:55:24,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:24,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:55:24,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:55:24,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:24,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:25,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:55:25,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:25,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:25,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:55:25,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:25,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:25,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:25,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:55:25,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:25,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:55:26,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:26,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:55:26,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:26,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:55:26,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:55:26,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:26,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:26,421 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 0 proven. 840 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:55:26,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:55:26,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 78] total 85 [2019-09-10 02:55:26,425 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:55:26,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-10 02:55:26,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-10 02:55:26,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=6848, Unknown=0, NotChecked=0, Total=7140 [2019-09-10 02:55:26,426 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand 57 states. [2019-09-10 02:55:31,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:55:31,423 INFO L93 Difference]: Finished difference Result 172 states and 174 transitions. [2019-09-10 02:55:31,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-10 02:55:31,425 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 183 [2019-09-10 02:55:31,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:55:31,426 INFO L225 Difference]: With dead ends: 172 [2019-09-10 02:55:31,426 INFO L226 Difference]: Without dead ends: 170 [2019-09-10 02:55:31,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 283 SyntacticMatches, 78 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2177 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=1131, Invalid=16959, Unknown=0, NotChecked=0, Total=18090 [2019-09-10 02:55:31,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-10 02:55:31,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 99. [2019-09-10 02:55:31,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-10 02:55:31,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2019-09-10 02:55:31,433 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 183 [2019-09-10 02:55:31,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:55:31,433 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 101 transitions. [2019-09-10 02:55:31,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-10 02:55:31,433 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2019-09-10 02:55:31,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 02:55:31,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:55:31,435 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:55:31,435 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:55:31,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:55:31,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1601548961, now seen corresponding path program 12 times [2019-09-10 02:55:31,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:55:31,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:55:31,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:55:31,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:55:31,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:55:31,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:55:33,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1068 backedges. 0 proven. 456 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:55:33,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:55:33,264 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:55:33,264 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:55:33,265 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:55:33,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:55:33,265 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-10 02:55:33,275 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:55:33,276 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:55:33,327 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:55:33,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:55:33,331 WARN L254 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 216 conjunts are in the unsatisfiable core [2019-09-10 02:55:33,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:55:36,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:36,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:37,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1068 backedges. 0 proven. 456 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:55:37,156 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:55:37,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:39,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:39,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:39,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:39,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:39,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:40,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:55:40,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:40,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:41,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:41,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:55:42,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:55:42,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:42,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:43,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:43,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:55:44,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:44,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:55:45,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:55:45,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:45,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:46,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:46,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:55:46,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:55:46,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:46,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:47,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:47,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:55:48,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:48,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:55:49,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:55:49,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:49,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:49,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:55:49,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:49,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:50,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:55:50,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:50,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:50,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:50,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:55:51,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:55:51,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:51,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:51,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:51,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:55:52,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:52,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:55:52,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:52,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:55:52,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:55:52,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:52,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:53,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:53,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:55:53,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:55:53,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:53,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:53,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:53,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:55:54,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:55:54,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:54,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:54,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:55:54,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:55:54,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1068 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-09-10 02:55:54,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:55:54,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 58, 81] total 141 [2019-09-10 02:55:54,450 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:55:54,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-09-10 02:55:54,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-09-10 02:55:54,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=539, Invalid=19201, Unknown=0, NotChecked=0, Total=19740 [2019-09-10 02:55:54,452 INFO L87 Difference]: Start difference. First operand 99 states and 101 transitions. Second operand 111 states. [2019-09-10 02:56:00,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:56:00,448 INFO L93 Difference]: Finished difference Result 178 states and 180 transitions. [2019-09-10 02:56:00,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-10 02:56:00,448 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 190 [2019-09-10 02:56:00,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:56:00,449 INFO L225 Difference]: With dead ends: 178 [2019-09-10 02:56:00,449 INFO L226 Difference]: Without dead ends: 176 [2019-09-10 02:56:00,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 243 SyntacticMatches, 79 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9415 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=1489, Invalid=35567, Unknown=0, NotChecked=0, Total=37056 [2019-09-10 02:56:00,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-10 02:56:00,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 102. [2019-09-10 02:56:00,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-09-10 02:56:00,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 104 transitions. [2019-09-10 02:56:00,456 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 104 transitions. Word has length 190 [2019-09-10 02:56:00,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:56:00,457 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 104 transitions. [2019-09-10 02:56:00,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-09-10 02:56:00,457 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 104 transitions. [2019-09-10 02:56:00,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-10 02:56:00,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:56:00,458 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:56:00,458 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:56:00,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:56:00,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1837932792, now seen corresponding path program 13 times [2019-09-10 02:56:00,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:56:00,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:56:00,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:56:00,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:56:00,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:56:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:56:02,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 663 trivial. 0 not checked. [2019-09-10 02:56:02,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:56:02,623 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:56:02,623 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:56:02,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:56:02,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:56:02,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:56:02,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:56:02,638 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:56:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:56:02,699 WARN L254 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 224 conjunts are in the unsatisfiable core [2019-09-10 02:56:02,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:56:02,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:02,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:03,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 663 trivial. 0 not checked. [2019-09-10 02:56:03,133 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:56:03,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:05,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:05,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:05,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:05,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:05,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:06,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:56:06,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:06,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:07,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:07,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:56:08,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:08,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:56:09,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:09,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:56:10,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:10,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:56:11,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:56:11,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:11,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:12,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:56:12,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:12,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:12,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:12,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:56:13,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:56:13,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:13,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:14,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:14,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:56:14,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:56:14,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:14,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:15,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:56:15,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:15,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:16,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:16,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:56:16,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:16,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:56:17,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:56:17,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:17,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:17,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:17,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:56:17,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:17,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:56:18,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:56:18,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:18,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:18,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:18,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:56:18,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:18,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:56:19,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:19,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:56:19,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:19,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:56:19,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:56:19,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:19,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:19,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:56:19,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:19,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:19,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:56:19,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:19,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:20,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 0 proven. 988 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-10 02:56:20,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:56:20,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 84] total 91 [2019-09-10 02:56:20,106 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:56:20,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-10 02:56:20,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-10 02:56:20,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=7876, Unknown=0, NotChecked=0, Total=8190 [2019-09-10 02:56:20,108 INFO L87 Difference]: Start difference. First operand 102 states and 104 transitions. Second operand 61 states. [2019-09-10 02:56:25,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:56:25,835 INFO L93 Difference]: Finished difference Result 184 states and 186 transitions. [2019-09-10 02:56:25,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-10 02:56:25,835 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 197 [2019-09-10 02:56:25,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:56:25,837 INFO L225 Difference]: With dead ends: 184 [2019-09-10 02:56:25,837 INFO L226 Difference]: Without dead ends: 182 [2019-09-10 02:56:25,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 305 SyntacticMatches, 84 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2513 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=1274, Invalid=19606, Unknown=0, NotChecked=0, Total=20880 [2019-09-10 02:56:25,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-10 02:56:25,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 105. [2019-09-10 02:56:25,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-10 02:56:25,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2019-09-10 02:56:25,844 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 197 [2019-09-10 02:56:25,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:56:25,845 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2019-09-10 02:56:25,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-10 02:56:25,845 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2019-09-10 02:56:25,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-10 02:56:25,846 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:56:25,846 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:56:25,847 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:56:25,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:56:25,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1277526913, now seen corresponding path program 13 times [2019-09-10 02:56:25,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:56:25,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:56:25,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:56:25,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:56:25,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:56:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:56:28,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 0 proven. 533 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-09-10 02:56:28,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:56:28,039 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:56:28,039 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:56:28,039 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:56:28,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:56:28,039 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-10 02:56:28,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:56:28,051 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:56:28,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:56:28,110 WARN L254 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 232 conjunts are in the unsatisfiable core [2019-09-10 02:56:28,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:56:32,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:32,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:32,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 0 proven. 533 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-09-10 02:56:32,410 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:56:32,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:34,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:34,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:34,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:34,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:36,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:36,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:56:37,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:37,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:56:38,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:56:38,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:38,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:39,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:56:39,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:39,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:40,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:40,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:56:41,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:56:41,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:41,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:42,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:42,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:56:43,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:56:43,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:43,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:43,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:43,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:56:44,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:44,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:56:45,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:45,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:56:46,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:56:46,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:46,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:46,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:46,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:56:47,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:56:47,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:47,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:47,921 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-09-10 02:56:48,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:56:48,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:48,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:48,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:48,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:56:49,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:49,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:56:49,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:56:49,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:49,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:50,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:56:50,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:50,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:50,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:56:50,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:50,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:51,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:56:51,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:51,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:51,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:56:51,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:51,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:51,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:51,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:56:51,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:51,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:56:52,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:52,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:56:52,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:56:52,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:56:52,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 0 proven. 1066 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-09-10 02:56:52,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:56:52,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 87] total 151 [2019-09-10 02:56:52,671 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:56:52,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-09-10 02:56:52,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-09-10 02:56:52,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=579, Invalid=22071, Unknown=0, NotChecked=0, Total=22650 [2019-09-10 02:56:52,673 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand 119 states. [2019-09-10 02:56:59,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:56:59,192 INFO L93 Difference]: Finished difference Result 190 states and 192 transitions. [2019-09-10 02:56:59,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-10 02:56:59,192 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 204 [2019-09-10 02:56:59,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:56:59,194 INFO L225 Difference]: With dead ends: 190 [2019-09-10 02:56:59,195 INFO L226 Difference]: Without dead ends: 188 [2019-09-10 02:56:59,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 261 SyntacticMatches, 85 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10950 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=1658, Invalid=40984, Unknown=0, NotChecked=0, Total=42642 [2019-09-10 02:56:59,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-10 02:56:59,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 108. [2019-09-10 02:56:59,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-09-10 02:56:59,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-09-10 02:56:59,203 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 204 [2019-09-10 02:56:59,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:56:59,203 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-09-10 02:56:59,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-09-10 02:56:59,204 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-09-10 02:56:59,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-10 02:56:59,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:56:59,205 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:56:59,205 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:56:59,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:56:59,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1565902508, now seen corresponding path program 14 times [2019-09-10 02:56:59,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:56:59,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:56:59,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:56:59,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:56:59,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:56:59,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:57:01,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 574 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2019-09-10 02:57:01,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:57:01,751 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:57:01,751 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:57:01,751 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:57:01,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:57:01,751 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-10 02:57:01,768 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:57:01,768 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:57:01,841 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-10 02:57:01,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:57:01,845 WARN L254 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 240 conjunts are in the unsatisfiable core [2019-09-10 02:57:01,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:57:02,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:02,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:02,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 574 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2019-09-10 02:57:02,338 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:57:02,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:04,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:04,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:04,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:04,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:04,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:06,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:57:06,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:06,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:07,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:57:07,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:07,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:08,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:57:08,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:08,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:09,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:57:09,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:09,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:10,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:57:10,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:10,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:11,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:57:11,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:11,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:11,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:57:11,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:11,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:12,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:57:12,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:12,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:13,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:57:13,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:13,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:14,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:57:14,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:14,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:15,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:57:15,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:15,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:15,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:15,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:57:16,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:57:16,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:16,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:17,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:17,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:57:17,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:17,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:57:18,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:57:18,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:18,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:18,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:57:18,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:18,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:19,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:57:19,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:19,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:19,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:57:19,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:19,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:19,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:19,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:57:20,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:20,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:57:20,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:57:20,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:20,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:20,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:20,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:57:21,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:57:21,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:21,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:21,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:21,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:57:21,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:57:21,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:21,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:21,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:21,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:57:21,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 1148 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-10 02:57:21,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:57:21,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 90] total 97 [2019-09-10 02:57:21,790 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:57:21,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-10 02:57:21,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-10 02:57:21,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=8976, Unknown=0, NotChecked=0, Total=9312 [2019-09-10 02:57:21,792 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 65 states. [2019-09-10 02:57:28,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:57:28,290 INFO L93 Difference]: Finished difference Result 196 states and 198 transitions. [2019-09-10 02:57:28,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-10 02:57:28,290 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 211 [2019-09-10 02:57:28,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:57:28,292 INFO L225 Difference]: With dead ends: 196 [2019-09-10 02:57:28,292 INFO L226 Difference]: Without dead ends: 194 [2019-09-10 02:57:28,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 327 SyntacticMatches, 90 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2873 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=1425, Invalid=22445, Unknown=0, NotChecked=0, Total=23870 [2019-09-10 02:57:28,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-09-10 02:57:28,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 111. [2019-09-10 02:57:28,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-10 02:57:28,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 113 transitions. [2019-09-10 02:57:28,299 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 113 transitions. Word has length 211 [2019-09-10 02:57:28,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:57:28,300 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 113 transitions. [2019-09-10 02:57:28,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-10 02:57:28,300 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2019-09-10 02:57:28,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 02:57:28,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:57:28,302 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:57:28,302 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:57:28,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:57:28,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1516658463, now seen corresponding path program 14 times [2019-09-10 02:57:28,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:57:28,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:57:28,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:57:28,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:57:28,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:57:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:57:31,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1442 backedges. 0 proven. 616 refuted. 0 times theorem prover too weak. 826 trivial. 0 not checked. [2019-09-10 02:57:31,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:57:31,409 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:57:31,409 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:57:31,409 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:57:31,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:57:31,409 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-10 02:57:31,418 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:57:31,419 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:57:31,496 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-10 02:57:31,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:57:31,500 WARN L254 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 248 conjunts are in the unsatisfiable core [2019-09-10 02:57:31,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:57:36,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:36,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:36,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1442 backedges. 0 proven. 616 refuted. 0 times theorem prover too weak. 826 trivial. 0 not checked. [2019-09-10 02:57:36,552 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:57:36,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:39,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:39,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:39,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:39,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:39,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:40,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:40,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:57:41,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:41,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:57:43,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:57:43,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:43,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:44,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:57:44,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:44,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:45,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:57:45,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:45,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:46,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:46,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:57:47,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:47,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:57:48,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:48,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:57:49,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:57:49,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:49,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:49,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:57:49,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:49,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:50,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:50,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:57:51,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:57:51,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:51,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:52,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:52,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:57:52,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:57:52,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:52,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:53,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:57:53,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:53,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:54,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:57:54,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:54,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:54,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:54,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:57:55,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:55,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:57:56,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:57:56,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:56,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:56,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:57:56,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:56,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:56,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:56,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:57:57,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:57:57,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:57,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:57,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:57:57,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:57,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:58,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:57:58,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:58,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:58,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:57:58,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:58,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:58,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:58,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:57:58,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:57:58,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:58,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:59,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:57:59,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:59,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:57:59,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1442 backedges. 0 proven. 1232 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-10 02:57:59,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:57:59,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 93] total 161 [2019-09-10 02:57:59,369 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:57:59,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-09-10 02:57:59,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-09-10 02:57:59,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=25141, Unknown=0, NotChecked=0, Total=25760 [2019-09-10 02:57:59,372 INFO L87 Difference]: Start difference. First operand 111 states and 113 transitions. Second operand 127 states. [2019-09-10 02:58:07,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:58:07,776 INFO L93 Difference]: Finished difference Result 202 states and 204 transitions. [2019-09-10 02:58:07,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-10 02:58:07,776 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 218 [2019-09-10 02:58:07,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:58:07,778 INFO L225 Difference]: With dead ends: 202 [2019-09-10 02:58:07,781 INFO L226 Difference]: Without dead ends: 200 [2019-09-10 02:58:07,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 279 SyntacticMatches, 91 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12512 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=1835, Invalid=46785, Unknown=0, NotChecked=0, Total=48620 [2019-09-10 02:58:07,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-09-10 02:58:07,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 114. [2019-09-10 02:58:07,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-09-10 02:58:07,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 116 transitions. [2019-09-10 02:58:07,790 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 116 transitions. Word has length 218 [2019-09-10 02:58:07,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:58:07,791 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 116 transitions. [2019-09-10 02:58:07,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-09-10 02:58:07,791 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 116 transitions. [2019-09-10 02:58:07,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 02:58:07,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:58:07,792 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:58:07,793 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:58:07,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:58:07,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1728931792, now seen corresponding path program 15 times [2019-09-10 02:58:07,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:58:07,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:58:07,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:58:07,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:58:07,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:58:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:58:10,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1545 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2019-09-10 02:58:10,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:58:10,815 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:58:10,816 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:58:10,816 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:58:10,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:58:10,816 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-10 02:58:10,826 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:58:10,827 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:58:10,899 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:58:10,900 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:58:10,905 WARN L254 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 256 conjunts are in the unsatisfiable core [2019-09-10 02:58:10,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:58:11,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:11,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:11,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1545 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2019-09-10 02:58:11,450 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:58:11,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:14,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:14,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:14,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:14,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:14,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:15,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:58:15,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:15,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:16,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:58:16,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:16,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:17,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:17,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:58:18,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:58:18,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:18,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:19,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:58:19,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:19,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:20,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:20,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:58:21,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:21,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:58:22,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:58:22,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:22,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:23,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:58:23,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:23,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:24,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:58:24,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:24,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:25,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:25,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:58:26,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:58:26,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:26,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:26,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:26,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:58:27,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:27,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:58:28,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:28,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:58:28,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:28,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:58:29,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:58:29,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:29,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:29,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:58:29,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:29,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:30,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:30,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:58:30,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:58:30,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:30,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:31,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:31,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:58:31,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:58:31,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:31,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:32,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:32,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:58:32,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:32,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:58:32,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:32,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:58:32,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:58:32,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:32,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:33,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:33,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:58:33,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:58:33,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:33,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:33,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:58:33,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:33,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:33,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1545 backedges. 0 proven. 1320 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-10 02:58:33,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:58:33,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 96] total 103 [2019-09-10 02:58:33,564 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:58:33,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-10 02:58:33,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-10 02:58:33,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=10148, Unknown=0, NotChecked=0, Total=10506 [2019-09-10 02:58:33,565 INFO L87 Difference]: Start difference. First operand 114 states and 116 transitions. Second operand 69 states. [2019-09-10 02:58:40,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:58:40,844 INFO L93 Difference]: Finished difference Result 208 states and 210 transitions. [2019-09-10 02:58:40,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-10 02:58:40,851 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 225 [2019-09-10 02:58:40,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:58:40,853 INFO L225 Difference]: With dead ends: 208 [2019-09-10 02:58:40,853 INFO L226 Difference]: Without dead ends: 206 [2019-09-10 02:58:40,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 349 SyntacticMatches, 96 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3257 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=1584, Invalid=25476, Unknown=0, NotChecked=0, Total=27060 [2019-09-10 02:58:40,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-10 02:58:40,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 117. [2019-09-10 02:58:40,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-09-10 02:58:40,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 119 transitions. [2019-09-10 02:58:40,863 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 119 transitions. Word has length 225 [2019-09-10 02:58:40,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:58:40,864 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 119 transitions. [2019-09-10 02:58:40,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-10 02:58:40,864 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 119 transitions. [2019-09-10 02:58:40,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 02:58:40,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:58:40,865 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:58:40,866 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:58:40,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:58:40,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1113639617, now seen corresponding path program 15 times [2019-09-10 02:58:40,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:58:40,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:58:40,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:58:40,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:58:40,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:58:40,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:58:43,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 705 refuted. 0 times theorem prover too weak. 945 trivial. 0 not checked. [2019-09-10 02:58:43,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:58:43,651 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:58:43,651 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:58:43,651 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:58:43,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:58:43,651 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:58:43,662 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:58:43,663 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:58:43,729 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:58:43,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:58:43,734 WARN L254 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 264 conjunts are in the unsatisfiable core [2019-09-10 02:58:43,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:58:48,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:48,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:49,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 705 refuted. 0 times theorem prover too weak. 945 trivial. 0 not checked. [2019-09-10 02:58:49,238 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:58:49,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:52,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:52,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:52,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:52,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:52,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:53,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:53,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:58:54,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:54,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:58:56,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:58:56,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:56,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:57,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:57,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:58:58,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:58:58,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:58,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:59,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:58:59,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:58:59,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:00,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:59:00,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:00,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:01,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:01,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:59:02,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:02,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:59:03,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:03,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:59:04,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:59:04,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:04,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:05,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:59:05,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:05,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:06,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:59:06,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:06,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:07,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:07,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:59:07,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:59:07,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:07,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:08,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:08,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:59:09,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:09,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:59:09,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:09,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:59:10,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:59:10,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:10,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:11,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:11,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:59:11,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:59:11,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:11,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:12,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:12,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:59:12,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:59:12,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:12,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:13,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:13,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:59:13,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:59:13,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:13,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:13,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:59:13,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:13,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:14,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:14,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:59:14,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:59:14,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:14,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:14,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:14,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:59:14,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:14,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:59:15,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1410 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-09-10 02:59:15,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:59:15,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 99] total 171 [2019-09-10 02:59:15,130 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:59:15,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 135 states [2019-09-10 02:59:15,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2019-09-10 02:59:15,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=659, Invalid=28411, Unknown=0, NotChecked=0, Total=29070 [2019-09-10 02:59:15,133 INFO L87 Difference]: Start difference. First operand 117 states and 119 transitions. Second operand 135 states. [2019-09-10 02:59:25,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:59:25,857 INFO L93 Difference]: Finished difference Result 214 states and 216 transitions. [2019-09-10 02:59:25,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-10 02:59:25,857 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 232 [2019-09-10 02:59:25,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:59:25,858 INFO L225 Difference]: With dead ends: 214 [2019-09-10 02:59:25,859 INFO L226 Difference]: Without dead ends: 212 [2019-09-10 02:59:25,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 297 SyntacticMatches, 97 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14178 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=2020, Invalid=52970, Unknown=0, NotChecked=0, Total=54990 [2019-09-10 02:59:25,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-09-10 02:59:25,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 120. [2019-09-10 02:59:25,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-10 02:59:25,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 122 transitions. [2019-09-10 02:59:25,866 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 122 transitions. Word has length 232 [2019-09-10 02:59:25,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:59:25,867 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 122 transitions. [2019-09-10 02:59:25,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 135 states. [2019-09-10 02:59:25,867 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 122 transitions. [2019-09-10 02:59:25,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-10 02:59:25,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:59:25,869 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:59:25,869 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:59:25,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:59:25,869 INFO L82 PathProgramCache]: Analyzing trace with hash 44515956, now seen corresponding path program 16 times [2019-09-10 02:59:25,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:59:25,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:59:25,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:59:25,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:59:25,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:59:25,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:59:28,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1760 backedges. 0 proven. 752 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2019-09-10 02:59:28,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:59:28,898 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:59:28,898 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:59:28,898 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:59:28,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:59:28,898 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:59:28,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:59:28,909 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:59:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:59:28,987 WARN L254 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 272 conjunts are in the unsatisfiable core [2019-09-10 02:59:28,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:59:29,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:29,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:29,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1760 backedges. 0 proven. 752 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2019-09-10 02:59:29,613 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:59:29,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:32,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:32,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:32,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:32,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:32,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:33,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:33,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:59:35,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:35,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:59:36,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:36,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:59:37,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:37,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:59:38,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:38,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:59:39,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:59:39,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:39,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:40,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:59:40,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:40,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:41,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:41,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:59:42,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:42,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:59:43,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:59:43,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:43,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:44,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:59:44,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:44,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:45,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:45,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:59:46,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:59:46,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:46,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:46,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:59:46,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:46,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:47,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:59:47,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:47,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:48,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:48,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:59:49,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:59:49,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:49,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:49,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:49,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:59:50,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:59:50,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:50,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:50,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:50,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:59:51,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:59:51,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:51,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:51,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:51,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:59:52,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:52,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:59:52,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:52,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:59:52,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:59:52,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:52,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:53,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:59:53,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:53,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:53,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:59:53,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:53,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:53,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:59:53,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:53,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:53,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:59:53,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:53,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:54,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:54,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:59:54,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 02:59:54,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:54,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:59:54,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1760 backedges. 0 proven. 1504 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-10 02:59:54,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:59:54,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 102] total 109 [2019-09-10 02:59:54,480 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:59:54,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-10 02:59:54,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-10 02:59:54,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=11392, Unknown=0, NotChecked=0, Total=11772 [2019-09-10 02:59:54,482 INFO L87 Difference]: Start difference. First operand 120 states and 122 transitions. Second operand 73 states. [2019-09-10 03:00:02,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:00:02,728 INFO L93 Difference]: Finished difference Result 220 states and 222 transitions. [2019-09-10 03:00:02,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-10 03:00:02,729 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 239 [2019-09-10 03:00:02,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:00:02,730 INFO L225 Difference]: With dead ends: 220 [2019-09-10 03:00:02,731 INFO L226 Difference]: Without dead ends: 218 [2019-09-10 03:00:02,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 646 GetRequests, 371 SyntacticMatches, 102 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3665 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=1751, Invalid=28699, Unknown=0, NotChecked=0, Total=30450 [2019-09-10 03:00:02,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-10 03:00:02,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 123. [2019-09-10 03:00:02,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-09-10 03:00:02,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 125 transitions. [2019-09-10 03:00:02,739 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 125 transitions. Word has length 239 [2019-09-10 03:00:02,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:00:02,739 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 125 transitions. [2019-09-10 03:00:02,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-10 03:00:02,740 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 125 transitions. [2019-09-10 03:00:02,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:00:02,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:00:02,742 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:00:02,742 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:00:02,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:00:02,742 INFO L82 PathProgramCache]: Analyzing trace with hash 356400863, now seen corresponding path program 16 times [2019-09-10 03:00:02,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:00:02,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:00:02,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:00:02,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:00:02,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:00:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:00:05,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1872 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 1072 trivial. 0 not checked. [2019-09-10 03:00:06,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:00:06,000 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:00:06,000 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:00:06,000 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:00:06,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:00:06,000 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-10 03:00:06,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:00:06,012 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:00:06,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:00:06,085 WARN L254 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 280 conjunts are in the unsatisfiable core [2019-09-10 03:00:06,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:00:12,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:12,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:12,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1872 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 1072 trivial. 0 not checked. [2019-09-10 03:00:12,362 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:00:12,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:15,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:15,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:15,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:15,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:17,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:17,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:00:18,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:18,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:00:19,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:19,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:00:21,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:21,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:00:22,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:22,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:00:23,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:00:23,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:23,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:24,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:24,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:00:25,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:25,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:00:26,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:00:26,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:26,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:27,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:00:27,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:27,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:28,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:00:28,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:28,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:29,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:29,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:00:30,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:30,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:00:31,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:00:31,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:31,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:32,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:00:32,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:32,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:33,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:00:33,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:33,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:34,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:34,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:00:34,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:34,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:00:35,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:00:35,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:35,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:36,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:00:36,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:36,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:36,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:00:36,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:36,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:37,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:00:37,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:37,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:37,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:37,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:00:38,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:00:38,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:38,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:38,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:00:38,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:38,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:39,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:39,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:00:39,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:39,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:00:40,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:40,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:00:40,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:00:40,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:40,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:40,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:40,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:00:40,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:00:40,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:40,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:41,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:00:41,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:41,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:41,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1872 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-09-10 03:00:41,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:00:41,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 105] total 181 [2019-09-10 03:00:41,502 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:00:41,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 143 states [2019-09-10 03:00:41,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2019-09-10 03:00:41,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=699, Invalid=31881, Unknown=0, NotChecked=0, Total=32580 [2019-09-10 03:00:41,504 INFO L87 Difference]: Start difference. First operand 123 states and 125 transitions. Second operand 143 states. [2019-09-10 03:00:52,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:00:52,345 INFO L93 Difference]: Finished difference Result 226 states and 228 transitions. [2019-09-10 03:00:52,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-10 03:00:52,346 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 246 [2019-09-10 03:00:52,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:00:52,348 INFO L225 Difference]: With dead ends: 226 [2019-09-10 03:00:52,348 INFO L226 Difference]: Without dead ends: 224 [2019-09-10 03:00:52,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 665 GetRequests, 315 SyntacticMatches, 103 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15948 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=2213, Invalid=59539, Unknown=0, NotChecked=0, Total=61752 [2019-09-10 03:00:52,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-09-10 03:00:52,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 126. [2019-09-10 03:00:52,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-09-10 03:00:52,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2019-09-10 03:00:52,355 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 246 [2019-09-10 03:00:52,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:00:52,356 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2019-09-10 03:00:52,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 143 states. [2019-09-10 03:00:52,356 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2019-09-10 03:00:52,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-10 03:00:52,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:00:52,358 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:00:52,358 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:00:52,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:00:52,358 INFO L82 PathProgramCache]: Analyzing trace with hash -29862248, now seen corresponding path program 17 times [2019-09-10 03:00:52,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:00:52,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:00:52,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:00:52,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:00:52,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:00:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:00:55,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1989 backedges. 0 proven. 850 refuted. 0 times theorem prover too weak. 1139 trivial. 0 not checked. [2019-09-10 03:00:55,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:00:55,583 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:00:55,584 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:00:55,584 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:00:55,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:00:55,584 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-10 03:00:55,625 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:00:55,625 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:00:55,715 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-10 03:00:55,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:00:55,719 WARN L254 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 288 conjunts are in the unsatisfiable core [2019-09-10 03:00:55,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:00:55,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:55,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:56,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1989 backedges. 0 proven. 850 refuted. 0 times theorem prover too weak. 1139 trivial. 0 not checked. [2019-09-10 03:00:56,213 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:00:56,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:59,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:59,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:59,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:59,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:00:59,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:00,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:00,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:01:02,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:01:02,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:02,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:03,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:03,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:01:04,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:01:04,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:04,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:05,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:05,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:01:06,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:06,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:01:08,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:08,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:01:09,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:01:09,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:09,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:10,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:10,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:01:11,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:11,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:01:12,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:01:12,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:12,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:13,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:13,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:01:14,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:14,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:01:14,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:01:14,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:14,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:15,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:01:15,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:15,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:16,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:01:16,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:16,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:17,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:01:17,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:17,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:17,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:17,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:01:18,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:01:18,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:18,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:19,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:19,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:01:19,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:01:19,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:19,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:20,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:01:20,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:20,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:20,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:20,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:01:21,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:21,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:01:21,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:01:21,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:21,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:22,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:01:22,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:22,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:22,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:22,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:01:22,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:22,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:01:23,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:01:23,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:23,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:23,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:23,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:01:23,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:23,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:01:23,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:23,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:01:23,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:23,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:01:24,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1989 backedges. 0 proven. 1700 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-10 03:01:24,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:01:24,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 108] total 115 [2019-09-10 03:01:24,201 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:01:24,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-10 03:01:24,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-10 03:01:24,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=402, Invalid=12708, Unknown=0, NotChecked=0, Total=13110 [2019-09-10 03:01:24,203 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand 77 states. [2019-09-10 03:01:33,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:01:33,436 INFO L93 Difference]: Finished difference Result 232 states and 234 transitions. [2019-09-10 03:01:33,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-10 03:01:33,436 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 253 [2019-09-10 03:01:33,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:01:33,439 INFO L225 Difference]: With dead ends: 232 [2019-09-10 03:01:33,439 INFO L226 Difference]: Without dead ends: 230 [2019-09-10 03:01:33,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 684 GetRequests, 393 SyntacticMatches, 108 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4097 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=1926, Invalid=32114, Unknown=0, NotChecked=0, Total=34040 [2019-09-10 03:01:33,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-09-10 03:01:33,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 129. [2019-09-10 03:01:33,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-09-10 03:01:33,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2019-09-10 03:01:33,446 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 253 [2019-09-10 03:01:33,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:01:33,447 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2019-09-10 03:01:33,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-10 03:01:33,447 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2019-09-10 03:01:33,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-10 03:01:33,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:01:33,449 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:01:33,449 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:01:33,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:01:33,449 INFO L82 PathProgramCache]: Analyzing trace with hash 256162815, now seen corresponding path program 17 times [2019-09-10 03:01:33,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:01:33,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:01:33,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:01:33,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:01:33,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:01:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:01:36,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2108 backedges. 0 proven. 901 refuted. 0 times theorem prover too weak. 1207 trivial. 0 not checked. [2019-09-10 03:01:36,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:01:36,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:01:36,661 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:01:36,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:01:36,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:01:36,661 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:01:36,672 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:01:36,673 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:01:36,773 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-10 03:01:36,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:01:36,778 WARN L254 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 296 conjunts are in the unsatisfiable core [2019-09-10 03:01:36,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:01:43,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:43,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:43,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2108 backedges. 0 proven. 901 refuted. 0 times theorem prover too weak. 1207 trivial. 0 not checked. [2019-09-10 03:01:43,620 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:01:43,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:46,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:46,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:46,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:46,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:46,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:48,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:48,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:01:50,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:01:50,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:50,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:51,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:51,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:01:52,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:01:52,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:52,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:53,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:53,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:01:55,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:55,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:01:56,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:01:56,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:56,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:57,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:57,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:01:58,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:01:58,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:58,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:59,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:01:59,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:01:59,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:00,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:00,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:02:01,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:02:01,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:01,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:02,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:02,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:02:03,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:02:03,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:03,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:04,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:02:04,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:04,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:05,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:05,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:02:06,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:06,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:02:07,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:07,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:02:07,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:07,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:02:08,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:02:08,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:08,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:09,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:09,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:02:10,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:02:10,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:10,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:10,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:02:10,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:10,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:11,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:11,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:02:11,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:02:11,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:11,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:12,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:02:12,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:12,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:12,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:02:12,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:12,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:13,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:13,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:02:13,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:13,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:02:14,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:14,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:02:14,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:14,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:02:14,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:14,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:02:15,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:02:15,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:15,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:15,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:02:15,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:15,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:15,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2108 backedges. 0 proven. 1802 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2019-09-10 03:02:15,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:02:15,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 111] total 191 [2019-09-10 03:02:15,625 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:02:15,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 151 states [2019-09-10 03:02:15,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2019-09-10 03:02:15,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=739, Invalid=35551, Unknown=0, NotChecked=0, Total=36290 [2019-09-10 03:02:15,628 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 151 states. [2019-09-10 03:02:26,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:02:26,376 INFO L93 Difference]: Finished difference Result 238 states and 240 transitions. [2019-09-10 03:02:26,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-10 03:02:26,377 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 260 [2019-09-10 03:02:26,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:02:26,378 INFO L225 Difference]: With dead ends: 238 [2019-09-10 03:02:26,378 INFO L226 Difference]: Without dead ends: 236 [2019-09-10 03:02:26,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 703 GetRequests, 333 SyntacticMatches, 109 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17822 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=2414, Invalid=66492, Unknown=0, NotChecked=0, Total=68906 [2019-09-10 03:02:26,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-09-10 03:02:26,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 132. [2019-09-10 03:02:26,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-09-10 03:02:26,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 134 transitions. [2019-09-10 03:02:26,387 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 134 transitions. Word has length 260 [2019-09-10 03:02:26,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:02:26,387 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 134 transitions. [2019-09-10 03:02:26,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 151 states. [2019-09-10 03:02:26,388 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2019-09-10 03:02:26,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-10 03:02:26,389 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:02:26,389 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:02:26,390 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:02:26,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:02:26,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1054712892, now seen corresponding path program 18 times [2019-09-10 03:02:26,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:02:26,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:02:26,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:02:26,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:02:26,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:02:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:02:30,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2232 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 1278 trivial. 0 not checked. [2019-09-10 03:02:30,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:02:30,038 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:02:30,038 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:02:30,038 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:02:30,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:02:30,038 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-10 03:02:30,049 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:02:30,050 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:02:30,121 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:02:30,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:02:30,126 WARN L254 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 304 conjunts are in the unsatisfiable core [2019-09-10 03:02:30,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:02:30,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:30,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:30,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2232 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 1278 trivial. 0 not checked. [2019-09-10 03:02:30,654 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:02:30,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:33,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:33,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:33,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:33,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:33,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:35,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:35,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:02:36,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:02:36,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:36,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:38,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:02:38,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:38,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:39,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:02:39,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:39,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:40,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:02:40,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:40,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:42,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:02:42,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:42,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:43,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:02:43,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:43,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:44,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:44,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:02:45,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:02:45,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:45,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:46,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:02:46,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:46,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:47,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:47,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:02:48,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:48,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:02:49,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:02:49,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:49,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:50,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:02:50,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:50,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:51,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:02:51,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:51,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:52,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:02:52,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:52,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:53,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:53,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:02:54,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:02:54,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:54,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:54,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:54,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:02:55,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:02:55,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:55,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:56,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:56,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:02:56,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:56,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:02:57,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:57,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:02:58,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:58,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:02:58,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:58,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:02:59,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:59,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:02:59,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:59,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:02:59,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:02:59,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:03:00,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:03:00,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:00,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:00,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:00,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:03:00,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:03:00,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:00,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:01,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:03:01,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:01,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:01,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:01,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:03:01,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:03:01,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:01,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:01,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:01,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 03:03:01,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2232 backedges. 0 proven. 1908 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-09-10 03:03:01,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:03:01,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 114] total 121 [2019-09-10 03:03:01,977 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:03:01,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-10 03:03:01,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-10 03:03:01,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=424, Invalid=14096, Unknown=0, NotChecked=0, Total=14520 [2019-09-10 03:03:01,980 INFO L87 Difference]: Start difference. First operand 132 states and 134 transitions. Second operand 81 states. [2019-09-10 03:03:11,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:03:11,909 INFO L93 Difference]: Finished difference Result 244 states and 246 transitions. [2019-09-10 03:03:11,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-10 03:03:11,910 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 267 [2019-09-10 03:03:11,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:03:11,911 INFO L225 Difference]: With dead ends: 244 [2019-09-10 03:03:11,911 INFO L226 Difference]: Without dead ends: 242 [2019-09-10 03:03:11,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 722 GetRequests, 415 SyntacticMatches, 114 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4553 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=2109, Invalid=35721, Unknown=0, NotChecked=0, Total=37830 [2019-09-10 03:03:11,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-09-10 03:03:11,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 135. [2019-09-10 03:03:11,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-10 03:03:11,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 137 transitions. [2019-09-10 03:03:11,919 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 137 transitions. Word has length 267 [2019-09-10 03:03:11,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:03:11,919 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 137 transitions. [2019-09-10 03:03:11,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-10 03:03:11,920 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 137 transitions. [2019-09-10 03:03:11,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-09-10 03:03:11,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:03:11,921 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:03:11,922 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:03:11,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:03:11,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1208226657, now seen corresponding path program 18 times [2019-09-10 03:03:11,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:03:11,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:03:11,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:03:11,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:03:11,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:03:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:03:15,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2358 backedges. 0 proven. 1008 refuted. 0 times theorem prover too weak. 1350 trivial. 0 not checked. [2019-09-10 03:03:15,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:03:15,712 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:03:15,712 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:03:15,712 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:03:15,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:03:15,712 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:03:15,722 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:03:15,723 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:03:15,796 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:03:15,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:03:15,802 WARN L254 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 312 conjunts are in the unsatisfiable core [2019-09-10 03:03:15,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:03:23,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:23,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:23,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2358 backedges. 0 proven. 1008 refuted. 0 times theorem prover too weak. 1350 trivial. 0 not checked. [2019-09-10 03:03:23,388 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:03:23,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:26,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:26,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:26,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:26,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:26,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:28,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:28,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:03:30,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:30,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:03:31,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:03:31,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:31,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:33,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:03:33,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:33,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:34,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:34,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:03:35,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:03:35,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:35,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:37,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:03:37,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:37,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:38,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:38,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:03:39,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:03:39,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:39,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:40,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:03:40,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:40,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:42,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:42,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:03:43,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:43,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:03:44,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:03:44,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:44,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:45,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:03:45,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:45,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:46,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:03:46,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:46,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:47,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:03:47,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:47,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:48,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:48,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:03:49,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:03:49,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:49,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:50,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:50,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:03:51,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:51,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:03:51,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:03:51,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:51,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:52,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:52,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:03:53,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:53,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:03:54,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:54,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:03:54,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:54,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:03:55,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:03:55,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:55,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:56,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:03:56,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:56,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:56,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:56,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:03:57,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:57,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:03:57,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:57,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:03:58,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:03:58,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:58,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:58,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:58,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:03:58,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:58,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:03:59,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:59,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:03:59,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:59,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:03:59,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:03:59,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:03:59,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:04:00,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2358 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-09-10 03:04:00,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:04:00,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 82, 117] total 201 [2019-09-10 03:04:00,157 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:04:00,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 159 states [2019-09-10 03:04:00,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2019-09-10 03:04:00,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=779, Invalid=39421, Unknown=0, NotChecked=0, Total=40200 [2019-09-10 03:04:00,164 INFO L87 Difference]: Start difference. First operand 135 states and 137 transitions. Second operand 159 states.